https://scholars.lib.ntu.edu.tw/handle/123456789/118328
標題: | Optimal replica placement in hierarchical Data Grids with locality assurance | 作者: | Wu, Jan-Jan Lin, Yi-Fang PANGFENG LIU |
關鍵字: | Hierarchical data grids; Load balancing; Locality assurance; Replica placement | 公開日期: | 2008 | 卷: | 68 | 期: | 12 | 起(迄)頁: | 1517-1538 | 來源出版物: | Journal of Parallel and Distributed Computing | 摘要: | In this paper, we address three issues concerning data replica placement in hierarchical Data Grids that can be presented as tree structures. The first is how to ensure load balance among replicas. To achieve this, we propose a placement algorithm that finds the optimal locations for replicas so that their workload is balanced. The second issue is how to minimize the number of replicas. To solve this problem, we propose an algorithm that determines the minimum number of replicas required when the maximum workload capacity of each replica server is known. Finally, we address the issue of service quality by proposing a new model in which each request must be given a quality-of-service guarantee. We describe new algorithms that ensure both workload balance and quality of service simultaneously. We conduct extensive simulation experiments to evaluate the effectiveness of our algorithms. The comparison with the previous Affinity Replica Location Policy demonstrates that our algorithms consistently outperform the heuristic algorithm both in terms of minimum number of replicas used and the actual data transmission time. © 2008 Elsevier Inc. All rights reserved. |
URI: | http://ntur.lib.ntu.edu.tw//handle/246246/155139 https://www.scopus.com/inward/record.uri?eid=2-s2.0-56049116670&doi=10.1016%2fj.jpdc.2008.08.002&partnerID=40&md5=7a8756541f46723e1a27520ab659e938 |
ISSN: | 07437315 | DOI: | 10.1016/j.jpdc.2008.08.002 | SDG/關鍵字: | Algorithms; Data structures; Heuristic algorithms; Location; Servers; Trees (mathematics); Data replicas; Data transmission times; Extensive simulations; Hierarchical data grids; Hierarchical datums; Load balances; Load balancing; Locality assurance; New algorithms; New models; Optimal locations; Placement algorithms; Replica locations; Replica placement; Replica placements; Replica servers; Service qualities; Tree structures; Workload balances; Quality of service |
顯示於: | 資訊工程學系 |
在 IR 系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。