Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
IBM Redbook : Introduction to grid computing with Globus : IBM Corporation (2003)
Schopf, J.M.: A general architecture for scheduling on the grid. Argonne National Laboratory (2002)
National Institute of Advanced Industrial Science and Technology: Grid technology research center (2002), http://www.aist.go.jp/
Bennett, J., Zhang, H.: WF2Q: Worst-case Fair Weighted Fair Queuing. In: Proceedings of INFOCOM 1996, San Francisco, CA (March 1996)
Demers, A., Keshav, S., Shenker, S.: Analysis and Simulation of a Fair Queuing Algorithm. In: Proceedings of ACMSIG - OMM 1989, Austin, TX, pp. 1–12 (September 1989)
Donno, F., Gaido, L., Ghiselli, A., Prelz, F., Sgaravatto, M.: Data Grid Prototype 1, EU-Data Grid Collaboration (2002)
Nieh, J., Vaill, C., Zhong, H.: Virtual-Time Round-Robin: An O(1) Proportional Share Scheduler. In: Proceedings of the USENIX Technical Conference (2001)
Kleban, S.D., Scott, H.: Clearwater: Fair Share on high Performance Computing System: what does Fair Really Mean? In: Proceedings of the 3rd IEEE/ACM International Symposium on Cluster Computing and the Grid (2003)
Ranganathan, K., Foster, I.: Decoupling Computation and Data Scheduling in Distributed Data- Intensive Applications (2002)
Murshed, M., Buyya, R.: Using the Grid Sim Toolkit for Enabling Grid Computing Education (2002)
Essick, R.: An Event –Based FairShare Scheduler. In: Proceedings of the Winter 1990 USENIX Conference. USENIX, Berkeley (1990)
Lopez, D., Rasika, M.: A Service Time Error Based Scheduling Algorithm for a computational Grid. In: Proceedings of the IEEE-ICSCN (February 2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lopez, D., Raja, S.V.K. (2008). Virtual Time Fair Queuing Algorithm for a Computational Grid. In: Garg, V., Wattenhofer, R., Kothapalli, K. (eds) Distributed Computing and Networking. ICDCN 2009. Lecture Notes in Computer Science, vol 5408. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-92295-7_57
Download citation
DOI: https://doi.org/10.1007/978-3-540-92295-7_57
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-92294-0
Online ISBN: 978-3-540-92295-7
eBook Packages: Computer ScienceComputer Science (R0)