𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An asynchronous and iterative load balancing algorithm for discrete load model

✍ Scribed by A. Cortés; A. Ripoll; F. Cedó; M.A. Senar; E. Luque

Publisher
Elsevier Science
Year
2002
Tongue
English
Weight
455 KB
Volume
62
Category
Article
ISSN
0743-7315

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An optimal migration algorithm for dynam
An optimal migration algorithm for dynamic load balancing
✍ HU, Y. F.; BLAKE, R. J.; EMERSON, D. R. 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 207 KB 👁 2 views

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 dyna
An improved diffusion algorithm for dynamic load balancing
✍ Y.F. Hu; R.J. Blake 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 231 KB

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

An efficient load balancing strategy for
An efficient load balancing strategy for grid-based branch and bound algorithm
✍ M. Mezmaz; N. Melab; E.-G. Talbi 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 286 KB

The most popular parallelization approach of the branch and bound algorithm consists in building and exploring in parallel the search tree representing the problem being tackled. The deployment of such parallel model on a grid rises the crucial issue of dynamic load balancing. The major question is

An Analytical Model for Load Balancing o
An Analytical Model for Load Balancing on Symmetrical Multiprocessor Systems
✍ X.S. Qian; Q. Yang 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 906 KB

In a distributed computing system, it is desirable to balance the work load among processors while keeping the communication overhead at a minimum. The nearest neighbor balancing strategy requires little communication overhead compared to the sophisticated dynamic load balancing policies. The questi