The Impact of Critical Sporadic Jobs on Gang Scheduling Performance in Distributed Systems

Authors:
Helen D. Karatza
Affiliations:
Department of Informatics, Aristotle University of Thessaloniki, 54124 Thessaloniki, Greece
Venue:
Simulation
Year:
2008

Citing 15
Cited 5

Evaluation of design choices for gang scheduling using distributed hierarchical control

Journal of Parallel and Distributed Computing
Stochastic analysis of gang scheduling in parallel and distributed systems

Performance Evaluation
Demand-Based Coscheduling of Parallel Jobs on Multiprogrammed Multiprocessors

IPPS '95 Proceedings of the Workshop on Job Scheduling Strategies for Parallel Processing
Parallel Job Scheduling: Issues and Approaches

IPPS '95 Proceedings of the Workshop on Job Scheduling Strategies for Parallel Processing
Performance Evaluation of Gang Scheduling for Parallel and Distributed Multiprogramming

IPPS '97 Proceedings of the Job Scheduling Strategies for Parallel Processing
Improved Utilization and Responsiveness with Gang Scheduling

IPPS '97 Proceedings of the Job Scheduling Strategies for Parallel Processing
An Integrated Approach to Parallel Scheduling Using Gang-Scheduling, Backfilling, and Migration

IEEE Transactions on Parallel and Distributed Systems
Gang Scheduling in a Distributed System under Processor Failures and Time-Varying Gang Size

FTDCS '03 Proceedings of the The Ninth IEEE Workshop on Future Trends of Distributed Computing Systems
A Simulation - Based Performance Analysis of Gang Scheduling in a Distributed System

SS '99 Proceedings of the Thirty-Second Annual Simulation Symposium
Gang Scheduling Performance on a Cluster of Non-Dedicated Workstations

SS '02 Proceedings of the 35th Annual Simulation Symposium
Paired Gang Scheduling

IEEE Transactions on Parallel and Distributed Systems
The Partitioned Scheduling of Sporadic Real-Time Tasks on Multiprocessor Platforms

ICPPW '05 Proceedings of the 2005 International Conference on Parallel Processing Workshops
Real-Time Scheduling of Sporadic Task Systems When the Number of Distinct Task Types Is Small

RTCSA '05 Proceedings of the 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications
A comparison of local and gang scheduling on a Beowulf cluster

CLUSTER '04 Proceedings of the 2004 IEEE International Conference on Cluster Computing
Enhancements to the decision process of the self-tuning dynp scheduler

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

Fault-tolerant Gang Scheduling in Distributed Real-time Systems Utilizing Imprecise Computations

Simulation
Gang scheduling in a two-cluster system with critical sporadic jobs and migrations

SPECTS'09 Proceedings of the 12th international conference on Symposium on Performance Evaluation of Computer & Telecommunication Systems
Scheduling multiple task graphs with end-to-end deadlines in distributed real-time systems utilizing imprecise computations

Journal of Systems and Software
Gang scheduling in a two-cluster system implementing migrations and periodic feedback

Simulation
Scheduling real-time DAGs in heterogeneous clusters by combining imprecise computations and bin packing techniques for the exploitation of schedule holes

Future Generation Computer Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

A commonly used task scheduling algorithm for parallel and distributed systems is gang scheduling. In this paper, we study gang scheduling performance in the presence of critical sporadic jobs. A simulation model is used to address performance issues associated with gang scheduling on distributed processors for various workloads. Simulated results indicate that the relative performance of the gang scheduling policies depends on the arrival rates of gangs and critical sporadic jobs and also on the variability in the critical sporadic jobs inter-arrival times.