Title of article
CFS: A New Dynamic Replication Strategy for Data Grids
Author/Authors
Hanandeh, Feras Hashemite University - Prince Al- Hussein bin Abdullah II Faculty of Information Technology, Jordan , Khazaaleh, Mutaz Al-Balqa Applied University - Irbid College, Jordan , Ibrahim, Hamidah Universiti Putra Malaysia - Faculty of Computer Science and Information Technology, Malaysia , Latip, Rohaya Universiti Putra Malaysia - Faculty of Computer Science and Information Technology, Malaysia
From page
94
To page
99
Abstract
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 architecture proposals and prototypes deal with dynamic replication strategies for a high-performance data grid. This paper describes a new dynamic replication strategy called Constrained Fast Spread (CFS). It aims to alleviate the main problems encountered in the current replication strategies like the negligence of the storage capacity of the nodes. The new CFS strategy enhanced the fast spread strategy by concentrating on the feasibility of replicating the requested replica on each node among the network
Keywords
Grid computing , dynamic replication strategies
Journal title
The International Arab Journal of Information Technology (IAJIT)
Journal title
The International Arab Journal of Information Technology (IAJIT)
Record number
2543801
Link To Document