Analysis and simulation of a fair queueing algorithm
SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
Virtual-Time Round-Robin: An O(1) Proportional Share Scheduler
Proceedings of the General Track: 2002 USENIX Annual Technical Conference
Fair Share on High Performance Computing Systems: What Does Fair Really Mean?
CCGRID '03 Proceedings of the 3st International Symposium on Cluster Computing and the Grid
Introduction to grid computing with globus
Introduction to grid computing with globus
WF2Q: worst-case fair weighted fair queueing
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 1
| Hi-index | 0.00 |
Grid scheduling is the process of making scheduling decisions involving resources over multiple domains. This process can include searching multiple administrative domains to use a single machine or scheduling a single job to use multiple resources at a single site or multiple sites. In an increasing number of scientific disciplines the enormous potential of the grid can be realized with the fundamental development of potential new scheduling techniques. Conventional scheduling techniques are queue based and provide only one level of service. In this paper we propose an algorithm for effective scheduling of jobs by the local scheduler considering the virtual time and proportional fairness to have a high rate of accuracy and low overhead. We describe the various scheduling algorithms that are in use and next, we explain the virtual time fair queuing algorithm with its implementation and the results.