Managing data using neighbour replication on a triangular-grid structure. (8th June 2009)

• Record Type: Journal Article
• Authors: Mat Deris, Mustafa; Abawajy, Jemal H.; Taniar, David; Mamat, Ali
• Is Part Of: International journal of high performance computing and networking. Volume 6:Number 1(2009)
• Page Start: 56
• Page End: 65
• Publication Date: 2009-06-08
• Subjects: grid databases -- data replication -- triangular grid -- storage capacity -- neighbourhood replication -- grid computing -- data access time; High performance computing -- Periodicals; Computer networks -- Periodicals; High performance computing; Periodicals; 004.05
• Languages: English
• ISSNs: 1740-0562

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.