The problem of redistributing the work load on parallel computers is considered. An optimal redistribution algorithm, which minimises the Euclidean norm of the migrating load, is derived. The relationship between this algorithm and some existing algorithms is discussed and the convergence of the new
An improved diffusion algorithm for dynamic load balancing
β Scribed by Y.F. Hu; R.J. Blake
- Publisher
- Elsevier Science
- Year
- 1999
- Tongue
- English
- Weight
- 231 KB
- Volume
- 25
- Category
- Article
- ISSN
- 0167-8191
No coin nor oath required. For personal study only.
β¦ Synopsis
Diusion type algorithms [1,3,11] are some of the most popular algorithms for scheduling in dynamic load balancing. It is known however that this type of algorithm can suer from slow convergence. In this paper the performance of the diusion type algorithms is improved, while retaining the nearest neighbour communication requirement, through the use of Chebyshev polynomials. It is also proved that both the diusion algorithm and the improved diusion algorithm have an optimal property in terms of the amount of load migrated. Numerical results are given comparing the algorithm with the diusion algorithm as well as a fast algorithm that requires global communication.
π SIMILAR VOLUMES
In this paper we consider the application of accelerated techniques in order to increase the rate of convergence of the diffusive iterative load balancing algorithms. In particular, we compare the application of Semi-Iterative, Second Degree and Variable Extrapolation techniques on the basic diffusi
This paper presents a new adaptive algorithm for dynamic load balancing on a shared BUS architecture. We present results obtained from simulation studies and queuing analysis, which reflect the relation between the BUS contention and the efficiency of load balancing. The proposed algorithm uses a sc