Article

Dynamic Replication based on Firefly Algorithm in Data Grid

Dynamic Replication based on Firefly Algorithm in Data Grid

Download full textFree with an account; signing up with Google takes seconds

Abstract

In data grid, using reservation is accepted to provide scheduling and service quality. Users need to have an access to the stored data in geographical environment, which can be solved by using replication, and an action taken to reach certainty. As a result, users are directed toward the nearest version to access information. The most important point is to know in which sites and distributed system the produced versions are located. By selecting a suitable place for versions, the versions having performance, efficiency and lower access time are used. In this study, an efficient method is presented to select the best place for those versions created in data grid by using the users’ firefly algorithm which is compared with cooling algorithm. Results show that firefly algorithm has better performance than others.This means firefly algorithm is better and more accurate than genetic algorithm and particle swarm optimization in data replication task.

Authors and affiliations
  1. mehdi Sadeghzadeh — islamic azad university, mahshahr branch

Similar items

  • CFS: a new dynamic replication strategy for data grids

    Scholarly record2012Int. Arab J. Inf. Technol.Feras Hanandeh, Mutaz Khazaaleh, Hamidah Ibrahim, Rohaya Latip

    Data grids are currently proposed solutions to large scale data management problems including efficient file transfer and replication. Large amounts of data and the world-wide distribution of data stores contribute to the complexity of the data management challenge. Recent archit

  • DR: A Two-Stage Dynamic Replication Strategy for Data Grid

    Scholarly record2009P. K. Suri, Manpreet Singh

    One major challenge in data grids is how to provide good and timely access to huge amount of data in distributed locations, given the high latency of interconnection networks. Dynamic replication strategies are regarded as one of the major optimization technique for reducing acce

  • Improving Job Scheduling Performance with Dynamic Replication Strategy in Data Grids

    Scholarly record2007PaCTNguyen Dang Nhan, Soonwook Hwang, Sang Boem Lim

    Dealing with a large amount of data in Data Grids makes the requirement for efficient data access more critical. In this paper, we proposed a new approach to replication problem by organizing the data into several data categories that it belongs to. This organizing will help impr

  • Dynamic replication strategies in data grid systems: a survey

    Open-access article2015The Journal of SupercomputingUrasTos, RiadMokadem, AbdelkaderHameurlain, TolgaAyav
  • A Novel Replication Strategy in Data Grid Environment with a Dynamic Threshold

    Scholarly record2014Sheida Dayyani, Mohammad Reza Khayyambashi

    Data Grid is a type of Grid Computing systems whichis designed to provide geographically distributed data resources to large computational problems that require mining and evaluating large amounts of data. Managing this data in a centralized location increases the data access tim

  • Simulation of Dynamic Data Replication Strategies in Data Grids

    Scholarly record2003IPDPSHouda Lamehamedi, Zujun Shentu, Boleslaw K. Szymanski, Ewa Deelman

    Data Grids provide geographically distributed resources for large-scale data-intensive applications that generate large data sets. However, ensuring efficient access to such huge and widely distributed data is hindered by the high latencies of the Internet. We address these chall