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 nei
Accelerated diffusion algorithms for dynamic load balancing
โ Scribed by Gregory Karagiorgos; Nikolaos M. Missirlis
- Publisher
- Elsevier Science
- Year
- 2002
- Tongue
- English
- Weight
- 87 KB
- Volume
- 84
- Category
- Article
- ISSN
- 0020-0190
No coin nor oath required. For personal study only.
โฆ Synopsis
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 diffusion method for various types of network graphs.
๐ SIMILAR VOLUMES
Algorithms to enhance parallel performance of molecular dynamics simulations on parallel computers by dynamic load balancing are described. Load balancing is achieved by redistribution of work based on either a history of time spent computing per processor or on the number of pair interactions compu
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
Recently, switch-based networks of workstations (NOWs) have been introduced as an alternative for traditional parallel computers. Although many dynamic load balancing algorithms have been developed for point-to-point networks (static networks), little progress has been made on the load balancing in