An effective load balancing policy for geometric-decaying algorithms

Joseph Gil, Yossi Matias

Research output: Contribution to journalArticlepeer-review


Parallel algorithms are often first designed as a sequence of rounds, where each round includes any number of independent constant time operations. This so-called work-time presentation is then followed by a processor scheduling implementation on a more concrete computational model. Many parallel algorithms are geometric-decaying in the sense that the sequence of work loads is upper bounded by a decreasing geometric series. A standard scheduling implementation of such algorithms consists of a repeated application of load balancing. We present a more effective, yet as simple, policy for the utilization of load balancing in geometric-decaying algorithms. By making a more careful choice of when and how often load balancing should be employed, and by using a simple amortization argument, we show that the number of required applications of load balancing should be nearly constant. The policy is not restricted to any particular model of parallel computation, and, up to a constant factor, it is the best possible.

Original languageEnglish
Pages (from-to)185-188
Number of pages4
JournalJournal of Parallel and Distributed Computing
Issue number2
StatePublished - 1 Aug 1996
Externally publishedYes


Dive into the research topics of 'An effective load balancing policy for geometric-decaying algorithms'. Together they form a unique fingerprint.

Cite this