Envelopes in adaptive local queues for MIMD load balancing

Konstantin Shteiman; Dror Feitelson; Larry Rudolph; Iaakov Exman

doi:10.1007/3-540-55895-0_445

Envelopes in adaptive local queues for MIMD load balancing

Konstantin Shteiman, Dror Feitelson, Larry Rudolph, Iaakov Exman

The Rachel and Selim Benin School of Engineering and Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

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 puDs 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.

Original language	English
Title of host publication	Parallel Processing
Subtitle of host publication	CONPAR 1992 ─ VAPP V - 2nd Joint International Conference on Vector and Parallel Processing, Proceedings
Editors	Luc Bouge, Michel Cosnard, Yves Robert, Denis Trystram
Publisher	Springer Verlag
Pages	479-484
Number of pages	6
ISBN (Print)	9783540558958
DOIs	https://doi.org/10.1007/3-540-55895-0_445
State	Published - 1992
Event	2nd Joint International Conference on Vector and Parallel Processing, CONPAR 1992 - Lyon, France Duration: 1 Sep 1992 → 4 Sep 1992

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	634 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	2nd Joint International Conference on Vector and Parallel Processing, CONPAR 1992
Country/Territory	France
City	Lyon
Period	1/09/92 → 4/09/92

Bibliographical note

Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 1992.

Keywords

Envelopes
Granularity
Load balancing
MIMD
Run-time systems
Shared memory

Access to Document

10.1007/3-540-55895-0_445

Cite this

Shteiman, K., Feitelson, D., Rudolph, L., & Exman, I. (1992). Envelopes in adaptive local queues for MIMD load balancing. In L. Bouge, M. Cosnard, Y. Robert, & D. Trystram (Eds.), Parallel Processing: CONPAR 1992 ─ VAPP V - 2nd Joint International Conference on Vector and Parallel Processing, Proceedings (pp. 479-484). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 634 LNCS). Springer Verlag. https://doi.org/10.1007/3-540-55895-0_445

Shteiman, Konstantin ; Feitelson, Dror ; Rudolph, Larry et al. / Envelopes in adaptive local queues for MIMD load balancing. Parallel Processing: CONPAR 1992 ─ VAPP V - 2nd Joint International Conference on Vector and Parallel Processing, Proceedings. editor / Luc Bouge ; Michel Cosnard ; Yves Robert ; Denis Trystram. Springer Verlag, 1992. pp. 479-484 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{dce3916159e2486d9f2879e3579e841f,

title = "Envelopes in adaptive local queues for MIMD load balancing",

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 puDs 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.",

keywords = "Envelopes, Granularity, Load balancing, MIMD, Run-time systems, Shared memory",

author = "Konstantin Shteiman and Dror Feitelson and Larry Rudolph and Iaakov Exman",

note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 1992.; 2nd Joint International Conference on Vector and Parallel Processing, CONPAR 1992 ; Conference date: 01-09-1992 Through 04-09-1992",

year = "1992",

doi = "10.1007/3-540-55895-0_445",

language = "אנגלית",

isbn = "9783540558958",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "479--484",

editor = "Luc Bouge and Michel Cosnard and Yves Robert and Denis Trystram",

booktitle = "Parallel Processing",

address = "גרמניה",

}

Shteiman, K, Feitelson, D, Rudolph, L & Exman, I 1992, Envelopes in adaptive local queues for MIMD load balancing. in L Bouge, M Cosnard, Y Robert & D Trystram (eds), Parallel Processing: CONPAR 1992 ─ VAPP V - 2nd Joint International Conference on Vector and Parallel Processing, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 634 LNCS, Springer Verlag, pp. 479-484, 2nd Joint International Conference on Vector and Parallel Processing, CONPAR 1992, Lyon, France, 1/09/92. https://doi.org/10.1007/3-540-55895-0_445

Envelopes in adaptive local queues for MIMD load balancing. / Shteiman, Konstantin; Feitelson, Dror; Rudolph, Larry et al.
Parallel Processing: CONPAR 1992 ─ VAPP V - 2nd Joint International Conference on Vector and Parallel Processing, Proceedings. ed. / Luc Bouge; Michel Cosnard; Yves Robert; Denis Trystram. Springer Verlag, 1992. p. 479-484 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 634 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Envelopes in adaptive local queues for MIMD load balancing

AU - Shteiman, Konstantin

AU - Feitelson, Dror

AU - Rudolph, Larry

AU - Exman, Iaakov

N1 - Publisher Copyright: © Springer-Verlag Berlin Heidelberg 1992.

PY - 1992

Y1 - 1992

N2 - 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 puDs 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.

AB - 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 puDs 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.

KW - Envelopes

KW - Granularity

KW - Load balancing

KW - MIMD

KW - Run-time systems

KW - Shared memory

UR - http://www.scopus.com/inward/record.url?scp=85029765222&partnerID=8YFLogxK

U2 - 10.1007/3-540-55895-0_445

DO - 10.1007/3-540-55895-0_445

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:85029765222

SN - 9783540558958

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 479

EP - 484

BT - Parallel Processing

A2 - Bouge, Luc

A2 - Cosnard, Michel

A2 - Robert, Yves

A2 - Trystram, Denis

PB - Springer Verlag

T2 - 2nd Joint International Conference on Vector and Parallel Processing, CONPAR 1992

Y2 - 1 September 1992 through 4 September 1992

ER -

Shteiman K, Feitelson D, Rudolph L, Exman I. Envelopes in adaptive local queues for MIMD load balancing. In Bouge L, Cosnard M, Robert Y, Trystram D, editors, Parallel Processing: CONPAR 1992 ─ VAPP V - 2nd Joint International Conference on Vector and Parallel Processing, Proceedings. Springer Verlag. 1992. p. 479-484. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/3-540-55895-0_445

Envelopes in adaptive local queues for MIMD load balancing

Abstract

Publication series

Conference

Bibliographical note

Keywords

Access to Document

Other files and links

Fingerprint

Cite this