Abstract
We study the following general online scheduling problem. Parallel jobs arrive dynamically according to the dependencies between them. Each job requests a certain number of processors with a specific communication configuration, but its running time is not known until it is completed. We present optimal online algorithms for PRAMs, hypercubes and one — dimensional meshes, and obtain optimal tradeoffs between the competitive ratio and the largest number of processors requested by any job. Our work shows that for efficient online scheduling it is necessary to use virtualization, i.e., to schedule parallel jobs on fewer processors than requested while preserving the work. We prove that tree constraints are complete for the scheduling problem, i.e., any algorithm that solves the scheduling problem if the dependency graph is a tree can be converted to solve the general problem equally efficiently. This shows that the structure of a dependency graph is not as important for online scheduling as it is for offline scheduling, although even simple dependencies make the problem much harder than scheduling independent jobs.
Preview
Unable to display preview. Download preview PDF.
References
S. N. Bhatt, F.R.K. Chung, j-W.Hong, F.T. Leighton, and A.L. Rosenberg. Optimal simulations by butterfly networks. In STOC, pages 192–204. ACM, 1988.
G.E Blelloch. Vector for Data-Parallel Computing. MIT-Press, Cambridge MA, 1990.
E. Davis and J.M. Jaffe. Algorithm for scheduling tasks in unrelated processors. JACM, pages 712–736, 1981.
F. G. Feitelson and L. Rudolph. Wasted resources in gang scheduling. In Proc. of the 5th Jerusalem Conference on Information Technology, 1990.
A. Feldmann, J. Sgall, and S.-H Teng. Dynamic scheduling on parallel machine. In FOCS, pages 111–120, IEEE, 1991.
M.R. Garey nad D. S. Johnson. Computer and intractability: a guide to the theory of NP-completeness. Freeman, San Francisco, 1979.
R.L Graham, Bounds for certain multiprocessor anomalies. Bell system Technical Jouranl, pages 1563–1581, 1966.
K. Hwang and F. A. Briggs. Computer Architecture and Parallel Processing. McGraw-Hill, Inc. 1984.
S.R. Kosaraju and M.j. Atallah. Optimal simulation between mesh-connected arrays of processors. In STOC, pages 264–272. ACM. 1986.
H.T. Kung. Computational Models for Parallel Computers. Techical report, CMU-CS-88-164, 1987.
J. L. Peterson and A. Silberschatz. Operating system Concepts. Addison-Wesley Publishing Company, 1985.
D.D Sleator and R.E. Tarjan. Amortized efficiency of list update and paging rules. CACM, 28(2): 202–208, 1985.
D. B Shamoys, J. Wein, and D.P Williamson. Scheduling parallel machines on-line. In FOCS, pages 131–140, 1991, IEEE.
Q. Wang and K.H Cheng a Heuristic of scheduling Parallel Tasks and its Analysis. SIAM journal on computing, pages 281–294, 1992.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Papadopoulos, C.V. (1994). A dynamic algorithm for online scheduling of parallel processes. In: Halatsis, C., Maritsas, D., Philokyprou, G., Theodoridis, S. (eds) PARLE'94 Parallel Architectures and Languages Europe. PARLE 1994. Lecture Notes in Computer Science, vol 817. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58184-7_134
Download citation
DOI: https://doi.org/10.1007/3-540-58184-7_134
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58184-0
Online ISBN: 978-3-540-48477-6
eBook Packages: Springer Book Archive