Replica Selection Algorithm in Data Grids:The Best-Fit Approach

被引:0
|
作者
Jaradat, Ayman [1 ]
机构
[1] Majmaah Univ, Coll Sci, Dept Comp Sci & Informat, Majmaah 11932, Saudi Arabia
关键词
replica selection; data grid; grid computing;
D O I
10.12913/22998624/142214
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
The design of Data Grids allows grid facilities to manage data files and their corresponding replicas from all around the globe. Replica selection in Data Grids is a complex service that selects the best replica place amongst several scattered places based on quality of service parameters. All replica selection algorithms look for the best replica for the requesting users without taking into account the limitation of their network or hardware capabilities to find the best fit. This leaves capable users with limited ability to connect with the best replica places without fully utilizing their download speed. It furthermore compromises the best replica places and shifts capable users to lower quality replica places and degrades the whole Data Grid environment. To improve quality of service parameters the solution we propose is, a matching algorithm that matches the capabilities of grid user with replica providers that are the best fit. This best-fit approach takes into account both the capabilities of grid users and the capabilities of replica places and creates matches of almost similar capabilities. Simulation results proved that the best-fit algorithm outperforms previous replica selection algorithms.
引用
收藏
页码:30 / 37
页数:8
相关论文
共 50 条
  • [21] The best-fit model for endometriosis - Reply
    Redwine, D
    [J]. FERTILITY AND STERILITY, 2003, 80 (01) : 232 - 233
  • [22] A hybrid approach to replica management in data grids
    Belalem, Ghalem
    Slimani, Yahya
    [J]. International Journal of Web and Grid Services, 2007, 3 (01) : 2 - 18
  • [23] Replica selection on co-allocation data grids
    Chang, RS
    Wang, CM
    Chen, PH
    [J]. PARALLEL AND DISTRIBUTED PROCESSING AND APPLICATIONS, PROCEEDINGS, 2004, 3358 : 584 - 593
  • [24] Complete and fragmented replica selection and retrieval in Data Grids
    Chang, Ruay-Shiung
    Chen, Po-Hung
    [J]. FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE, 2007, 23 (04): : 536 - 546
  • [25] Best-Fit Containerization as a Brokered Service
    Venkateswaran, Sreekrishnan
    Sarkar, Santonu
    [J]. 2018 IEEE INT CONF ON PARALLEL & DISTRIBUTED PROCESSING WITH APPLICATIONS, UBIQUITOUS COMPUTING & COMMUNICATIONS, BIG DATA & CLOUD COMPUTING, SOCIAL COMPUTING & NETWORKING, SUSTAINABLE COMPUTING & COMMUNICATIONS, 2018, : 940 - 947
  • [26] Convergence in distribution for best-fit decreasing
    Rhee, WT
    Talagrand, M
    [J]. SIAM JOURNAL ON COMPUTING, 1996, 25 (04) : 894 - 906
  • [27] Algorithms for Constrained Best-fit Alignmen
    Devendeville, Laure
    Dumont, Serge
    Goubet, Olivier
    Lefebvre, Sylvain
    [J]. JOURNAL OF INFORMATICS AND MATHEMATICAL SCIENCES, 2013, 5 (02): : 77 - 100
  • [28] A study of best-fit memory allocators
    Hasan, Y
    Chang, M
    [J]. COMPUTER LANGUAGES SYSTEMS & STRUCTURES, 2005, 31 (01) : 35 - 48
  • [29] Equivalence-based Selection of Best-fit Models to Support Wiki Design
    De Ruvo, Giuseppe
    Santone, Antonella
    [J]. 2015 IEEE 24TH INTERNATIONAL CONFERENCE ON ENABLING TECHNOLOGIES - INFRASTRUCTURE FOR COLLABORATIVE ENTERPRISES, 2015, : 204 - 209
  • [30] Generalized method for estimating best-fit vertical alignments for profile data
    Easa, Said M.
    Kikuchi, Shinya
    [J]. World Academy of Science, Engineering and Technology, 2009, 33 : 693 - 701