Kosmas Kariotis

Mr. Kosmas Kariotis

Department of Informatics and Telecommunications, University of Thessaly, Lamía, Stereá Elláda, Greece
orcid

Research Focus & Metrics

Academic Career Length

3Years (2024-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
20 September 2024
Verified
Conference Paper
Closed access
KKKosmas Kariotis
Kosmas Kariotis
ADAntonios N. Dadaliaris
Antonios N. Dadaliaris
GKGeorge K. Kranas
George K. Kranas
GDGeorge Dimitriou
George Dimitriou
MDMichael F. Dossis
Michael F. Dossis
This work examines the advancements and challenges in analytical placement algorithms for Field-Programmable Gate Arrays (FPGAs), a pivotal aspect of FPGA design. The review highlights the transition from traditional placement methodologies to analytical methods, which offer enhanced solution quality, efficiency, and flexibility. The paper discusses the importance of considering the complexities inherent to FPGA design, including routability, clock signals, congestion, and heterogeneity. Furthermore, the paper emphasizes the use of advanced computing techniques, such as parallelization and deep learning, in FPGA placement. Despite recent advances, the paper identifies remaining gaps in fully addressing resource heterogeneity, clock feasibility, and scalability challenges, suggesting these as areas for future research.

13 December 2024
Verified
Conference Paper
Open access
GKGeorge Kranas
George Kranas
KKKosmas Kariotis
Kosmas Kariotis
ADAntonios Dadaliaris
Antonios Dadaliaris
GSGeorge Stamoulis
George Stamoulis
Athanasios KakarountasAthanasios Kakarountas
Athanasios Kakarountas

19 September 2025
Verified
Conference Paper
Closed access
GKGeorge K. Kranas
George K. Kranas
KKKosmas Kariotis
Kosmas Kariotis
MDMichael F. Dossis
Michael F. Dossis
ADAntonios N. Dadaliaris
Antonios N. Dadaliaris
As integrated circuit (IC) complexity increases, early-stage routing congestion prediction becomes critical for ensuring design quality and minimizing costly iterations. This paper presents a unified, open-source framework that integrates four complementary congestion estimation techniques. The framework operates on Bookshelf-format benchmarks and provides quantitative metrics, comparative visualizations, and statistical validation to assess congestion risk before detailed routing. Experimental results across ten ISPD benchmarks demonstrate the trade-offs between accuracy, runtime, and spatial sensitivity for each method. The framework's modular architecture supports extensibility for research and production use. By enabling early detection of routing hotspots and method-specific insights, this tool empowers VLSI designers to make informed placement and optimization decisions.

19 September 2025
Verified
Conference Paper
Closed access
KKKosmas Kariotis
Kosmas Kariotis
GKGeorge K. Kranas
George K. Kranas
GDGeorge Dimitriou
George Dimitriou
MDMichael F. Dossis
Michael F. Dossis
ADAntonios N. Dadaliaris
Antonios N. Dadaliaris
This work examines packages for FPGA development hosted on the PyPI repository and their role in the FPGA design flow. Python is seen as a way to simplify FPGA development, an alternative to traditional HDLs and proprietary tools. A statistical analysis of the published packages showed gaps in areas such as synthesis and place and route, and low vendor coverage. Python shows promise in making FPGA workflows more accessible to developers, especially for high-level design and verification due to its abstraction and simpler syntax. But more work is needed to make the FPGA design flow with Python more vendor-agnostic for the vendor-dependent stages. Moreover, since community support is sparse and development has stalled for many, focusing on communities and sustaining long-term growth is key. Since this research is limited to the PyPI, scavenging other repositories is a promising area for future research.