Load Balancing in Parallel Computers: Theory and Practice

Front Cover
Springer, Aug 26, 2007 - Computers - 210 pages
Load Balancing in Parallel Computers: Theory and Practice is about the essential software technique of load balancing in distributed memory message-passing parallel computers, also called multicomputers. Each processor has its own address space and has to communicate with other processors by message passing. In general, a direct, point-to-point interconnection network is used for the communications. Many commercial parallel computers are of this class, including the Intel Paragon, the Thinking Machine CM-5, and the IBM SP2.
Load Balancing in Parallel Computers: Theory and Practice presents a comprehensive treatment of the subject using rigorous mathematical analyses and practical implementations. The focus is on nearest-neighbor load balancing methods in which every processor at every step is restricted to balancing its workload with its direct neighbours only. Nearest-neighbor methods are iterative in nature because a global balanced state can be reached through processors' successive local operations. Since nearest-neighbor methods have a relatively relaxed requirement for the spread of local load information across the system, they are flexible in terms of allowing one to control the balancing quality, effective for preserving communication locality, and can be easily scaled in parallel computers with a direct communication network.
Load Balancing in Parallel Computers: Theory and Practice serves as an excellent reference source and may be used as a text for advanced courses on the subject.
 

What people are saying - Write a review

We haven't found any reviews in the usual places.

Contents

INTRODUCTION
1
A SURVEY OF NEARESTNEIGHBOR LOAD BALANCING
21
GDE ON TORIAND MESHES
53
THE DIFFUSION METHOD
79
TERMINATION DETECTION OF LOAD BALANCING
121
REMAPPING WITH THE GDE METHOD
136
CONCLUSIONS
178
References
187
13
188
Copyright

Other editions - View all

Common terms and phrases

Popular passages

Page 198 - A survey of wormhole routing techniques in direct networks,
Page 196 - FCH Lin and RM Keller. The Gradient Model Load Balancing Method.
Page 200 - AB Sinha and LV Kale. A load balancing strategy for prioritized execution of tasks.
Page 188 - JE Boillat. Load balancing and Poisson equation in a graph. Concurrency: Practice and Experience 2 (4) (1990) 289-311.
Page 198 - Saltz. Dynamic Remapping of Parallel Computations with Varying Resource Demands.
Page 189 - A Communicating Finite Automata Approach to Modeling Distributed Computation and its Application to Distributed Decision-Making," IEEE Transactions on Computers, May, 1990, pp.
Page 195 - RE Kessler and JL Schwarzmeier, "CRAY T3D: A New Dimension for Cray Research,
Page 188 - ... our tools, given more time. For example, SOS produced a variety of architectures for 2D-DCT that can be used to meet different design requirements. Our estimation tools, which were not used, will provide valuable information early for our tools when used in actual design situations. References [1] SH Bokhari. Assignment Problems in Parallel and Distributed Computing. Kluwer Academic Publishers, 1987. [2] CF Chang and BJ Sheu. A Multi-Chip Module Design for Portable Video Compression Systems....

Bibliographic information