Title: Managing data using neighbour replication on a triangular-grid structure

Authors: Mustafa Mat Deris, Jemal H. Abawajy, David Taniar, Ali Mamat

Addresses: Faculty of Information Technology and Multimedia, College University Technology Tun Hussein Onn, Batu Pahat, Johor, 86400, Malaysia. ' School of Information Technology, Deakin University, Geelong, Victoria, Australia. ' Clayton School of Information Technology, Monash University, Clayton, Victoria, 3800, Australia. ' Faculty of Computer Science and Information Technology, University Putra Malaysia, Serdang, Selangor, 43400, Malaysia

Abstract: Data in grid research deals with storage, replication, and management of large data sets in a distributed environment. The all-data-to-all-sites replication schemes, like Read-One Write-All (ROWA) and Tree Grid Structure (TGS), are the popular techniques in grid. However, these techniques have a weakness in data storage capacity and data access times. In this paper, we propose the all-data-to-some-sites scheme called the |Neighbour Replication on Triangular Grid| (NRTG) technique. The proposed scheme minimises the storage capacity as well as data access time with high update availability. It also tolerates failures such as server and site failures.

Keywords: grid databases; data replication; triangular grid; storage capacity; neighbourhood replication; grid computing; data access time.

DOI: 10.1504/IJHPCN.2009.026292

International Journal of High Performance Computing and Networking, 2009 Vol.6 No.1, pp.56 - 65

Available online: 05 Jun 2009 *

Full-text access for editors Access for subscribers Purchase this article Comment on this article