Balancing load versus decreasing communication: Exploring the tyadeoffs

Valerie E. Taylor, Bruce K. Holmes, Eric J. Schwabe, Michelle R. Hribar

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

3 Scopus citations


In this paper, we propose a domain decomposition scheme that seeks to minimize total parallel execution time by considering the relative importance of two competing concerns — balancing the load and minimizing communication —for a particular application and architecture. A simulated annealing approach is used to optimize an objective function with components that measure both load balance and communication requirements. We develop an analytical model of execution time based upon afinite element code executed on the Intel Paragon. This model is used to compare partitions with varying degrees of load imbalance. Most literature in the area of decomposition methods heavily emphasizes load balancing over the minimization of communication. Our results indicate that this restrictive approach to load balancing can be relaxed without performance degradation. Further, our results indicate that the degree of relaxation possible is dependent upon the target machine and the application; neither one can be neglected.

Original languageEnglish (US)
Title of host publicationArchitecture and Software Technology
PublisherIEEE Computer Society
Number of pages9
ISBN (Electronic)0818673249
StatePublished - 1996
Externally publishedYes
Event29th Hawaii International Conference on System Sciences, HICSS 1996 - Wailea, United States
Duration: Jan 3 1996Jan 6 1996

Publication series

NameProceedings of the Annual Hawaii International Conference on System Sciences
ISSN (Print)1530-1605


Conference29th Hawaii International Conference on System Sciences, HICSS 1996
Country/TerritoryUnited States

ASJC Scopus subject areas

  • Engineering(all)


Dive into the research topics of 'Balancing load versus decreasing communication: Exploring the tyadeoffs'. Together they form a unique fingerprint.

Cite this