A Probabilistic Approach for Fully Decentralized Resource Management for Grid Systems

The specific problem that underlies in collaborating Grids is scheduling of resources with no knowledge about availability of the resources due to the distributed and autonomous nature of the underlying Grid systems. In this paper, we propose a fully decentralized and probabilistic resource management scheme for Grid systems collaborating based on peer-to-peer communication paradigm. The key idea we employ is to use benchmarked performance measures about the static resource information and calculate the job execution workload. Then this benchmarked job execution time is used to predict the job scheduling feasibility in the face of resource dynamism on the target system. We design our scheme as self adjusting to the actual resource behavior and performance. Simulation results validate the appropriateness of our scheme.

[1]  Richard Wolski,et al.  The network weather service: a distributed resource performance forecasting service for metacomputing , 1999, Future Gener. Comput. Syst..

[2]  R. F. Freund,et al.  Dynamic matching and scheduling of a class of independent tasks onto heterogeneous computing systems , 1999, Proceedings. Eighth Heterogeneous Computing Workshop (HCW'99).

[3]  Ming Wu,et al.  Grid Harvest Service: a system for long-term, application-level task scheduling , 2003, Proceedings International Parallel and Distributed Processing Symposium.

[4]  Jon B. Weissman,et al.  Adaptive resource selection for grid-enabled network services , 2003, Second IEEE International Symposium on Network Computing and Applications, 2003. NCA 2003..

[5]  Erik Hagersten,et al.  THROOM — Supporting POSIX Multithreaded Binaries on a Cluster , 2003 .

[6]  P. Sadayappan,et al.  Distributed job scheduling on computational Grids using multiple simultaneous requests , 2002, Proceedings 11th IEEE International Symposium on High Performance Distributed Computing.

[7]  Francisco Vilar Brasileiro,et al.  Trading Cycles for Information: Using Replication to Schedule Bag-of-Tasks Applications on Computational Grids , 2003, Euro-Par.

[8]  Selim G. Akl,et al.  Scheduling Algorithms for Grid Computing: State of the Art and Open Problems , 2006 .

[9]  Ilias Kotsireas,et al.  Proceedings, 19th International Symposium on High Performance Computing Systems and Applications, HPCS 2005 : 15-18 May 2005, Guelph, Ontario, Canada , 2005 .

[10]  Xingfu Wu,et al.  Using Performance Prediction to Allocate Grid Resources , 2004 .

[11]  Gabriel Mateescu.  Quality of Service on the Grid Via Metascheduling with Resource Co-Scheduling and Co-Reservation , 2003, Int. J. High Perform. Comput. Appl..

[12]  Fredric Messing.  Predicting scheduling success , 1993 .

[13]  R. F. Freund,et al.  Dynamic Mapping of a Class of Independent Tasks onto Heterogeneous Computing Systems , 1999, J. Parallel Distributed Comput..

[14]  Akshai K. Aggarwal,et al.  An adaptive generalized scheduler for grid applications , 2005, 19th International Symposium on High Performance Computing Systems and Applications (HPCS'05).

[15]  Francisco Vilar Brasileiro,et al.  Exploiting Replication and Data Reuse to Efficiently Schedule Data-Intensive Applications on Grids , 2004, JSSPP.