𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An Improved Load Balancing Algorithm of Multi-TPM

✍ Scribed by Fng Juan; Zeng Hongli; Mao Junjie; Chen Du

Book ID
119354196
Publisher
Elsevier
Year
2011
Tongue
English
Weight
372 KB
Volume
15
Category
Article
ISSN
1877-7058

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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

V_THR: An Adaptive Load Balancing Algori
V_THR: An Adaptive Load Balancing Algorithm
✍ Pallab Dasgupta; A.K. Majumder; P. Bhattacharya πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 173 KB

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

Load balancing by graph coloring, an alg
Load balancing by graph coloring, an algorithm
✍ R. Jeurissen; W. Layton πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 560 KB

Motivated by an application to load balancing in data-parallel finite element methods, we consider the following coloring question. Color an arbitrary, edge-to-edge triangulation T of a planar domain with two colors so that the largest connected group of same color triangles is as small as possible.

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