A Federated Model for Scheduling in Wide-Area Systems
| dc.contributor.author | Weissman, Jon B. | |
| dc.contributor.author | Grimshaw, Andrew S. | |
| dc.date.accessioned | 2023-10-19T15:14:01Z | |
| dc.date.available | 2023-10-19T15:14:01Z | |
| dc.date.issued | 1996-02-06 | |
| dc.description.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. | |
| dc.description.department | Computer Science | |
| dc.identifier.uri | https://hdl.handle.net/20.500.12588/2108 | |
| dc.language.iso | en_US | |
| dc.publisher | UTSA Department of Computer Science | |
| dc.relation.ispartofseries | Technical Report; CS-96-3 | |
| dc.title | A Federated Model for Scheduling in Wide-Area Systems | |
| dc.type | Article |