Federated model for scheduling in wide-area systems

Jon B. Weissman, Andrew S. Grimshaw

Research output: Chapter in Book/Report/Conference proceedingConference contribution

27 Scopus citations

Abstract

In this paper a model for scheduling in wide-area systems is described. The model is federated and utilizes a collection of local site schedulers that control the use of their resources. The wide-area scheduler consults the local site schedulers to obtain candidate machine schedules. A set of issues and challenges inherent to wide-area scheduling are also described and the proposed model is shown to address many of these problems. A distributed algorithm for wide-area scheduling is presented and relies upon information made available about the resource needs of user jobs. The wide-area scheduler will be implemented in Legion, a wide-area computing system developed at the University of Virginia.

Original languageEnglish (US)
Title of host publicationIEEE International Symposium on High Performance Distributed Computing, Proceedings
Pages542-550
Number of pages9
DOIs
StatePublished - Jan 1 1996
EventProceedings of the 1996 5th IEEE International Symposium on High Performance Distributed Computing - Syracuse, NY, USA
Duration: Aug 6 1996Aug 9 1996

Other

OtherProceedings of the 1996 5th IEEE International Symposium on High Performance Distributed Computing
CitySyracuse, NY, USA
Period8/6/968/9/96

Fingerprint Dive into the research topics of 'Federated model for scheduling in wide-area systems'. Together they form a unique fingerprint.

Cite this