Dilation based bidding schemes for dynamic load balancing on distributed processing systems

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

Research output: Chapter in Book/Report/Conference proceedingConference contribution

6 Citations (Scopus)

Abstract

This paper is concerned with sender-initiated load balancing algorithms for parallel architecture that take into consideration the dilation between the sender and the receiver of the migrated task. The basic scheme proposed in this paper, uses a load contention number that accounts for the dilation among processors. This mechanism is generalized to reflect the specific requirements of different environments. We also describe variations of the basic scheme that aim at reducing the interaction overhead among contending processors.

Original languageEnglish
Title of host publication6th Distributed Memory Computing Conference, DMCC 1991 - Proceedings
EditorsQuentin Stout, Michael Wolfe
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages129-136
Number of pages8
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 'Dilation based bidding schemes for dynamic load balancing on distributed processing systems'. Together they form a unique fingerprint.

Cite this