Using spanning-trees for balancing dynamic load on multiprocessors

Rami G. Melhem; Kirk R. Pruhs; Taieb F. Znati

doi:10.1109/DMCC.1991.633134

Using spanning-trees for balancing dynamic load on multiprocessors

Rami G. Melhem, Kirk R. Pruhs, Taieb F. Znati

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

1 Citation (Scopus)

Abstract

We consider the problem of load balancing to minimize the cost of dynamic computations, including the cost of migrations. We analyze the costs associated with diffusion based algorithms for several common architectures. We introduce the Ripple load balancing paradigm, which has several advantages over diffusion methods, including flexibility and faster convergence.

Original language	English
Title of host publication	6th Distributed Memory Computing Conference, DMCC 1991 - Proceedings
Editors	Quentin Stout, Michael Wolfe
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	233-237
Number of pages	5
ISBN (Electronic)	0818622903, 9780818622908
DOIs	https://doi.org/10.1109/DMCC.1991.633134
Publication status	Published - 1991
Externally published	Yes
Event	6th Distributed Memory Computing Conference, DMCC 1991 - Portland, United States Duration: Apr 28 1991 → May 1 1991

Publication series

Name	6th Distributed Memory Computing Conference, DMCC 1991 - Proceedings

Conference

Conference	6th Distributed Memory Computing Conference, DMCC 1991
Country/Territory	United States
City	Portland
Period	4/28/91 → 5/1/91

ASJC Scopus subject areas

Computer Networks and Communications
Hardware and Architecture
Software
Information Systems and Management

Access to Document

10.1109/DMCC.1991.633134

Cite this

Melhem, R. G., Pruhs, K. R., & Znati, T. F. (1991). Using spanning-trees for balancing dynamic load on multiprocessors. In Q. Stout, & M. Wolfe (Eds.), 6th Distributed Memory Computing Conference, DMCC 1991 - Proceedings (pp. 233-237). [633134] (6th Distributed Memory Computing Conference, DMCC 1991 - Proceedings). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/DMCC.1991.633134

Using spanning-trees for balancing dynamic load on multiprocessors. / Melhem, Rami G.; Pruhs, Kirk R.; Znati, Taieb F.

6th Distributed Memory Computing Conference, DMCC 1991 - Proceedings. ed. / Quentin Stout; Michael Wolfe. Institute of Electrical and Electronics Engineers Inc., 1991. p. 233-237 633134 (6th Distributed Memory Computing Conference, DMCC 1991 - Proceedings).

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

Melhem, RG, Pruhs, KR & Znati, TF 1991, Using spanning-trees for balancing dynamic load on multiprocessors. in Q Stout & M Wolfe (eds), 6th Distributed Memory Computing Conference, DMCC 1991 - Proceedings., 633134, 6th Distributed Memory Computing Conference, DMCC 1991 - Proceedings, Institute of Electrical and Electronics Engineers Inc., pp. 233-237, 6th Distributed Memory Computing Conference, DMCC 1991, Portland, United States, 4/28/91. https://doi.org/10.1109/DMCC.1991.633134

Melhem RG, Pruhs KR, Znati TF. Using spanning-trees for balancing dynamic load on multiprocessors. In Stout Q, Wolfe M, editors, 6th Distributed Memory Computing Conference, DMCC 1991 - Proceedings. Institute of Electrical and Electronics Engineers Inc. 1991. p. 233-237. 633134. (6th Distributed Memory Computing Conference, DMCC 1991 - Proceedings). doi: 10.1109/DMCC.1991.633134

Melhem, Rami G. ; Pruhs, Kirk R. ; Znati, Taieb F. / Using spanning-trees for balancing dynamic load on multiprocessors. 6th Distributed Memory Computing Conference, DMCC 1991 - Proceedings. editor / Quentin Stout ; Michael Wolfe. Institute of Electrical and Electronics Engineers Inc., 1991. pp. 233-237 (6th Distributed Memory Computing Conference, DMCC 1991 - Proceedings).

@inproceedings{ee9b16cd50a54e469833c2f01dad31a3,

title = "Using spanning-trees for balancing dynamic load on multiprocessors",

abstract = "We consider the problem of load balancing to minimize the cost of dynamic computations, including the cost of migrations. We analyze the costs associated with diffusion based algorithms for several common architectures. We introduce the Ripple load balancing paradigm, which has several advantages over diffusion methods, including flexibility and faster convergence.",

author = "Melhem, {Rami G.} and Pruhs, {Kirk R.} and Znati, {Taieb F.}",

note = "Publisher Copyright: {\textcopyright} 1991 IEEE.; 6th Distributed Memory Computing Conference, DMCC 1991 ; Conference date: 28-04-1991 Through 01-05-1991",

year = "1991",

doi = "10.1109/DMCC.1991.633134",

language = "English",

series = "6th Distributed Memory Computing Conference, DMCC 1991 - Proceedings",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

pages = "233--237",

editor = "Quentin Stout and Michael Wolfe",

booktitle = "6th Distributed Memory Computing Conference, DMCC 1991 - Proceedings",

}

TY - GEN

T1 - Using spanning-trees for balancing dynamic load on multiprocessors

AU - Melhem, Rami G.

AU - Pruhs, Kirk R.

AU - Znati, Taieb F.

PY - 1991

Y1 - 1991

N2 - We consider the problem of load balancing to minimize the cost of dynamic computations, including the cost of migrations. We analyze the costs associated with diffusion based algorithms for several common architectures. We introduce the Ripple load balancing paradigm, which has several advantages over diffusion methods, including flexibility and faster convergence.

AB - We consider the problem of load balancing to minimize the cost of dynamic computations, including the cost of migrations. We analyze the costs associated with diffusion based algorithms for several common architectures. We introduce the Ripple load balancing paradigm, which has several advantages over diffusion methods, including flexibility and faster convergence.

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

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

U2 - 10.1109/DMCC.1991.633134

DO - 10.1109/DMCC.1991.633134

M3 - Conference contribution

AN - SCOPUS:27144556244

T3 - 6th Distributed Memory Computing Conference, DMCC 1991 - Proceedings

SP - 233

EP - 237

BT - 6th Distributed Memory Computing Conference, DMCC 1991 - Proceedings

A2 - Stout, Quentin

A2 - Wolfe, Michael

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 6th Distributed Memory Computing Conference, DMCC 1991

Y2 - 28 April 1991 through 1 May 1991

ER -

Using spanning-trees for balancing dynamic load on multiprocessors

Abstract

Publication series

Conference

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this