ABSTRACT
List scheduling algorithms attempt to minimize latency under resource constraints using a priority list. We propose a new heuristic that can be used in conjunction with any priority function. At each time-step, the proposed clustering heuristic tries to find a best match between ready operations and the resource set. The heuristic arbitrates among equal priority operations based on operation-clusters formed from the dependency graph. Based on this heuristic we have presented a new Cone-Based List Scheduling (\CBLS\@) algorithm. Results presented in this paper compare \CBLS\ with the well-known Force Directed List Scheduling (\FDLS\@) algorithm, for several synthesis benchmarks. In cases where \FDLS\ produces sub-optimal schedules, \CBLS\ produces better schedules and in other cases \CBLS\ performs as good as \FDLS\@. Moreover, in conjunction with a simple priority function (namely the self-force of an operator), \CBLS\ results in considerable improvement in latency when compared to \FDLS\ that has the same priority function. Finally, we show that \CBLS\ with the simple priority function performs better in execution time as well as latency when compared to the original \FDLS\ that has a relatively complex priority function.
- [1] Raul Camposano, Wayne Wolf, "High-Level VLSI Synthesis", Kluwer Academic Publishers, 1991. Google ScholarDigital Library
- [2] Daniel Gajski, Nikil Dutt, "High-Level Synthesis", Kluwer Academic Publishers, 1992.Google Scholar
- [3] Pierre G. Paulin and John P. Knight, "Force Directed Scheduling for the behavioral synthesis of ASICs," IEEE Trans. Computer Aided Design, Vol. 8, pp. 661-679, June 1989.Google ScholarCross Ref
- [4] Jan Vanhoof et. al., "High-Level Synthesis for Real-Time Digital Signal Processing", Kluwer Academic Publishers, 1993. Google ScholarDigital Library
- [5] Phillip E. Mattison, "Practical Digital Video with Programming Examples in C", John Wiley & Sons, Inc., 1994. Google ScholarDigital Library
- [6] Leland B. Jackson, "Digital Filters and Signal Processing", Second Edition, Kluwer Academic Publishers, 1989. Google ScholarDigital Library
- [7] Michael Wolfe, "High Performance Compilers for Parallel Computing", Addison-Wesley Pub., 1996. Google ScholarDigital Library
- [8] Jacek M. Zurada, "Introduction to Artificial Neural Systems", West Publishing Company, 1992. Google ScholarDigital Library
- Cone Based Clustering for List Scheduling Algorithms
Recommendations
Multi-heuristic list scheduling genetic algorithm for task scheduling
SAC '03: Proceedings of the 2003 ACM symposium on Applied computingScheduling tasks on a multi-processor system involves making a choice as to the order in which several tasks can be executed and assigned to processors. The problem is to find a schedule that will minimize the execution time of a program. Because task ...
List scheduling revisited
We consider the problem of scheduling n jobs on m identical parallel machines to minimize a regular cost function. The standard list scheduling algorithm converts a list into a feasible schedule by focusing on the job start times. We prove that list ...
Comments