Welcome to the InfoSci Platform
Reference Hub1
Efficient Management of Fragmented Replica in Data Grids

Efficient Management of Fragmented Replica in Data Grids

Chao-Chin Wu, Lien-Fu Lai, Jia-Xian Lai
Copyright: © 2012 |Volume: 4 |Issue: 2 |Pages: 8
ISSN: 1938-0259|EISSN: 1938-0267|EISBN13: 9781466612327|DOI: 10.4018/jghpc.2012040105
Cite Article Cite Article

MLA

Wu, Chao-Chin, et al. "Efficient Management of Fragmented Replica in Data Grids." IJGHPC vol.4, no.2 2012: pp.63-70. http://doi.org/10.4018/jghpc.2012040105

APA

Wu, C., Lai, L., & Lai, J. (2012). Efficient Management of Fragmented Replica in Data Grids. International Journal of Grid and High Performance Computing (IJGHPC), 4(2), 63-70. http://doi.org/10.4018/jghpc.2012040105

Chicago

Wu, Chao-Chin, Lien-Fu Lai, and Jia-Xian Lai. "Efficient Management of Fragmented Replica in Data Grids," International Journal of Grid and High Performance Computing (IJGHPC) 4, no.2: 63-70. http://doi.org/10.4018/jghpc.2012040105

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

Rather than replicating a file completely, Chang et al. proposed a fragmented replication technique to cope with the problem that only partial content of the replica are required in a local application. Furthermore, they also proposed two server selection algorithms for replica retrieval. However, their algorithms do not always find an optimal solution. To address the problem, in this paper, the authors propose a replica selection algorithm to improve the fragmented replica retrieval efficiency in this paper. It is a heuristic considering not only the transmission time but also the number of available servers for each block. Simulation results show that the proposed algorithm can improve the retrieval efficiency up to 12%.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.