Skip to main content
SpringerLink
Log in

Load Balancing in Parallel Computers

Theory and Practice

  • Book
  • © 1997

Overview

Authors:
  1. Xu Chengzhong

    1. Wayne State University, USA

    View author publications

    You can also search for this author in PubMed   Google Scholar

  2. Francis C. M. Lau

    1. The University of Hong Kong, China

    View author publications

    You can also search for this author in PubMed   Google Scholar

Part of the book series: The Springer International Series in Engineering and Computer Science (SECS, volume 381)

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 249.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book USD 219.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (10 chapters)

  1. Front Matter

    Pages i-xv
    Download chapter PDF

  2. Introduction

    Pages 1-19

  3. A Survey of Nearest-Neighbor Load Balancing Algorithms

    Pages 21-35

  4. The GDE Method

    Pages 37-51

  5. GDE on Tori and Meshes

    Pages 53-78

  6. The Diffusion Method

    Pages 79-94

  7. GDE Versus Diffusion

    Pages 95-120

  8. Termination Detection of Load Balancing

    Pages 121-135

  9. Remapping With the GDE Method

    Pages 137-159

  10. Load Distribution in Combinatorial Optimizations

    Pages 161-177

  11. Conclusions

    Pages 179-186

  12. Back Matter

    Pages 187-210
    Download chapter PDF
Back to top

Keywords

About this book

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.

Authors and Affiliations

  • Wayne State University, USA

    Xu Chengzhong

  • The University of Hong Kong, China

    Francis C. M. Lau

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation