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

An algorithm for load balancing in multiprocessor systems

โœ Scribed by Michael C. Loui; Milind A. Sohoni


Publisher
Elsevier Science
Year
1990
Tongue
English
Weight
542 KB
Volume
35
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


An Analytical Model for Load Balancing o
โœ 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

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

V_THR: An Adaptive Load Balancing Algori
โœ 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 for redundant storage str
โœ Joep Aerts; Jan Korst; Wim Verhaegh ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Springer US ๐ŸŒ English โš– 132 KB

An important cost issue in multimedia servers is disk load balancing, such that the available hard disks are used as e ciently as possible. Disk load balancing is often done on a block basis, but can also be done on a time basis, by taking into account the actual transfer times of the blocks. In the