Abstract
This paper presents a static scheduler to carry out the best assignment of a Directed Acyclic Graph (DAG) representing an application program. Some characteristics of the DAG, a decision model, and the evaluation parameters for choosing the best solution provided by the selected scheduling algorithms are defined. The selection of the scheduling algorithms is based on five decision levels. At each level, a subset of scheduling algorithms is selected. When the scheduler was tested with a series of DAGs having different characteristics, the scheduler’s decision was right 100% of the time in those cases in which the number of available processors is known.1
This project was partially funded by FONDECYT 1000074.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Lewis, T., El-Rewini, H.: Parallax: A Tool for Parallel Program Scheduling. IEEE Parallel and Distributed Technology, Vol. 1.2 (1993)
Kwok, Y., Ahmad, I.: Benchmarking and Comparison of the Task Graph Scheduling Algorithms. J. of Parallel and Distributed Processing. Vol. 59.3 (1999) 381–422
Solar, M., Inostroza, M.: A Parallel Compiler Scheduler. XXI Int. Conf. of the Chilean Computer Science Society, IEEE CS Press, (2001) 256–263
Kruatrachue, B., Lewis, T.: Duplication Scheduling Heuristics: A New Precedence Task Scheduler for Parallel Processor Systems. Oregon State University. (1987)
Kim, S., Browne, J.: A General Approach to Mapping of Parallel Computation upon Multiprocessor Architecture. Int. Conf. on Parallel Processing, Vol. 3. (1988)
Sarkar, V.: Partitioning and Scheduling Parallel Programs for Multiprocessors. MIT Press, Cambridge, MA, (1989)
Yang, T., Gerasoulis, A.: DSC: Scheduling Parallel Tasks on an Unbounded Number of Processors. IEEE Trans. Parallel and Distributed Systems. Vol. 5.9 (1994)
Zhou, H.: Scheduling DAGs on a Bounded Number of Processors. Int. Conf. on Parallel & Distributed Processing. Sunnyvale (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Solar, M., Inostroza, M. (2002). An Automatic Scheduler for Parallel Machines. In: Monien, B., Feldmann, R. (eds) Euro-Par 2002 Parallel Processing. Euro-Par 2002. Lecture Notes in Computer Science, vol 2400. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45706-2_27
Download citation
DOI: https://doi.org/10.1007/3-540-45706-2_27
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44049-9
Online ISBN: 978-3-540-45706-0
eBook Packages: Springer Book Archive