Skip to main content

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

  • 149 Accesses

Abstract

With the diffusion method, each processor would transfer fractions of its workload to some of its neighbors while simultaneously receiving workloads from its other neighbors at each iteration step. In this chapter, we analyze the convergence and the efficiency properties of the diffusive load balancing process. The focus is on the design of efficient diffusion algorithms in the higher-dimensional tori and meshes including their special cases, the ring, the chain, and the k-ary n-cube.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
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

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Kluwer Academic Publishers

About this chapter

Cite this chapter

(1997). The Diffusion Method. In: Load Balancing in Parallel Computers. The Springer International Series in Engineering and Computer Science, vol 381. Springer, Boston, MA. https://doi.org/10.1007/978-0-585-27256-6_5

Download citation

  • DOI: https://doi.org/10.1007/978-0-585-27256-6_5

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-0-7923-9819-6

  • Online ISBN: 978-0-585-27256-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics