Name
Abstract | ||
|---|---|---|
This paper presents new algorithms for the scheduling and allocation phases in high-level synthesis under time and resource constraints. This is achieved by formulating these problems in terms of Liapunov's stability theorem using a transformation technique between the design space and the dynamic system space. These algorithms are based on moves in the design space, which correspond to the moves toward the equilibrium point in the dynamic system space. The scheduling algorithm (MFS) takes care of mutually exclusive operations, loop folding, multicycle operations, chained operations, and pipelining (structural and functional). The mixed scheduling-allocation algorithm (MFSA) can handle all of the above scheduling applications as well as simultaneously performing allocation of functional units, registers, and interconnects while minimizing the overall cost. |
Year | DOI | Venue |
|---|---|---|
2000 | 10.1109/92.863623 | IEEE Trans. VLSI Syst. |
Keywords | Field | DocType |
high-level synthesis,functional unit,digital asics,scheduling algorithm,chained operation,mixed scheduling-allocation algorithm,dynamic system space,new algorithm,scheduling application,equilibrium point,design space,allocation phase,stability-based algorithm,hardware,clustering algorithms,pipelining,scheduling,integrated circuit design,stability,parallel processing,indexing terms,registers,application specific integrated circuits,high level synthesis,dynamic system | Pipeline (computing),Digital electronics,Computer science,Scheduling (computing),High-level synthesis,Equilibrium point,Algorithm,Electronic engineering,Application-specific integrated circuit,Real-time computing,Integrated circuit design,Dynamical system | Journal |
Volume | Issue | ISSN |
8 | 4 | 1063-8210 |
Citations | PageRank | References |
2 | 0.50 | 15 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| M. Nourani | 1 | 149 | 15.25 |
| C. Papachristou | 2 | 56 | 5.81 |