Managing Data Using Neighbor Replication on Triangular-Grid Structure
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).
KeywordsSystem Availability Server Failure Transaction Manager Remote Procedure Call Replica Management
- 2.Holliday, J., Steinke, R., Agrawal, D., El-Abbadi, A.: Apidemic Algorithms for Replicated Databases. IEEE Trans. on Know. and Data Engineering 15(3), 1–21 (2003)Google Scholar
- 3.Stockinger, H.: Distributed Database Management Systems and The Data Grid. In: IEEE-NASA Symposium, April 2001, pp. 1–12 (2001)Google Scholar
- 6.Mat Deris, M., Abawajy, J.H., Suzuri, H.M.: An Efficient Replicated Data Access Approach for Large Scale Distributed Systems. In: IEEE/ACM Conf. on Cluster Computing and Grid (CCGRID 2004), Chicago, USA (April 2004)Google Scholar
- 10.Stockinger, H., Donno, F., Laure, E., Muzaffar, S., Kunszt, P.: Grid Data Management in Action: Experience in Running and Supporting Data Management Services in the EU Data Grid Project. In: Int’l. Conf. on Computing in High Energy and Nuclear Physics, La Jolla, California (March 2003), http://gridpp.ac.uk/papers/chap3-TUAT007.pdf