Binary vote assignment on a grid for efficient access of replicated data

Deris, Mustafa Mat; Evans, David; Saman, Mohd Yazid; Ahmad, Nesar

doi:10.1080/00207160310001620777

Cited by 15 publications

(13 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…To simplify a clearer presentation of these experiments, assume that the transactions come to access particular data file a. Neighbor binary voting assignment [2] is initiated where S(B a ) = {i| B a (i) = 1, 1≤i ≤n} and B a (i) is the vote assign to site i, which has a particular data a. Hence, B a (A) = B a (B) = B a (D) = 1 with S(B a ) = {A,B,D}.…”

Section: Resultsmentioning

confidence: 99%

“…In modern distributed systems, replication receives particular attention for providing high data availability, fault tolerance and enhance the performance of the system [1,2,3] . It is an important mechanism because it enables organizations to provide users with access to current data where and when they need it.…”

Section: Introductionmentioning

confidence: 99%

“…NRG daemon guarantees data consistency and obey serializability through the synchronize replication. The mechanisms for locating and managing replicas, as well as performance details can be found in our previous work [2,8] .…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Preserving Data Consistency through Neighbor Replication on Grid Daemon

Ahmad¹,

Deris²,

Ahmed³

et al. 2007

American J. of Applied Sciences

Self Cite

View full text Add to dashboard Cite

Abstract:In modern distributed systems, replication receives particular attention for providing high data availability, fault tolerance and enhance the performance of the system. It is an important mechanism because it enables organizations to provide users with access to current data where and when they need it. However, this way of data organization introduces low data consistency and data coherency as more than one replicated copies need to be updated. Expensive synchronization mechanisms are needed to maintain the consistency and integrity of data among replicas when changes are made by the transactions. In this paper, we present Neighbor Replication on Grid (NRG) daemon in order to manage replication and transactions in distributed system. NRG Transaction Model has been implemented in order to preserve the data consistency and availability. Based on experiment and result, it shows that NRG daemon guarantees consistency and obey serializability through the synchronization approach.

show abstract

Section: Resultsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Preserving Data Consistency through Neighbor Replication on Grid Daemon

Ahmad¹,

Deris²,

Ahmed³

et al. 2007

American J. of Applied Sciences

Self Cite

View full text Add to dashboard Cite

show abstract

“…There are some research been done for replica control protocol in distributed database and grid such as Read-One Write-All (ROWA) [7], Voting (VT) [8], Tree Quorum (TQ) [9,10], Grid Configuration (GC) [11,12], and the latest research in year 2007 is Neighbor Replication on Grid (NRG) [13,14,15]. Each protocol has its own way of optimizing the data availability.…”

Section: Introductionmentioning

confidence: 99%

Quorum-based Data Replication in Grid Environment

Latip¹,

Othman²,

Abdullah³

et al. 2009

IJCIS

View full text Add to dashboard Cite

Replication is a useful technique for distributed database systems and can be implemented in a grid computation environment to provide a high availability, fault tolerant, and enhance the performance of the system. This paper discusses a new protocol named Diagonal Data Replication in 2D Mesh structure (DR2M) protocol where the performance addressed are data availability which is compared with the previous replication protocols, Read-One Write-All (ROWA), Voting (VT), Tree Quorum (TQ), Grid Configuration (GC), and Neighbor Replication on Grid (NRG). DR2M protocol is organized in a logical two dimensional mesh structure and by using quorums and voting techniques to improve the performance and availability of the replication protocol where it reduce the number of copies of data replication for read or write operations. The data file is copied at the selected node of the diagonal site in a quorum. The selection of a replica depends on the diagonal location of the structured two dimensional mesh quorum where the middle node is selected because it is the best location to get a copy of the data if every node has the equal number of request and data accessing in the network. The algorithm in this paper also calculates the best number of nodes in each quorum and how many quorums are needed for N number of nodes in a network. DR2M protocol also ensures that the data for read and write operations is consistency, by proofing the quorum must not have a nonempty intersection quorum. To evaluate DR2M protocol, we developed a simulation model in Java. Our results prove that DR2M protocol improves the performance of the data availability compare to the previous data replication protocol, ROWA, VT, TQ, GC and NRG.

show abstract

“…Quorums improved the performance of fault tolerant and availability of data (Mat Deris, 2003;Mat Deris, 2004;Yu, 1997). Quorums reduce the number of copies for reading or writing data.…”

Section: Introductionmentioning

confidence: 99%

Computer and Information Science, Vol. 1, No. 2, May 2008, all in one file

CIS¹

2008

CIS

View full text Add to dashboard Cite

Binary vote assignment on a grid for efficient access of replicated data

Cited by 15 publications

References 8 publications

Preserving Data Consistency through Neighbor Replication on Grid Daemon

Preserving Data Consistency through Neighbor Replication on Grid Daemon

Quorum-based Data Replication in Grid Environment

Computer and Information Science, Vol. 1, No. 2, May 2008, all in one file

Contact Info

Product

Resources

About