Abstract
We study a scheduling or allocation problem with the following characteristics: The goal is to execute a number of unspecified tasks on a parallel machine in any order and as quickly as possible. The tasks are maintained by a central monitor that will hand out batches of a variable number of tasks to requesting processors. A processor works on the batch assigned to it until it has completed all tasks in the batch, at which point it returns to the monitor for another batch. The time needed to execute a task is assumed to be a random variable with known mean and variance, and the execution times of distinct tasks are assumed to be independent. Moreover, each time a processor obtains a new batch from the monitor, it suffers a fixed delay. The challenge is to allocate batches to processors in such a way as to achieve a small expected overall finishing time. We introduce a new allocation strategy, the Bold strategy, and show that it outperforms other strategies suggested in the literature in a number of simulations.
Preview
Unable to display preview. Download preview PDF.
References
Banicescu, I., and Hummel, S. F., Balancing processor loads and exploiting data locality in N-body simulations, in Proc. Supercomputing 1995 (http://www.sdsc.edu/SC95/techpapers.html).
Bratley, P., Fox, B. L., and Schrage, L. E., A Guide to Simulation, Springer-Verlag, New York, 1983.
Cheng, R. C. H., The generation of gamma variables with non-integral shape parameter, Appl. Statist. 26 (1977), pp. 71–75.
Devroye, L., Non-Uniform Random Variate Generation, Springer-Verlag, New York, 1986.
Flynn, L. E., and Hummel, S. F., A mathematical analysis of scheduling parallel loops in decreasing-size chunks, manuscript. A preliminary version is available as IBM Research Report No. RC 18462, Oct. 1992.
Grimmett, G. R., and Stirzaker, D. R., Probability and Random Processes (2nd ed.), Oxford University Press, Oxford, 1992.
Gumbel, E. J., The maxima of the mean largest value and of the range, Ann. Math. Statist. 25 (1954), pp. 76–84.
Gut, A., An Intermediate Course in Probability, Springer-Verlag, New York, 1995.
Hartley, H. O., and David, H. A., Universal bounds for mean range and extreme observation, Ann. Math. Statist. 25 (1954), pp. 85–99.
Hummel, S. F., Schmidt, J., Uma, R. N., and Wein, J., Load-sharing in heterogeneous systems via weighted factoring, in Proc. 8th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA 1996), to appear.
Hummel, S. F., Schonberg, E., and Flynn, L. E., Factoring: A method for scheduling parallel loops, Comm. Assoc. Comput. Mach. 35:8 (1992), pp. 90–101.
Kruskal, C. P., and Weiss, A., Allocating independent subtasks on parallel processors, IEEE Trans. Software Eng. 11 (1985), pp. 1001–1016.
McGeoch, C. C., Toward an Experimental Method for Algorithm Simulation, INFORMS J. Comput. 8 (1996), pp. 1–15.
Mehlhorn, K., and Näher, S., LEDA: A platform for combinatorial and geometric computing, Comm. Assoc. Comput. Mach. 38:1 (1995), pp. 96–102.
Polychronopoulos, C. D., and Kuck, D. J., Guided self-scheduling: A practical scheduling scheme for parallel supercomputers, IEEE Trans. Comput. 36 (1987), pp. 1425–1439.
Tzen, T. H., and Ni, L. M., Dynamic loop scheduling for shared-memory multiprocessors, in Proc. International Conference on Parallel Processing (ICPP 1991), pp. II 247–II 250.
Walker, A. J., An efficient method for generating discrete random variables with general distributions, ACM Trans. Math. Software 3 (1977), pp. 253–256.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hagerup, T. (1996). Allocating independent tasks to parallel processors: An experimental study. In: Ferreira, A., Rolim, J., Saad, Y., Yang, T. (eds) Parallel Algorithms for Irregularly Structured Problems. IRREGULAR 1996. Lecture Notes in Computer Science, vol 1117. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0030094
Download citation
DOI: https://doi.org/10.1007/BFb0030094
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61549-1
Online ISBN: 978-3-540-68808-2
eBook Packages: Springer Book Archive