Scheduling and binding algorithms for high-level synthesis
Pierre G. Paulin, John P. Knight · 1989
New algorithms for high-level synthesis are presented. The first performs scheduling under hardware resource constraints and improves on commonly used list scheduling techniques by making use of a global priority function. A new design-space exploration technique, which combines this algorithm with an existing one based on time constraints, is also presented.