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 language | English (US) |
|---|---|
| Title of host publication | IEEE International Symposium on High Performance Distributed Computing, Proceedings |
| Pages | 542-550 |
| Number of pages | 9 |
| DOIs | |
| State | Published - 1996 |
| Event | Proceedings of the 1996 5th IEEE International Symposium on High Performance Distributed Computing - Syracuse, NY, USA Duration: Aug 6 1996 → Aug 9 1996 |
Other
| Other | Proceedings of the 1996 5th IEEE International Symposium on High Performance Distributed Computing |
|---|---|
| City | Syracuse, NY, USA |
| Period | 8/6/96 → 8/9/96 |