The grid: blueprint for a new computing infrastructure
The grid: blueprint for a new computing infrastructure
Architectural Models for Resource Management in the Grid
GRID '00 Proceedings of the First IEEE/ACM International Workshop on Grid Computing
Decoupling Computation and Data Scheduling in Distributed Data-Intensive Applications
HPDC '02 Proceedings of the 11th IEEE International Symposium on High Performance Distributed Computing
CCGRID '02 Proceedings of the 2nd IEEE/ACM International Symposium on Cluster Computing and the Grid
Replica Placement in Data Grid: Considering Utility and Risk
ITCC '05 Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume I - Volume 01
The Anatomy of the Grid: Enabling Scalable Virtual Organizations
International Journal of High Performance Computing Applications
File replication, maintenance, and consistency management services in data grids
The Journal of Supercomputing
A dynamic file maintenance scheme with Bayesian network for data grids
MTPP'10 Proceedings of the Second Russia-Taiwan conference on Methods and tools of parallel programming multicomputers
Hi-index | 0.00 |
Replication in Data Grid reduces access latency and bandwidth consumption by creating multiple data copies. One of the challenges in data replication is to select the candidate sites where replicas should be placed, which is known as the allocation problem. One performance metric to determine the best place to host replicas is select for optimum average response time. We use the p-median model for the replica placement problem. The p-median model has been exploited in urban planning to find locations where new facilities should be built. In our problem, the p-median model finds the locations of p candidate sites to place a replica that optimize the aggregated response time. Motivated by the fact that the Grid environment is highly dynamic, we propose a dynamic replica maintenance algorithm that re-allocates replicas to new candidate sites when a performance metric degrades significantly. Simulation results demonstrate that the dynamic maintenance algorithm with static placement decisions performs best in dynamic environments like Data Grids.