A Slowdown Model for Applications Executing on Time-Shared Clusters of Workstations

Authors:
Silvia M. Figueira;Francine Berman
Affiliations:
-;-
Venue:
IEEE Transactions on Parallel and Distributed Systems
Year:
2001

Citing 15
Cited 9

PVM: a framework for parallel distributed computing

Concurrency: Practice and Experience
Graphical development tools for network-based concurrent supercomputing

Proceedings of the 1991 ACM/IEEE conference on Supercomputing
Distributed computing feasibility in a non-dedicated homogeneous distributed system

Proceedings of the 1993 ACM/IEEE conference on Supercomputing
Effective distributed scheduling of parallel workloads

Proceedings of the 1996 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Modeling the effects of contention on application performance in multi-user environments

Modeling the effects of contention on application performance in multi-user environments
Coordinating parallel processes on networks of workstations

Journal of Parallel and Distributed Computing
The network weather service: a distributed resource performance forecasting service for metacomputing

Future Generation Computer Systems - Special issue on metacomputing
A multigrid tutorial: second edition

A multigrid tutorial: second edition
Application-level scheduling on distributed heterogeneous networks

Supercomputing '96 Proceedings of the 1996 ACM/IEEE conference on Supercomputing
Dynamically forecasting network performance using the Network Weather Service

Cluster Computing
Scheduling Problems and Traveling Salesmen: The Genetic Edge Recombination Operator

Proceedings of the 3rd International Conference on Genetic Algorithms
Guidelines for Data-Parallel Cycle-Stealing in Networks of Workstations, II: On Maximizing Guaranteed Output

IPPS '99/SPDP '99 Proceedings of the 13th International Symposium on Parallel Processing and the 10th Symposium on Parallel and Distributed Processing
Flexible Communication Mechanisms for Dynamic Structured Applications

IRREGULAR '96 Proceedings of the Third International Workshop on Parallel Algorithms for Irregularly Structured Problems
Dynamic Coscheduling on Workstation Clusters

IPPS/SPDP '98 Proceedings of the Workshop on Job Scheduling Strategies for Parallel Processing
Modeling the Effects of Contention on the Performance of Heterogeneous Applications

HPDC '96 Proceedings of the 5th IEEE International Symposium on High Performance Distributed Computing

Genetic Algorithm Based Scheduling of Meta-Tasks with Stochastic Execution Times in Heterogeneous Computing Systemst1

Cluster Computing
Toward an analytical solution to task allocation, processor assignment, and performance evaluation of network processors

Journal of Parallel and Distributed Computing
High-performance message striping over reliable transport protocols

The Journal of Supercomputing
LOMARC: Lookahead Matchmaking for Multiresource Coscheduling on Hyperthreaded CPUs

IEEE Transactions on Parallel and Distributed Systems
Speedup and scalability analysis of Master--Slave applications on large heterogeneous clusters

Journal of Parallel and Distributed Computing
A heterogeneity-aware approach to load balancing of computational tasks: a theoretical and simulation study

Cluster Computing
Comparative analysis of the prototype and the simulator of a new load balancing algorithm for heterogeneous computing environments

International Journal of High Performance Computing and Networking
Self-configured multiple-network-interface socket

Journal of Network and Computer Applications
LOMARC — lookahead matchmaking for multi-resource coscheduling

JSSPP'04 Proceedings of the 10th international conference on Job Scheduling Strategies for Parallel Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Distributed applications executing on clustered environments typically share resources (computers and network links) with other applications. In such systems, application execution may be retarded by the competition for these shared resources. In this paper, we define a model that calculates the slowdown imposed on applications in time-shared multi-user clusters. Our model focuses on three kinds of slowdown: local slowdown, which synthesizes the effect of contention for CPU in a single workstation; communication slowdown, which synthesizes the effect of contention for the workstations and network links on communication costs; and aggregate slowdown, which determines the effect of contention on a parallel task caused by other applications executing on the entire cluster, i.e., on the nodes used by the parallel application. We verify empirically that this model provides an accurate estimate of application performance for a set of compute-intensive parallel applications on different clusters with a variety of emulated loads.