Skip navigation
Skip navigation

Local Scheduling out-performs Gang Scheduling on a Beowulf Cluster

Strazdins, Peter; Uhlmann, John


Gang Scheduling and related techniques are widely believed to be necessary for efficient job scheduling on distributed memory parallel computers. This is because they minimize context switching overheads and permit the parallel job currently running to progress at the fastest possible rate. However, in the case of cluster computers, and particularly those with COTS networks, these benefits can be overwhelmed in the multiple job time-sharing context by the loss the ability to utilize the...[Show more]

CollectionsANU Research Publications
Date published: 2004
Type: Working/Technical Paper


File Description SizeFormat Image
TR-CS-04-01.pdf116.83 kBAdobe PDFThumbnail

Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  19 May 2020/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator