A Comparative Evaluation of Implicit Coscheduling Strategies for Networks of Workstations

Authors:
Cosimo Anglano
Affiliations:
-
Venue:
HPDC '00 Proceedings of the 9th IEEE International Symposium on High Performance Distributed Computing
Year:
2000

Citing 0
Cited 18

Modeling and analysis of dynamic coscheduling in parallel and distributed environments

SIGMETRICS '02 Proceedings of the 2002 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Fair Scheduling of General-Purpose Workloads on Workstation Clusters

Cluster Computing
Coscheduling in Clusters: Is It a Viable Alternative?

Proceedings of the 2004 ACM/IEEE conference on Supercomputing
PROC: Process ReOrdering-Based Coscheduling on Workstation Clusters

IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
Adaptive Parallel Job Scheduling with Flexible Coscheduling

IEEE Transactions on Parallel and Distributed Systems
Performance Comparison of Coscheduling Algorithms for Non-Dedicated Clusters Through a Generic Framework

International Journal of High Performance Computing Applications
A runtime resolution scheme for priority boost conflict in implicit coscheduling

The Journal of Supercomputing
A comprehensive performance and energy consumption analysis of scheduling alternatives in clusters

The Journal of Supercomputing
The Performance of a Parallel TSP Program and Byte Sequential Benchmarks Executing on a Shared Cluster

International Journal of High Performance Computing Applications
A study of the concurrent execution of parallel and sequential applications on a non-dedicated cluster

Parallel Computing
Cooperating coscheduling: a coscheduling proposal aimed at non-dedicated heterongeneous NOWs

Journal of Computer Science and Technology
A scalable multithreaded L7-filter design for multi-core servers

Proceedings of the 4th ACM/IEEE Symposium on Architectures for Networking and Communications Systems
Load balancing based concurrent execution of NAS parallel benchmarks with BYTE sequential benchmarks on a non-dedicated cluster

International Journal of High Performance Computing and Networking
Parallel computing on clusters and enterprise grids: practice and experience

International Journal of High Performance Computing and Networking
Execution environments and benchmarks for the study of applications’ scheduling on clusters

ICA3PP'05 Proceedings of the 6th international conference on Algorithms and Architectures for Parallel Processing
Scheduling of a parallel computation-bound application and sequential applications executing concurrently on a cluster: a case study

ISPA'04 Proceedings of the Second international conference on Parallel and Distributed Processing and Applications
CISNE: a new integral approach for scheduling parallel applications on non-dedicated clusters

Euro-Par'05 Proceedings of the 11th international Euro-Par conference on Parallel Processing
Concurrent execution of multiple NAS parallel programs on a cluster

ICCS'05 Proceedings of the 5th international conference on Computational Science - Volume Part I

Quantified Score

Hi-index	0.00

Visualization

Abstract

Implicit coscheduling strategies enable parallel applications to dynamically share the machines in a Network of Workstation (NOW) with interactive, CPU and IO-bound sequential jobs. In this paper we present a simulation study that compares 12 coscheduling strategies in terms of their impact on the performance of parallel and sequential applications executed simultaneously on a NOW. Our results show that the coscheduling strategy has a strong impact on the performance of the applications (both parallel and sequential) composing the workload, and that no single strategy is able to effectively handle all workloads. In spite of that, our results can be used to identify the strategy that represents the best choice for a given application class, or the best compromise for various workloads. Moreover, we show that in many cases simple strategies outperform ones that are more complex.