## Load Balancing in Parallel Computers: Theory and PracticeLoad 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.

### Other editions - View all

Load Balancing in Parallel Computers: Theory and Practice Chenzhong Xu,Francis C.M. Lau Limited preview - 1996 |

Load Balancing in Parallel Computers: Theory and Practice Chenzhong Xu,Francis C.M. Lau No preview available - 1997 |

### Common terms and phrases

ACWN all-port communication model applications balancing domains branch-and-bound algorithms chain Chapter chromatic index circulant matrix color path combinatorial optimization communication steps computational graph convergence factor convergence rate counter value data parallel denote diffusion matrix diffusion method diffusive load balancing dimension exchange method dynamic load balancing edge-coloring efficiency eigenvalues execution Expected number Figure GDE method GDE-based global balanced global termination gossiping grid hypercube initial workload distribution iteration step iteration sweeps k-ary n-cube k-color Lemma load balancing algorithms load balancing operation load balancing procedure load balancing process load distribution loaded processors lower bound number of iterations number of processors number of sweeps ODE algorithm optimal diffusion parameter optimal exchange parameter parallel branch-and-bound parallel computers partitioning performance PPBB problem processor random remapping ring run-time simulated annealing structures subproblem synchronous implementations synchronous load balancing termination delay termination detection Theorem torus transputers unstructured grids vertex vertices Xopt

### 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....