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

Resource augmentation in load balancing

โœ Scribed by Yossi Azar; Leah Epstein; Rob van Stee


Publisher
Springer US
Year
2000
Tongue
English
Weight
92 KB
Volume
3
Category
Article
ISSN
1094-6136

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Fairness in Routing and Load Balancing
โœ Jon Kleinberg; Yuval Rabani; ร‰va Tardos ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 177 KB

We consider the issue of network routing subject to explicit fairness conditions. The optimization of fairness criteria interacts in a complex fashion with the optimization of network utilization and throughput; in this work, we undertake an investigation of this relationship through the framework o

Load balancing in distributed autonomous
โœ Toshihiko Suguri; Hiroyuki Yamashita; Shingo Kinoshita; Yasushi Okada ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 359 KB ๐Ÿ‘ 1 views

There have been many studies of load balancing in computer systems, for which various algorithms have been proposed. The load balancing methods to date can largely be divided into two types. In the first method, the load information is exchanged among the nodes, and the loads of the nodes are balanc

Multiresolution load balancing in curved
โœ Nakano, Aiichiro ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 173 KB

A new load-balancing scheme based on a multiresolution analysis is developed for parallel particle simulations. Workloads are partitioned with a uniform 3-dimensional mesh in an adaptive curvilinear co-ordinate system which is represented by a wavelet basis. Simulated annealing is used to determine

Synchronous Load Balancing in Hypercube
โœ Kyungwan Nam; Jaewon Seo; Sunggu Lee; Jong Kim ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 275 KB

This paper presents a new dynamic load-balancing algorithm for hypercube multicomputers with faulty nodes. The emphasis in our method is on obtaining global load information and performing task migration using ``short paths'' in a synchronous manner so that a minimal amount of communication overhead