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

  • Authors:
  • Zafeirios C. Papazachos;Helen D. Karatza

  • Affiliations:
  • Department of Informatics, Aristotle University of Thessaloniki, Thessaloniki, Greece;Department of Informatics, Aristotle University of Thessaloniki, Thessaloniki, Greece

  • Venue:
  • SPECTS'09 Proceedings of the 12th international conference on Symposium on Performance Evaluation of Computer & Telecommunication Systems
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

Gang scheduling is a common task scheduling algorithm for parallel and distributed systems which delivers improved performance. In this paper, we consider the scheduling of critical jobs which arrive in a sporadic manner at the system. A migration scheme is implemented in order to alleviate the impact of critical sporadic jobs on the performance of gang scheduling. A simulation model consisting of two clusters is used to provide results on the performance of the system.