24x7 Service; AnyTime; AnyWhere

Dynamic replication algorithm in data grid: Survey

K. Madi, Mohammed and Hassan, Suhaidi (2008) Dynamic replication algorithm in data grid: Survey. In: International Conference on Network Applications, Protocols, and Services 2008 (NetApps 2008), 21-22 November 2008, Executive Development Centre (EDC) Universiti Utara Malaysia. Universiti Utara Malaysia, Sintok, pp. 1-7. ISBN 9789832078333

[thumbnail of Dynamic_Replication_Algorithm_in_Data_Grid.pdf] PDF
Restricted to Repository staff only

Download (130kB)


Data Grid is an infrastructure that manages huge amount of data files, and provides intensive computational resources across geographically distributed collaboration. It is not enough to provide convenient accessibility to these data by only high speed network and large mainframe systems. For improving the performance of file accesses and to ease the sharing amongst distributed collaboration, such a system needs replication services. Data replication is a common method used to improve the performance of data access in distributed systems. In this paper, we present a survey of some related previous works and highlight some various algorithms that have been proposed by other researchers. A dynamic replication model based on mathematical concepts is proposed. The main purpose of this model is find out the popular file using the concept of exponential decay/growth. We estimate the next number of access for the file.

Item Type: Book Section
Additional Information: Organized by Universiti Utara Malaysia, technical sponsor: IEEE Computer Society, Malaysia Section
Uncontrolled Keywords: Dynamic replication, Data Grid, Exponential decay/growth
Subjects: T Technology > TK Electrical engineering. Electronics Nuclear engineering
Divisions: College of Arts and Sciences
Depositing User: Prof. Ts. Dr. Suhaidi Hassan
Date Deposited: 20 Feb 2011 04:32
Last Modified: 20 Feb 2011 06:05

Actions (login required)

View Item View Item