A federated model for scheduling in wide-area systems
Syracuse, NY, USA(1996)
摘要
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.
更多查看译文
关键词
distributed algorithms,resource allocation,scheduling,wide area networks,Legion,candidate machine schedules,distributed algorithm,federated model,local site schedulers,resource control,scheduling,wide area computing system,wide area scheduler,wide area scheduling,wide area systems
AI 理解论文
溯源树
样例
![](https://originalfileserver.aminer.cn/sys/aminer/pubs/mrt_preview.jpeg)
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要