Gang scheduling with precedence constraints

In a distributed system, gang scheduled parallel jobs are considered as an efficient way of scheduling frequently communicating parallel jobs. This paper studies the performance of scheduling strategies in the case of gangs which are dynamically generated based on precedence constraints with formerly executed gangs. The formation of a secondary gang upon the execution of a preceding gang can be necessary for the further processing of affinity information which resides on the caches of the previously seized processors. A simulation model is implemented in order to examine the performance of gang scheduling algorithms in the case of gangs with precedence constraints.