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

Usefulness of adaptive load sharing for parallel processing on networks of workstations

โœ Scribed by Clarke, Sheldon; Dandamudi, Sivarama P.


Publisher
John Wiley and Sons
Year
1999
Tongue
English
Weight
128 KB
Volume
11
Category
Article
ISSN
1040-3108

No coin nor oath required. For personal study only.

โœฆ Synopsis


Networks of workstations (NOWs) can be used for parallel processing by using public domain software like PVM. However, NOW-based parallel processing suffers from node heterogeneity, background load variations, and high-latency, low-bandwidth communication network. Previous studies on load sharing in NOW-based systems have indicated that, for applications using the work-pile model, a simple load sharing scheme in which the master process gives a fixed amount of work to the slave processes performs as well as any other, more complex schemes. In this paper, we propose a new adaptive load sharing scheme and evaluate its performance using a Pentium-based NOW machine. The communication network used in the system consists of the standard 10 Mbps Ethernet and the 100 Mbps fast Ethernet. We use both these networks to study their impact on the performance of our new policy. The results presented here indicate that the new policy is useful for computation-intensive applications.


๐Ÿ“œ SIMILAR VOLUMES


Coordinating Parallel Processes on Netwo
โœ Xing Du; Xiaodong Zhang ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 355 KB

The network of workstations (NOW) we consider for scheduling is heterogeneous and nondedicated, where computing power varies among the workstations and local and parallel jobs may interact with each other in execution. An effective NOW scheduling scheme needs sufficient information about system hete

Implementation of Decentralized Load Sha
โœ Chao-Ju Hou; Kang G. Shin ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 432 KB

In recent years a number of load sharing (LS) mechanisms have been proposed or implemented to fully utilize system resources. We have designed and implemented a decentralized real-time LS mechanism based on the Condor package [1, 2]. Two important features of our design are the use of regionchange b

Stardust: An Environment for Parallel Pr
โœ Gilbert Cabillic; Isabelle Puaut ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 328 KB

This paper describes Stardust, an environment for parallel programming on networks of heterogeneous machines. Stardust runs on distributed memory multicomputers and networks of workstations. Applications using Stardust can communicate both through message-passing and through distributed shared memor

Guidelines for Data-Parallel Cycle-Steal
โœ Arnold L. Rosenberg ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 192 KB

We derive computationally efficient guidelines for nearly optimal scheduling of data-parallel computations within a draconian mode of cycle-stealing in networks of workstations (nows). In this computing regimen, workstation A takes control of workstation B 's processor whenever it is idle, with the