UPM Institutional Repository

Managing data using neighbor replication on a triangular-grid structure.


Citation

Mamat, Ali and Mat Deris, Mustafa and Abawajy, J. H. and Ismail, Suhaila (2009) Managing data using neighbor replication on a triangular-grid structure. International Journal of High Performance Computing and Networking, 6 (1). pp. 1071-1077. ISSN 1740-0562

Abstract

Data is one of the domains in grid research that deals with the storage, replication, and management of large data sets in a distributed environment. The all-data-to-all sites replication scheme such as read-one write-all and tree grid structure (TGS) are the popular techniques being used for replication and management of data in this domain. However, these techniques have its weaknesses in terms of data storage capacity and also data access times due to some number of sites must ‘agree’ in common to execute certain transactions. In this paper, we propose the all-data-to-some-sites scheme called the neighbor replication on triangular grid (NRTG) technique by considering only neighbors have the replicated data, and thus, minimizes the storage capacity as well as high update availability. Also, the technique tolerates failures such as server failures, site failure or even network partitioning using remote procedure call (RPC).


Download File

[img]
Preview
PDF (Abstract)
Managing data using neighbor replication on a triangular.pdf

Download (178kB) | Preview

Additional Metadata

Item Type: Article
Divisions: Faculty of Computer Science and Information Technology
Publisher: Inderscience Enterprises Ltd
Keywords: Grid databases; Data replication; Triangular-grid; Storage capacity; Neighborhood replication.
Depositing User: Ms. Nida Hidayati Ghazali
Date Deposited: 15 Jul 2013 01:20
Last Modified: 22 Oct 2015 23:55
URI: http://psasir.upm.edu.my/id/eprint/15538
Statistic Details: View Download Statistic

Actions (login required)

View Item View Item