ISPA 2006: Frontiers of High Performance Computing and Networking – ISPA 2006 Workshops pp 939-948 | Cite as
Scalable Distributed Scheduling for Quality of Service
Abstract
A grid consists of high-end computational, storage, and network resources that, while known a priori, are dynamic with respect to activity and availability. Efficient scheduling of requests to use grid resources must adapt to this dynamic environment while meeting administrative policies. This paper discusses a framework for distributed resource management. The framework has the following novel features. First, the resource management system is distributed using resource content information that is characterized by system properties. We argue that a distributed system based on resource content is sufficient to satisfy specific scheduling requests for global Quality of Service (QoS) considering workload balance across a grid. Second, the distributed system constructs a hierarchical peer-to-peer network. This peered network provides an efficient message routing mechanism. The simulation results demonstrate that the proposed framework is proficient to satisfy QoS in distributed environment.
Keywords
Scheduling Grid Computing Quality of Service Content-based Resource Clustering Distributed SystemPreview
Unable to display preview. Download preview PDF.
References
- 1.Avery, P., Foster, I.: The GriPhyN Project:Towards Petascale Virtual-Data Grids, GriPhyN Technical Report 2000-1Google Scholar
- 2.Foster, I., Kesselman, C., Tuecke, S.: The Anatomy of the Grid: Enabling Scalable Virtual Organizations. International Journal of Supercomputer Applications (2001)Google Scholar
- 3.Sloan Digital Sky Survey (2004), http://www.sdss.org
- 4.Laser Interferometer Gravitational Wave Observatory (2004), http://ligo.caltech.edu
- 5.The Compact Muon Solenoid, an experiment for the Large Hadron Collider at CERN (2004), http://cmsinfo.cern.ch/Welcome.html/
- 6.The ATLAS Experiment (2004), http://atlasexperiment.org
- 7.Buyya, R.: Economic-based Distributed Resource Management and Scheduling for Grid Computing, Ph.D Thesis, Monash University, Melbourne, Australia (April 2002)Google Scholar
- 8.Min, R., Maheswaran, M.: Scheduling Co-Reservations with Priorities in Grid Computing Systems. In: Proceedings of the 2nd IEEE/ACM International Symposium on Cluster Computing and the Grid (2002)Google Scholar
- 9.Spooner, D.P., Cao, J., Turner, J.D., Keung, H.N.L.C., Jarvis, S.A., Nudd, G.R.: Localised Workload Management Using Performance Prediction and QoS Contracts. In: Eighteenth Annual UK Performance Engineering Workshop (2002)Google Scholar
- 10.In, J., Arbree, A., Avery, P., Cavanaugh, R., Katageri, S., Ranka, S.: Sphinx: A Scheduling Middleware for Data Intensive Applications on a Grid, GriphyN Project Technical Report, GriPhyN 2003-17 (2003)Google Scholar
- 11.In, J., Avery, P., Cavanaugh, R., Ranka, S.: Policy Based Scheduling for Simple Quality of Service in Grid Computing. In: 18th International Parallel & Distributed Processing Symposium, New, Mexico, USA (2004)Google Scholar
- 12.Carzaniga, A., Wolf, A.L.: Content-based Networking: A New Communication infrastructure. In: NSF Workshop on an infrastructure for Mobile and Wireless Systems, Scottsdale, AZ (October 2001)Google Scholar
- 13.Carzaniga, A., Rutherford, M.J., Wolf, A.L.: A Routing Scheme for Content-Based Networking. In: Proceedings of IEEE INFOCOMM 2004, Hong Kong China (March 2004)Google Scholar
- 14.Chand, R., Felber, P.: A Scalable Protocol for Content-Based Routing in Overlay Networks. In: Proceedings of the IEEE International Symposium on Network Computing and Applications, Cambridge, MA (April 2003)Google Scholar
- 15.Aron, M., Sanders, D., Druschel, P., Zwaenepoel, W.: Scalable Content-aware Request Distribution in Cluster-based Network Servers. In: Proceedings of the 2000 Annual Usenix Tech-nical Conference, San Diego, CA (June 2000)Google Scholar
- 16.Doval, D., O’Mahony, D.: Overlay Networks, A Scalable Alternative for P2P. IEEE Internet Computing (August 2003)Google Scholar
- 17.Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A scalable content-addressable network. In: ACM SIGCOMM (2001)Google Scholar
- 18.Stoica, I., Morris, R., Karger, D., Kaashoek, M.F., Balakrishman, H.: Chord: A scalable peer-to-peer loopup service for internet applications. In: ACM SIGCOMM (2001)Google Scholar
- 19.Zhao, B., Kubiatowicz, J., Joseph, A.: Tapestry: An infrastructure for fault-tolerant wide-area location and routing, Technical report, U. C. Berkeley (2001)Google Scholar
- 20.Crespo, A., Garcia-Molina, H.: Semantic Overlay Networks for P2P Systems, Technical report, Stanford University (January 2003)Google Scholar
- 21.Hoschek, W.: A Unified Peer-to-Peer Database Framework for Scalable Service and Resource Discovery. In: Proc. of the International IEEE/ACM Workshop on Grid Computing, Baltimore, USA (November 2002)Google Scholar
- 22.Bradley, D.: Condor-G Matchmaking in USCMS, Condor technical report, University of Wisconsin (November 2003)Google Scholar