Soft Scheduling in High Level Synthesis (1998) [4 citations — 0 self]
Download:
|
|
by Jianwen Zhu, Daniel D. Gajski
in Proceedings of the 36th Design Automation Conference
http://www.ics.uci.edu/~cad/publications/conferences/1995-99/dac99_soft.ps.gz
Add To MetaCart
Abstract:
In this paper, we establish a theoretical framework for a new concept of scheduling called soft scheduling. In contrasts to the traditional schedulers referred as hard schedulers, soft schedulers make soft decisions at a time, or decisions that can be adjusted later. Soft scheduling has a potential to alleviate the phase coupling problem that has plagued traditional high level synthesis (HLS), HLS for deep submicron design and VLIW code generation. We then develop a specific soft scheduling formulation, called threaded schedule, under which a linear, optimal (in the sense of online optimality) algorithm is guaranteed. 1
Citations
| 639 | Efficiently Computing Static Single Assignment Form and the Control Dependence Graph – Cytron, Ferrante, et al. - 1991 |
| 192 | Force-directed scheduling for the behavioral synthesis of ASIC’s – Paulin, Knight - 1989 |
| 71 | Path-Based Scheduling for Synthesis – Camposano - 1991 |
| 54 | Relative scheduling under timing constraints: Algorithms for high-level synthesis of digital circuits – Ku, Micheli - 1992 |
| 25 | 3D scheduling: High-level synthesis with floorplanning – Weng, Parker - 1991 |
| 22 | Simultaneous scheduling and allocation for cost constrained op timal architectural synthesis – Gebotys, Elmasry - 1991 |
| 20 | Behavioral synthesis with interfaces – NESTOR, E - 1986 |
| 16 | Automatic High-Level Synthesis of Partitioned Busses – Ewering - 1990 |
| 15 | Layout-driven RTL binding techniques for high-level synthesis using accurate estimators – Xu, Kurdahi - 1997 |
