Abstract
The problem of modeling load balancing is considered in a variety of distributed settings. A new direction in diffusive schedules was introduced by considering schedules that are modeled as: w1 = Mw0; wt+1 = βMwt+(1-β)wt-1 for some appropriate β, called the second order schedules. In the idealized setting of weights being real numbers, results indicate that β can be chosen because the second order schedule is significantly faster than the first order method. Consequently, an algorithm that performs coarse load balancing rapidly and can be used in a number of applications is produced.
Original language | English (US) |
---|---|
Pages | 72-81 |
Number of pages | 10 |
State | Published - 1996 |
Event | Proceedings of the 1996 8th Annual ACM Symposium on Parallel Algorithms and Architectures - Padua, Italy Duration: Jun 24 1996 → Jun 26 1996 |
Other
Other | Proceedings of the 1996 8th Annual ACM Symposium on Parallel Algorithms and Architectures |
---|---|
City | Padua, Italy |
Period | 6/24/96 → 6/26/96 |
ASJC Scopus subject areas
- Software
- Safety, Risk, Reliability and Quality