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

An optimal migration algorithm for dynamic load balancing

โœ Scribed by HU, Y. F.; BLAKE, R. J.; EMERSON, D. R.


Publisher
John Wiley and Sons
Year
1998
Tongue
English
Weight
207 KB
Volume
10
Category
Article
ISSN
1040-3108

No coin nor oath required. For personal study only.

โœฆ Synopsis


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 algorithm is studied. Finally, numerical results on randomly generated graphs as well as on graphs related to real meshes are given to demonstrate the effectiveness of the new algorithm.


๐Ÿ“œ SIMILAR VOLUMES


Load balancing algorithm using tape migr
โœ Toshihiro Nemoto; Masaru Kitsuregawa ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 421 KB

In this paper the authors describe a load balancing algorithm and its validity in a scalable tape archiver consisting of a small-scale tape archiver used as a single element and a tape migration device connected to these elements which enables the physical transfer of tapes. With the rapid developme

Optimal dynamic load shedding policy for
โœ Mahdi El Arini ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 116 KB ๐Ÿ‘ 2 views

Modern electrical power systems are highly interconnected and heavily loaded. An emergency may occur as a result of a sudden increase in system load or unexpected partial or total outage of a generator. This paper presents an optimal dynamic load shedding policy for generation load imbalances. The e

An optimal algorithm for layered wheel f
โœ Kulasinghe, Priyalal D.; Bettayeb, Sa๏ฟฝd ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 83 KB ๐Ÿ‘ 2 views

In this paper, we present an efficient algorithm to solve the orientation optimization problem for a layered wheel floorplan. The strategy used is to generate all the nonredundant implementations for the floorplan. The computational complexities of the algorithm depend on the actual dimensions of th

An adaptive load distribution algorithm
โœ Lu, Qin; Lau, Sau-Ming ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 253 KB ๐Ÿ‘ 1 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

A dynamic load balancing method based on
โœ Kenji Nishimura; Hitoshi Ueno; Miki Yamamoto; Hiromasa Ikeda ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 282 KB ๐Ÿ‘ 2 views

The authors propose two dynamic load balancing methods which give consideration to network delays in a large-scale, wide-area distributed system. In general in load balancing, the number of candidate computers for transfers increases as the number of computers being used increases, and so efforts ar