Loading...
Please wait, while we are loading the content...
2005b): Time-constrained scheduling of large pipelined datapaths
| Content Provider | CiteSeerX |
|---|---|
| Author | Arató, Péter Mann, Zoltán Ádám Orbán, Rás |
| Abstract | This paper addresses the most crucial optimization problem of high-level synthesis: scheduling. A formal framework is described that was tailored speci cally for the de nition and investigation of the time-constrained scheduling problem of pipelined datapaths. Theoretical results are presented on the complexity of the problem. Moreover, two new heuristic algorithms are introduced. The rst one is a genetic algorithm, which, unlike previous approaches, searches the space of schedulings directly. The second algorithm realizes a heuristic search using constraint logic programming methods. The performance of the proposed algorithms has been evaluated on a set of benchmarks and compared to previous approaches. |
| File Format | |
| Journal | J. Syst. Arch |
| Language | English |
| Access Restriction | Open |
| Subject Keyword | Large Pipelined Datapaths Time-constrained Scheduling Previous Approach Constraint Logic Genetic Algorithm Rst One Second Algorithm Time-constrained Scheduling Problem New Heuristic Algorithm Crucial Optimization Problem High-level Synthesis Theoretical Result Pipelined Datapaths Heuristic Search Formal Framework |
| Content Type | Text |
| Resource Type | Article |
