Name
Abstract | ||
|---|---|---|
Scheduling is an important step in high-level synthesis (HLS). In our tool, we perform scheduling in two steps: coarse-grain scheduling, in which we take into account the whole control structure of the program including imperfect loop nests, and fine-grain scheduling, where we refine each logical step using a detailed description of the available resources. This paper focuses on the second step. Tasks are modeled as reservation tables (or templates) and we express resource constraints using dis-equations (i.e., negations of equations). We give an exact algorithm based on a branch-and-bound method, coupled with variants of Dijkstra's algorithm, which we compare with a greedy heuristic. Both algorithms are tested on pieces of scientific applications to demonstrate their suitability for HLS tools. |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1109/DATE.2006.243957 | DATE |
Keywords | Field | DocType |
fine-grain scheduling,available resource,hls tool,greedy heuristic,detailed description,coarse-grain scheduling,resource constraint,logical step,important step,exact algorithm,branch-and-bound method,dijkstra s algorithm,dijkstra algorithm,greedy algorithms,high level synthesis,very large scale integration,design automation,embedded system,scheduling algorithm,control structure | Mathematical optimization,Fair-share scheduling,Computer science,Flow shop scheduling,Two-level scheduling,Real-time computing,Genetic algorithm scheduling,Rate-monotonic scheduling,Earliest deadline first scheduling,Dynamic priority scheduling,Round-robin scheduling | Conference |
ISSN | ISBN | Citations |
1530-1591 | 3-9810801-0-6 | 0 |
PageRank | References | Authors |
0.34 | 10 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Hadda Cherroun | 1 | 21 | 11.14 |
| Alain Darte | 2 | 888 | 56.40 |
| Paul Feautrier | 3 | 1207 | 79.63 |