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). © Springer-Verlag Berlin Heidelberg 2006.
CITATION STYLE
Mamat, A., Mat Deris, M., Abawajy, J. H., & Ismail, S. (2006). Managing data using neighbor replication on triangular-grid structure. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3994 LNCS-IV, pp. 1071–1077). Springer Verlag. https://doi.org/10.1007/11758549_142
Mendeley helps you to discover research relevant for your work.