Berten, VandyDevillers, RaymondLouchard, GuyKowalczyk, Ryszard2019-05-062019-05-062007978-3-88579-211-6https://dl.gi.de/handle/20.500.12116/22152The paper examines the behaviour of a saturated multipro- cessor system to which fully synchronous parallel jobs are submitted. In order to simplify the analysis, we assume constant length jobs, a non-preemptive scheduling and a FIFO queue. We determine in particular the number of used CPUs.enFIFO schedulingmultiprocessor platformsNext-Fit Bin- packingFIFO Queuing of Constant Length Fully Synchronous JobsText/Conference Paper1617-5468