Branch and bound based load balancing for parallel applications

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

Abstract

Many parallel applications are highly dynamic in nature. In some, computation and communication patterns change gradually during the run; in others those characteristics change abruptly. Such dynamic applications require an adaptive load balancing strategy. We are exploring an adaptive approach based on multi-partition object-based decomposition, supported by object migration. For many applications, relatively infrequent load balancing is needed. In these cases it becomes economical to spend considerable computation time toward arriving at a nearly optimal mapping of objects to processors. We present an optimal- seeking branch and bound based strategy that finds nearly optimal solutions to such load balancing problems quickly, and can continuously improve such solutions as time permits.

Original languageEnglish (US)
Title of host publicationComputing in Object-Oriented Parallel Environments - 3rd International Symposium, ISCOPE 1999, Proceedings
EditorsSatoshi Matsuoka, Rodney R. Oldehoeft, Tholburn Marydell
PublisherSpringer-Verlag
Pages194-199
Number of pages6
ISBN (Print)3540668187, 9783540668183
StatePublished - Jan 1 1999
Event3rd International Symposium on Computing in Object-Oriented Parallel Environments, ISCOPE 1999 - San Francisco, United States
Duration: Dec 8 1999Dec 10 1999

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1732
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other3rd International Symposium on Computing in Object-Oriented Parallel Environments, ISCOPE 1999
CountryUnited States
CitySan Francisco
Period12/8/9912/10/99

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Branch and bound based load balancing for parallel applications'. Together they form a unique fingerprint.

  • Cite this

    Radhakrishnan, S., Brunner, R. K., & Kale, L. V. (1999). Branch and bound based load balancing for parallel applications. In S. Matsuoka, R. R. Oldehoeft, & T. Marydell (Eds.), Computing in Object-Oriented Parallel Environments - 3rd International Symposium, ISCOPE 1999, Proceedings (pp. 194-199). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1732). Springer-Verlag.