TY - GEN
T1 - Using spanning-trees for balancing dynamic load on multiprocessors
AU - Melhem, Rami G.
AU - Pruhs, Kirk R.
AU - Znati, Taieb F.
N1 - Publisher Copyright:
© 1991 IEEE.
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 -