Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page
Demo Data from EDBT 2026 / reviewers in the wild / expert

Yaw Fann

dblp:72/5166 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
0since 2021 · last 1995
—ORCID · none

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

Systems, architecture and hardware · 2 · 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
Electronic design automation · 67% Embedded and real-time systems · 33%

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

TopicWeightPapersLastEvidence papers
Embedded and real-time systems › real-time scheduling › multiprocessor scheduling
global scheduling		 0.011994
Global Scheduling for High-Level Synthesis Applications · DAC 1994
Electronic design automation
high-level synthesis		 0.011994
Global Scheduling for High-Level Synthesis Applications · DAC 1994
Electronic design automation › high-level synthesis › scheduling
resource-constrained scheduling		 0.011994
Global Scheduling for High-Level Synthesis Applications · DAC 1994

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

loop scheduling · 0.0global scheduling · 0.0conditional branch handling · 0.0
YearPublicationVenuePosition
1995 Global scheduling with code-motions for high-level synthesis applications
abstract
In this paper, we present a global scheduling technique for synthesis applications. The algorithm accepts a specification containing conditional branches and while-loop constructs and schedules it for a given set of resources. The algorithm performs several types of code motions across different basic blocks and trades off cost with performance. Several real-life examples taken from Numerical Recipes in C are used to demonstrate the efficacy of the approach. The results indicate that code-motions are very important for achieving significant speed-ups for synthesis applications.>
Minjoong Rim, Yaw Fann, Rajiv Jain
 IEEE Trans. Very Large Scale Integr. Syst.2
1994 Global Scheduling for High-Level Synthesis Applications
abstract
In this paper, we present a resource-constrained global scheduling technique for synthesis applications. The algorithm accepts speci cations containing conditional branches and while loops and schedules them for a given set of resources. The algorithm performs several types of code motions across di erent basic blocks and trades o cost with performance. Several real-life examples are used to demonstrate the e cacy of the approach. 1
Yaw Fann, Minjoong Rim, Rajiv Jain
 DAC1