Performance evaluation of dynamic sharing of processors intwo-stage parallel processing systems

The performance of job scheduling is studied in a large parallel processing system where a job is modeled as a concatenation of two stages which must be processed in sequence. P_i is the number of processors required by stage P as the total number of processors in the system. A large parallel computing system is considered where Max(P₁, P₂)⩾P≫1 and Max(P₁ , P₂)≫Min(P₁, P₂). For such systems, exact expressions for the mean system delay are obtained for various job models and disciplines. The results show that the priority should be given to jobs working on the stage which requires fewer processors. The large parallel system (i.e. P≫1) condition is then relaxed to obtain the mean system time for two job models when the priority is given to the second stage. Moreover, a scale-up rule is introduced to obtain the approximated delay performance when the system provides more processors than the maximum number of processors required by both stages (i.e. P>Max(P₁, P₂)). An approximation model is given for jobs with more than two stages