Panagiotis Theocharis

dblp:123/7802 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 2016
0000-0002-5855-0342ORCID · reported

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Reconfigurable computing and FPGAs · 70% Electronic design automation · 23% Embedded and real-time systems · 7%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Reconfigurable computing and FPGAs
coarse-grained reconfigurable architecture
0.212016
A Bimodal Scheduler for Coarse-Grained Reconfigurable Arrays · ACM Trans. Archit. Code Optim. 2016
Electronic design automation
high-level synthesis
0.212016
A Bimodal Scheduler for Coarse-Grained Reconfigurable Arrays · ACM Trans. Archit. Code Optim. 2016
Reconfigurable computing and FPGAs › coarse-grained reconfigurable architecture
loop mapping
0.212016
A Bimodal Scheduler for Coarse-Grained Reconfigurable Arrays · ACM Trans. Archit. Code Optim. 2016
Reconfigurable computing and FPGAs
modulo scheduling
0.212016
A Bimodal Scheduler for Coarse-Grained Reconfigurable Arrays · ACM Trans. Archit. Code Optim. 2016
Embedded and real-time systems
reconfigurable embedded systems
0.112016
A Bimodal Scheduler for Coarse-Grained Reconfigurable Arrays · ACM Trans. Archit. Code Optim. 2016

Methods — techniques the papers use, named apart from their topics

priority functions · 0.2cost function · 0.2backtracking · 0.2
YearPublicationVenuePosition
2016 A Bimodal Scheduler for Coarse-Grained Reconfigurable Arrays
abstract
Compilers for Course-Grained Reconfigurable Array (CGRA) architectures suffer from long compilation times and code quality levels far below the theoretical upper bounds. This article presents a new scheduler, called the Bimodal Modulo Scheduler (BMS), to map inner loops onto (heterogeneous) CGRAs of the Architecture for Dynamically Reconfigurable Embedded Systems (ADRES) family. BMS significantly outperforms existing schedulers for similar architectures in terms of generated code quality and compilation time. This is achieved by combining new schemes for backtracking with extended and adapted forms of priority functions and cost functions, as described in the article. BMS is evaluated by mapping multimedia and software-defined radio benchmarks onto tuned ADRES instances.
Panagiotis Theocharis, Bjorn De Sutter
ACM Trans. Archit. Code Optim.1