Skip navigation
Skip navigation

A Comparison of Local and 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 outweighed in the multiple job time-sharing context by the loss the ability to utilize the CPU for...[Show more]

CollectionsANU Research Publications
Date published: 2004
Type: Conference paper
Source: Proceedings of the 2004 IEEE International Conference on Cluster Computing
DOI: 10.1109/CLUSTR.2004.1392601


There are no files associated with this item.

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

Updated:  23 August 2018/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator