In the next section we present basic definitions and notations where the criterion of optimality is defined and related to the concept of ''normal'' algorithms. In Section 3 we present an optimal embedding method that balances the processor loads. In Section 4 we present a nonoptimal embedding metho
Synchronous Load Balancing in Hypercube Multicomputers with Faulty Nodes
โ Scribed by Kyungwan Nam; Jaewon Seo; Sunggu Lee; Jong Kim
- Publisher
- Elsevier Science
- Year
- 1999
- Tongue
- English
- Weight
- 275 KB
- Volume
- 58
- Category
- Article
- ISSN
- 0743-7315
No coin nor oath required. For personal study only.
โฆ Synopsis
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 is required. To accomplish this, we present an algorithm for constructing a new logical topology from a hypercube topology with faulty nodes. This new topology is used to obtain the global load information and to perform task migration. Simulation results are used to evaluate the performance of our dynamic load balancing method when compared with previous methods.
๐ SIMILAR VOLUMES