Performance evaluation of dynamic sharing of processors in two-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/sub 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/sub 1/, P/sub 2/)