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 proceedingConference 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 languageEnglish
Title of host publication6th Distributed Memory Computing Conference, DMCC 1991 - Proceedings
EditorsQuentin Stout, Michael Wolfe
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages233-237
Number of pages5
ISBN (Electronic)0818622903, 9780818622908
DOIs
Publication statusPublished - 1991
Externally publishedYes
Event6th Distributed Memory Computing Conference, DMCC 1991 - Portland, United States
Duration: Apr 28 1991May 1 1991

Publication series

Name6th Distributed Memory Computing Conference, DMCC 1991 - Proceedings

Conference

Conference6th Distributed Memory Computing Conference, DMCC 1991
Country/TerritoryUnited States
CityPortland
Period4/28/915/1/91

ASJC Scopus subject areas

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

Fingerprint

Dive into the research topics of 'Using spanning-trees for balancing dynamic load on multiprocessors'. Together they form a unique fingerprint.

Cite this