Optimized QoS-aware replica placement heuristics and applications in astronomy data grid
Optimized QoS-aware replica placement heuristics and applications in astronomy data grid
复制标题
DOI：
10.1016/j.jss.2011.02.038
复制
发表时间：
2011-07
期刊：
影响因子：
--
通讯作者：
Zhihui Du;Jingkun Hu;Yinong Chen;Zhili Cheng-;Xiaoyin Wang
中科院分区：
文献类型：
--
作者：
Zhihui Du;Jingkun Hu;Yinong Chen;Zhili Cheng-;Xiaoyin Wang
This paper studies the Quality-of-Service (QoS)-aware replica placement problem in a general graph model. Since the problem was proved NP-hard, heuristic algorithms are the current solutions to the problem. However, these algorithms cannot always find the effective replica placement strategy. We propose two algorithms that can obtain better results within the given time period. The first algorithm is calledCover Distancealgorithm, which is based on theGreedy Coveralgorithm. The second algorithm is an optimized genetic algorithm, in which we use random heuristic algorithms to generate initial population to avoid enormous useless searching. Then, the0-Greedy-Deletealgorithm is used to optimize the genetic algorithm solutions. According to the performance evaluation, ourCover Distancealgorithm can obtain relatively better solution in time critical scenarios. Whereas, the optimized genetic algorithm is better when the replica cost is of higher priority than algorithm execution time. The QoS-aware data replication heuristic algorithms are applied into the data distribution service of an astronomy data grid pipeline prototype, and the operation process is studied in detail.
