✦ LIBER ✦

Parallel Application Scheduling on Networks of Workstations

✍ Scribed by Stergios V. Anastasiadis; Kenneth C. Sevcik

Publisher: Elsevier Science
Year: 1997
Tongue: English
Weight: 538 KB
Volume: 43
Category: Article
ISSN: 0743-7315
DOI: 10.1006/jpdc.1997.1335

No coin nor oath required. For personal study only.

✦ Synopsis

Parallel applications can be executed using the idle computing capacity of workstation clusters. However, it remains unclear how to schedule the processors among different applications most effectively. Processor scheduling algorithms that were successful for shared-memory machines have proven to be inadequate for distributed memory environments due to the high costs of remote memory accesses and redistributing data. We investigate how knowledge of system load and application characteristics can be used in scheduling decisions. We propose a new algorithm based on adaptive equipartitioning, which, by properly exploiting both the information types above, performs better than other nonpreemptive scheduling rules, and nearly as well as idealized versions of preemptive rules (with free preemption). We conclude that the new algorithm is suitable for use in scheduling parallel applications on networks of workstations.

📜 SIMILAR VOLUMES

Coordinating Parallel Processes on Netwo

Coordinating Parallel Processes on Networks of Workstations

✍ 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

Parallel Labeling of Three-Dimensional C

Parallel Labeling of Three-Dimensional Clusters on Networks of Workstations

✍ Felipe Knop; Vernon Rego 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 323 KB

Cluster algorithms have application in diverse areas, including statistical mechanics of polymer solutions, spin models in physics, and the study of ecological systems. Most parallel cluster labeling algorithms are designed for SIMD and MIMD multiprocessors and based on relaxation methods. We presen

Data-parallel programming on a network o

Data-parallel programming on a network of heterogeneous workstations

✍ Nedeljkovlc, Nenad ;Quinn, Michael J. 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 781 KB

Parallel structural optimization on a ne

Parallel structural optimization on a network of computer workstations

✍ Efthimios S. Sikiotis; Victor E. Saouma 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 1019 KB

Stardust: An Environment for Parallel Pr

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

✍ 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

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