P. Kollig, B. M. Al-Hashimi, and K. M. Abbott. "Efficient scheduling of behavioral descriptions in high-level synthesis". In IEE Proc. of Computers and Digital Tech., vol. 144(2), pages 75--82, March 1997. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Improving the Schedule Quality of Static-List.. - Govindarajan, Vemuri (2000) (Correct)
....More importantly, the idea of multiple levels of clusters acting as rubber bands and the associated costs for operation selection and assignment priority are unique features of the proposed static list TCS algorithm. We have compared our work with a recent static list scheduling algorithm [4] proposed by Kollig et al. that is shown to outperform other popular scheduling techniques. For a number of benchmarks, we showed that our algorithm generates higher quality schedules as compared to Kollig s technique. The results also conclude that the our algorithm, although having a ....
P. Kollig, B. M. Al-Hashimi, and K. M. Abbott. "Efficient scheduling of behavioral descriptions in high-level synthesis". In IEE Proc. of Computers and Digital Tech., vol. 144(2), pages 75--82, March 1997.
Static-List Time-Constrained Scheduling Based On.. - Govindarajan, Vemuri (2000) (Correct)
....that have a low complexity and yet produce good quality schedules. The Time Constrained Scheduling (tcs) problem minimizes the number of functional units required to schedule a particular Data Flow Graph (dfg) within a specified number of time steps. Over the past few years a number of techniques [1 6] have been proposed to solve the tcs problem. These techniques can be classified (see Figure 1) broadly into two categories, the Integer Linear Programming (ilp) and heuristic approaches. In the ilp approaches [1 3] the time taken to search for the optimal solution increases exponentially with ....
....clusteringbased tcs technique. It is a static list scheduling algorithm with a simple operation selection function and two cost functions that collectively determine the time step where the operation is scheduled. We have compared our work with a recent static list scheduling algorithm [6] proposed by Kollig et.al. Results presented in [6] show that Kollig s algorithm generates high quality schedules similar to that of fds and other popular scheduling techniques. We obtained results from our algorithm and an implementation of Kollig s algorithm for a number of benchmarks. It is ....
[Article contains additional citation context not shown here]
P.Kollig, B.M.Al-Hashimi, and K.M.Abbott. "Efficient scheduling of behavioral descriptions in high-level synthesis ". In IEE Proceedings of Computers and Digital Tech., volume 144(2), pages 75--82, March 1997.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC