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
Limitations of Cycle Stealing for Parallel Processing on a Network of Homogeneous Workstations
โ Scribed by Scott T. Leutenegger; Xian-He Sun
- Publisher
- Elsevier Science
- Year
- 1997
- Tongue
- English
- Weight
- 274 KB
- Volume
- 43
- Category
- Article
- ISSN
- 0743-7315
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
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
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
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
The author does not know if it can be patched.
## Abstract A managerโworkerโbased parallelization algorithm for Quantum Monte Carlo (QMCโMW) is presented and compared with the pure iterative parallelization algorithm, which is in common use. The new managerโworker algorithm performs automatic load balancing, allowing it to perform near the theo