QRP03-5: SLA-Constrained Resource Scheduling Policy for Group Peering in P2P Grid

Due to the dynamic nature of the grid computing and P2P in networks, the behavior of system might be very unpredictable in respect of reliability. Thus, we need well-organized system architecture to provide high system availability with resource scheduling scheme for P2P grid application. In this paper, we propose the SLA-constrained resource scheduling policy methodology in order to enhance system performance in P2P grid. The simulation results show that SCPA-based job scheduling can support the load balancing and guarantee the high system availability in system performance.

[1]  Chan-Hyun Youn,et al.  Design of P2P Grid Networking Architecture Using k-Redundancy Scheme Based Group Peer Concept , 2005, WINE.

[2]  Ian T. Foster,et al.  The anatomy of the grid: enabling scalable virtual organizations , 2001, Proceedings First IEEE/ACM International Symposium on Cluster Computing and the Grid.

[3]  Tim D. Moreton,et al.  Peer-to-Peer Systems and the Grid , 2003 .

[4]  Thomas G. Robertazzi,et al.  Divisible Load Scheduling for Grid Computing , 2003 .

[5]  Edwin K. P. Chong,et al.  Discrete event systems: Modeling and performance analysis , 1994, Discret. Event Dyn. Syst..

[6]  Lisandro Zambenedetti Granville,et al.  An hierarchical policy-based architecture for integrated management of grids and networks , 2004, Proceedings. Fifth IEEE International Workshop on Policies for Distributed Systems and Networks, 2004. POLICY 2004..

[7]  Hector Garcia-Molina,et al.  Designing a super-peer network , 2003, Proceedings 19th International Conference on Data Engineering (Cat. No.03CH37405).