Efficient management of fragmented replica in data grids

Chao Chin Wu, Lien Fu Lai, Jia Xian Lai

Research output: Contribution to journalArticle

2 Citations (Scopus)

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%.

Original languageEnglish
Pages (from-to)63-70
Number of pages8
JournalInternational Journal of Grid and High Performance Computing
Volume4
Issue number2
DOIs
Publication statusPublished - 2012 Apr 1

Fingerprint

Servers

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications

Cite this

@article{6cb9de9f5c4b4fa79e2bdcc5ed84b658,
title = "Efficient management of fragmented replica in data grids",
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{\%}.",
author = "Wu, {Chao Chin} and Lai, {Lien Fu} and Lai, {Jia Xian}",
year = "2012",
month = "4",
day = "1",
doi = "10.4018/jghpc.2012040105",
language = "English",
volume = "4",
pages = "63--70",
journal = "International Journal of Grid and High Performance Computing",
issn = "1938-0259",
publisher = "IGI Global Publishing",
number = "2",

}

Efficient management of fragmented replica in data grids. / Wu, Chao Chin; Lai, Lien Fu; Lai, Jia Xian.

In: International Journal of Grid and High Performance Computing, Vol. 4, No. 2, 01.04.2012, p. 63-70.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Efficient management of fragmented replica in data grids

AU - Wu, Chao Chin

AU - Lai, Lien Fu

AU - Lai, Jia Xian

PY - 2012/4/1

Y1 - 2012/4/1

N2 - 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%.

AB - 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%.

UR - http://www.scopus.com/inward/record.url?scp=84870284905&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84870284905&partnerID=8YFLogxK

U2 - 10.4018/jghpc.2012040105

DO - 10.4018/jghpc.2012040105

M3 - Article

AN - SCOPUS:84870284905

VL - 4

SP - 63

EP - 70

JO - International Journal of Grid and High Performance Computing

JF - International Journal of Grid and High Performance Computing

SN - 1938-0259

IS - 2

ER -