Performance of Gang Scheduling Policies in the Presence of Critical Sporadic Jobs in Distributed Systems

摘要

Gang scheduling has been shown to be an effective taskrnscheduling policy for parallel and distributed systems. Inrnthis paper we study gang scheduling performance in thernpresence of critical sporadic jobs. A simulation model isrnused to address performance issues associated with gangrnscheduling on distributed processors for various workloads.rnSimulated results indicate that the relative performance ofrnthe gang scheduling policies depends on the arrival rates ofrngangs and critical sporadic jobs.