Abstract
Envelopes, a run-time mechanism which automatically supports adaptive local queues for MIMD load balancing, are proposed and demonstrated. Envelopes promote generality and language simplicity, while sustaining efficiency.
The local queues, one for each PE, contain a get_work task which pulls activities from a global list. In addition, they contain one or more envelopes within which activities are actually performed. These queues are adaptive because each get_work task competes with its own envelopes. The more load the PE has, the less additional work it will get. Envelopes are reused for successive activities, thus increasing the granularity. New envelopes are only created to cope with program data and synchronization dependencies, thereby avoiding deadlocks.
Experiments with envelopes performed and efficiency results are reported.
This work has been funded in part by the US-Israel BSF Grant No. 88-00045 and the France-Israel BSF Grant No. 3310-2-90
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Y. Ben-Asher, D. G. Feitelson, and L. Rudolph, “ParC — an extension of C for shared memory parallel processing”. Oct 1990. Manuscript, Dept. Computer Science, The Hebrew University of Jerusalem. Submitted for publication.
E. Mohr, D. A. Kranz, and R. H. Halstead, Jr., “Lazy task creation: a technique for increasing the granularity of parallel programs”. IEEE Trans. Parallel & Distributed Syst. 2(3), pp. 264–280, Jul 1991.
C. D. Polychronopoulos and D. J. Kuck, “Guided self scheduling: a practical scheduling scheme for parallel supercomputers”. IEEE Trans. Comput. C-36(12), pp. 1425–1439, Dec 1987.
L. Rudolph, M. Slivkin-Allalouf, and E. Upfal, “A simple load balancing scheme for task allocation in parallel machines”. In 3rd Symp. Parallel Algorithms & Architectures, pp. 237–245, Jul 1991.
V. Sarkar, Partitioning and Scheduling Parallel Programs for Multiprocessors. MIT Press, 1989.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Shteiman, K., Feitelson, D., Rudolph, L., Exman, I. (1992). Envelopes in adaptive local queues for MIMD load balancing. In: Bougé, L., Cosnard, M., Robert, Y., Trystram, D. (eds) Parallel Processing: CONPAR 92—VAPP V. VAPP CONPAR 1992 1992. Lecture Notes in Computer Science, vol 634. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55895-0_445
Download citation
DOI: https://doi.org/10.1007/3-540-55895-0_445
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55895-8
Online ISBN: 978-3-540-47306-0
eBook Packages: Springer Book Archive