Repository logo
  • English
  • 中文
Log In
Have you forgotten your password?
  1. Home
  2. College of Electrical Engineering and Computer Science / 電機資訊學院
  3. Computer Science and Information Engineering / 資訊工程學系
  4. Optimal replica placement in hierarchical Data Grids with locality assurance
 
  • Details

Optimal replica placement in hierarchical Data Grids with locality assurance

Journal
Journal of Parallel and Distributed Computing
Journal Volume
68
Journal Issue
12
Pages
1517-1538
Date Issued
2008
Date
2008
Author(s)
Wu, Jan-Jan
Lin, Yi-Fang
PANGFENG LIU  
DOI
10.1016/j.jpdc.2008.08.002
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
Abstract
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.
Subjects
Hierarchical data grids; Load balancing; Locality assurance; Replica placement
SDGs

[SDGs]SDG9

Other Subjects
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
Type
journal article
File(s)
Loading...
Thumbnail Image
Name

13.pdf

Size

9.28 MB

Format

Adobe PDF

Checksum

(MD5):3a32f255d96cce7054add4017450315f

臺大位居世界頂尖大學之列,為永久珍藏及向國際展現本校豐碩的研究成果及學術能量,圖書館整合機構典藏(NTUR)與學術庫(AH)不同功能平台,成為臺大學術典藏NTU scholars。期能整合研究能量、促進交流合作、保存學術產出、推廣研究成果。

To permanently archive and promote researcher profiles and scholarly works, Library integrates the services of “NTU Repository” with “Academic Hub” to form NTU Scholars.

總館學科館員 (Main Library)
醫學圖書館學科館員 (Medical Library)
社會科學院辜振甫紀念圖書館學科館員 (Social Sciences Library)

開放取用是從使用者角度提升資訊取用性的社會運動,應用在學術研究上是透過將研究著作公開供使用者自由取閱,以促進學術傳播及因應期刊訂購費用逐年攀升。同時可加速研究發展、提升研究影響力,NTU Scholars即為本校的開放取用典藏(OA Archive)平台。(點選深入了解OA)

  • 請確認所上傳的全文是原創的內容,若該文件包含部分內容的版權非匯入者所有,或由第三方贊助與合作完成,請確認該版權所有者及第三方同意提供此授權。
    Please represent that the submission is your original work, and that you have the right to grant the rights to upload.
  • 若欲上傳已出版的全文電子檔,可使用Open policy finder網站查詢,以確認出版單位之版權政策。
    Please use Open policy finder to find a summary of permissions that are normally given as part of each publisher's copyright transfer agreement.
  • 網站簡介 (Quickstart Guide)
  • 使用手冊 (Instruction Manual)
  • 線上預約服務 (Booking Service)
  • 方案一:臺灣大學計算機中心帳號登入
    (With C&INC Email Account)
  • 方案二:ORCID帳號登入 (With ORCID)
  • 方案一:定期更新ORCID者,以ID匯入 (Search for identifier (ORCID))
  • 方案二:自行建檔 (Default mode Submission)
  • 方案三:學科館員協助匯入 (Email worklist to subject librarians)

Built with DSpace-CRIS software - Extension maintained and optimized by 4Science