Performance evaluation of gang scheduling in a two-cluster system with migrations

Authors:
Zafeirios C. Papazachos;Helen D. Karatza
Affiliations:
Department of Informatics, Aristotle University of Thessaloniki, 54124, Greece;Department of Informatics, Aristotle University of Thessaloniki, 54124, Greece
Venue:
IPDPS '09 Proceedings of the 2009 IEEE International Symposium on Parallel&Distributed Processing
Year:
2009

Citing 0
Cited 6

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 Allocation Policies on a Grid and Local Level

Electronic Notes in Theoretical Computer Science (ENTCS)
Performance evaluation of bag of gangs scheduling in a heterogeneous distributed system

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

Simulation
Evaluation of gang scheduling performance and cost in a cloud computing system

The Journal of Supercomputing
Improving CompactMatrix phase in gang scheduling by changing transference condition and utilizing exchange

The Journal of Supercomputing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Gang scheduling is considered to be a highly effective task scheduling policy for distributed systems. In this paper we present a migration scheme which reduces the fragmentation in the schedule caused by gang scheduled jobs which cannot start. Furthermore, the existence of high priority jobs in the workload is addressed by the proposed strategy. High priority jobs need to be started immediately, which can in turn lead to the interruption of a parallel job's execution. A distributed system consisting of two homogeneous clusters is simulated to evaluate the performance. Our simulation results indicate that the proposed strategy can result in a performance boost.