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

Stardust: An Environment for Parallel Programming on Networks of Heterogeneous Workstations

โœ Scribed by Gilbert Cabillic; Isabelle Puaut

Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
328 KB
Volume
40
Category
Article
ISSN
0743-7315

No coin nor oath required. For personal study only.

โœฆ Synopsis

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 memory. Stardust includes a mechanism for application reconfiguration. This mechanism is used to balance the load of the machines hosting the application, as well as for tolerating machine restarts (anticipated or not). At reconfiguration time, application processes can migrate between heterogeneous machines and the number of application processes can vary (increase or decrease) depending on the available resources. Stardust is currently implemented on a heterogeneous system including an Intel Paragon running Mach/OSF1 and a set of Pentiums running Chorus/classiX. The paper details the design and implementation of Stardust, as well as its performance.

๐Ÿ“œ SIMILAR VOLUMES

On Multicast Algorithms for Heterogeneou
On Multicast Algorithms for Heterogeneous Networks of Workstations
โœ R. Libeskind-Hadas; J.R.K. Hartline; P. Boothe; G. Rae; J. Swisher ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 197 KB

Networks of workstations (NOWs) provide an economical platform for high performance parallel computing. Such networks may comprise a variety of different types of workstations and network devices. This paper addresses the problem of efficient multicast in a heterogeneous communication model. Althoug

Usefulness of adaptive load sharing for
Usefulness of adaptive load sharing for parallel processing on networks of workstations
โœ Clarke, Sheldon; Dandamudi, Sivarama P. ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 128 KB

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

Guidelines for Data-Parallel Cycle-Steal
Guidelines for Data-Parallel Cycle-Stealing in Networks of Workstations: I. On Maximizing Expected Output
โœ 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

Managerโ€“worker-based model for the paral
Managerโ€“worker-based model for the parallelization of quantum Monte Carlo on heterogeneous and homogeneous networks
โœ Michael T. Feldmann; Julian C. Cummings; David R. Kent IV; Richard P. Muller; Wi ๐Ÿ“‚ Article ๐Ÿ“… 2007 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 143 KB ๐Ÿ‘ 1 views

## 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