FIFO queuing of constant length fully synchronous jobs
The paper examines the behaviour of a saturated multiprocessor system to which fully synchronous parallel jobs are submitted. In order to simplify the analysis, we assume constant length jobs, a nonpreemptive scheduling and a FIFO queue. We determine in particular the number of used CPUs.
Full Text: PDF