Optimizing Server Placement for QoS Requirements in Hierarchical Grid Environments

This paper focuses on two problems related to QoS-aware I/O server placement in hierarchical Grid environments. Given a hierarchical network with requests from clients, the network latencies of links, constraints on servers' capabilities and the service quality requirement, the solution to the minimum server placement problem attempts to place the minimum number of servers that meet both the constrains on servers' capabilities and the service quality requirement. As our model considers both the different capabilities of servers and the network latencies, it is more general than similar works in the literatures. Instead of using a heuristic approach, we propose an optimal algorithm based on dynamic programming to solve the problem. We also consider the optimal service quality problem, which tries to place a given number of servers appropriately so that the maximum expected response time is minimized. We prove that an optimal server placement can be achieved by combining the dynamic programming algorithm with a binary search on the service quality requirement. The simulation results clearly show the improvement in the number of servers and the maximum expected response time.

[1]  Rajkumar Buyya,et al.  Grid Computing — GRID 2000 , 2002, Lecture Notes in Computer Science.

[2]  Pangfeng Liu,et al.  A QoS-Aware Heuristic Algorithm for Replica Placement , 2006, 2006 7th IEEE/ACM International Conference on Grid Computing.

[3]  P. Krishnan,et al.  The cache location problem , 2000, TNET.

[4]  Chien-Min Wang,et al.  Efficient multi-source data transfer in data grids , 2006, Sixth IEEE International Symposium on Cluster Computing and the Grid (CCGRID'06).

[5]  Boleslaw K. Szymanski,et al.  Simulation of dynamic data replication strategies in Data Grids , 2003, Proceedings International Parallel and Distributed Processing Symposium.

[6]  Chien-Min Wang,et al.  Optimizing Server Placement in Hierarchical Grid Environments , 2006, GPC.

[7]  Jemal H. Abawajy,et al.  An efficient replicated data access approach for large-scale distributed systems , 2004, CCGRID.

[8]  Laurence T. Yang,et al.  Advances in Grid and Pervasive Computing, Third International Conference, GPC 2008, Kunming, China, May 25-28, 2008. Proceedings , 2008, GPC.

[9]  Kavitha Ranganathan,et al.  Identifying Dynamic Replication Strategies for a High-Performance Data Grid , 2001, GRID.

[10]  Jianliang Xu,et al.  QoS-aware replica placement for content distribution , 2005, IEEE Transactions on Parallel and Distributed Systems.

[11]  William E. Johnston,et al.  Computational and data Grids in large-scale science and engineering , 2002, Future Gener. Comput. Syst..

[12]  Jemal H. Abawajy,et al.  Placement of File Replicas in Data Grid Environments , 2004, International Conference on Computational Science.

[13]  Stephen Gilmore,et al.  Evaluating the Performance of Skeleton-Based High Level Parallel Programs , 2004, International Conference on Computational Science.

[14]  Javier Jaén Martínez,et al.  Data Management in an International Data Grid Project , 2000, GRID.

[15]  Craig Lee,et al.  Grid Computing — GRID 2001: Second International Workshop Denver, CO, USA, November 12, 2001 Proceedings , 2001, Lecture Notes in Computer Science.