๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

V_THR: An Adaptive Load Balancing Algorithm

โœ Scribed by Pallab Dasgupta; A.K. Majumder; P. Bhattacharya


Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
173 KB
Volume
42
Category
Article
ISSN
0743-7315

No coin nor oath required. For personal study only.

โœฆ Synopsis


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 scheme for monitoring the Threshold parameter to dynamically adapt itself to the limited bandwidth of the shared BUS. We have compared our algorithm with some of the known policies, and the relative performance appears to be promising.


๐Ÿ“œ SIMILAR VOLUMES


An optimal migration algorithm for dynam
โœ 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 Adaptive Load Balancing Method for Pa
โœ Yuefan Deng; Ronald F. Peierls; Carlos Rivera ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 222 KB

We describe an adaptive method for achieving load balance in parallel computations simulating phenomena which are distributed over a spatially extended region, but are local in nature. We have tested the method on standard short-ranged parallel molecular dynamics calculations. The performance gain w

An adaptive load distribution algorithm
โœ Lu, Qin; Lau, Sau-Ming ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 253 KB ๐Ÿ‘ 2 views

Most existing dynamic load distribution (LD) algorithms assume fairly stable task arrival pattern. With this assumption, single task assignments are adequate to provide reasonably good performance. They are, however, inadequate when tasks arrive in bursts. In this paper, we propose a LD algorithm ba