FIFO Queuing of Constant Length Fully Synchronous Jobs

Abstract. 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.

• Type: Conference
• Year: 2007
• Where: GSEM
• Authors: Vandy Berten, Raymond R. Devillers, Guy Louchard
• Keywords: Constant Length Jobs, Distributed And Parallel Computing, FIFO Queue, GSEM 2007, Synchronous Parallel Jobs