Gang Scheduling in a Distributed System under Processor Failures and Time-Varying Gang Size

Authors:
Helen D. Karatza
Affiliations:
-
Venue:
FTDCS '03 Proceedings of the The Ninth IEEE Workshop on Future Trends of Distributed Computing Systems
Year:
2003

Citing 0
Cited 4

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

Simulation
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
Multi-site scheduling with multiple job reservations and forecasting methods

ISPA'06 Proceedings of the 4th international conference on Parallel and Distributed Processing and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we study the performance of a distributed system which is subject to hardware failures and subsequent repairs. A special type of scheduling called gang scheduling is considered, under which jobs consist of a number of interacting tasks which are scheduled to run simultaneously on distinct processors. System performance is examined and compared in cases where different distributions for the number of parallel tasks per job (gang size) are employed. We examine cases where gang size is defined by a specific distribution and also a case where gang size distribution varies with time.