Improving First-Come-First-Serve Job Scheduling by Gang Scheduling

Abstract. We present a new scheduling method for batch jobs on massively parallel processor architectures. This method is based on the First

• Type: Conference
• Year: 1998
• Where: JSSPP
• Authors: Uwe Schwiegelshohn, Ramin Yahyapour
• Keywords: Distributed And Parallel Computing, First­ Come­first­serve Strategy, JSSPP 1998, Parallel Processor Architectures, Real Parallel Computers