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

摘要

Gang scheduling has been shown to be an effective task scheduling policy for parallel and distributed systems. In this paper we study gang scheduling performance in the presence of critical sporadic jobs. A simulation model is used to address performance issues associated with gang scheduling on distributed processors for various workloads. Simulated results indicate that the relative performance of the gang scheduling policies depends on the arrival rates of gangs and critical sporadic jobs.