Skip to Main Content
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.
Date of Conference: 13-16 July 2009