Abstract
The objective of the parallelism-independent (PI) scheduling is minimization of the completion time of a parallel application for any number of processing elements in the computing system. We propose several parallelism-independent algorithms which are either applicable for distributed computing systems, i.e. systems of autonomous processors connected via communication links (in this case we provide explicit message communication scheduling) or for tightly coupled multiprocessor systems or architectures exploiting instruction level parallelism as well. The algorithms are hybrid but predominantly done at compile time in order to reduce the dynamic overhead and scheduling hardware. All the traditional static scheduling algorithms produce machine codes with fixed degree of parallelism which cannot be executed efficiently on computer systems with different degrees of parallelism. Our algorithms eliminate this problem closely related to the distribution of parallel programs.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Y-K. Kwoq and I. Ahmad, “Static Scheduling Algorithms for Allocating Directed Task Graphs”, ACM Computing Surveys, Vol. 31, No. 4, Dec. 1999. pp. 406–471.
Y-K. Kwoq and I. Ahmad, “Dynamic critical-path scheduling: An effective technique for allocating task graphs to multiprocessors,” IEEE Trans. Parallel Distrib. Syst. 7, 5, pp. 506–521.
H. Kasahara and S. Narita, “Practical multiprocessing scheduling algorithms for efficient parallel processing”, IEEE Trans on Comput., vol. C-33, Nov. 1984, pp. 1023–1029.
A. Gerasoulis and T. Yang, “A comparison of clustering heurstics for scheduling direct ayclic graphs on multiprocessors,” J. Parallel and Distributed Computing, vol. 16, 1992, pp. 276–291.
T. Yang and A. Gerasoulis, “DSC: Scheduling parallel tasks on unbounded number of processors,” IEEE Trans Parallel and Distributed Systems, vol. 5, no. 9, Sept. 1994, pp. 951–967.
B. Shirazi, M. Wang and G. Pathak, “Analysis and evaluation of heuristic methods for static task scheduling”, J. Parallel Distrib. Comput. 10, Nov. 1990, 222–232.
S. N. Bhatt, F. R. K. Chung, F. Thomson and A. L. Rosenberg, “On Optimal Strategies for Cycle-Stealing in Networks of Workstations”, IEEE Trans. on Computers, Vol. 46, No. 5, May 1997, pp. 545–557.
Y. Iwamoto, R. Adachi, K. Ootsu, T. Yoshinaga and T. Baba, “High Speed Receiving Process of MPI by Receiving Message Prediction”, IPSJ, Vol. 42, No. 4, April 2001, pp. 812–820.
H. Ishihata, K. Kobayashi and M. Ishii, “Design and Implementation of Parallel Program Execution Environment for SMP Cluster”, Trans. of IEICE, Vol. J84-D-I, No. 6 2001, pp. 568–575.
M.-Y. Wu, W. Shu and J. Gu, “Efficient Local Search for DAG Scheduling”, IEEE Trans. on Parallel and Distributed Systems, Vol. 12, No. 6 2002, pp. 617–627.
Pei Yu SPei Yu Song, K. Nikolova, T. Yoshinaga and M. Sowa, “Compiler-Assisted Scheduling Scheme with Low-Cost Runtime Suppert for Control Predicated ILP”, IEICE Conference, Tokyo, Sep. 2001.
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
Nikolova, K., You, S.P., Sowa, M. (2002). Compiler-Controlled Parallelism-Independent Scheduling for Parallel and Distributed Systems. In: Fagerholm, J., Haataja, J., Järvinen, J., Lyly, M., Råback, P., Savolainen, V. (eds) Applied Parallel Computing. PARA 2002. Lecture Notes in Computer Science, vol 2367. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48051-X_48
Download citation
DOI: https://doi.org/10.1007/3-540-48051-X_48
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43786-4
Online ISBN: 978-3-540-48051-8
eBook Packages: Springer Book Archive