Managing transactions on grid-neighbour replication in distributed systems

Ahmad, Nesar; Deris, Mustafa Mat; Saman, Mohd Yazid; Norhayati, R.; Rabiei, Mohammad; Shuhadah, W. N.

doi:10.1080/00207160801965198

Cited by 11 publications

(9 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The researcher can know the latest issues that has been done by other researcher according to their fields of research such as method, technology, application and etc that has been used in enhancing the research fields. The concept of the computing grid arose from the need to share computing power, mostly for the jobs that use read only data sets as input (output from scientific experiments) (Noraziah et al, 2009;Radi et al, 2008). Consequently, the primary design of data management tools for grid computing was used to manage read-only data sets.…”

Section: Introductionmentioning

confidence: 99%

“…Neighbor Replication on Grid (NRG) considers only neighbors obtain a data copy where the neighbors are assigned with binary vote one and zero otherwise (Ahmad et al, 2010c;2010d). NRG requires significantly lower communication cost for an operation, while providing high system availability, due to the minimum number of quorum size required executing the transaction (Noraziah et al, 2009).…”

Section: Introductionmentioning

confidence: 99%

“…The new model namely Neighbor Replication Grid Deadlock Detection (NRDGG) (Zin et al, 2011b) is proposed to detect and solve the deadlock. NRGDD model is formed by combining the MultiCycle Deadlock Detection and Recovery (MC2DR) algorithm (Razzaque et al, 2007) and Neighbor Replication on Grid (NRG) replication model (Noraziah et al, 2009). NRG has been proposed in our previous work.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Solving Two Deadlock Cycles through Neighbor Replication on Grid Deadlock Detection Model

Zin¹,

Adzhar²,

Abdalla³

et al. 2012

Journal of Computer Science

View full text Add to dashboard Cite

Abstract:A data grid is compose of hundreds of geographically distributed computers and storage resources usually locate under different places and enables users to share data and other resources. Problem statement: Data replication is one of the mechanisms in managing data grid architecture that receive particular attention since it can provide efficient access to data, fault tolerance, reduce access latency and also can enhance the performance of the system. However, during transaction deadlock may occur that can reduce the throughput by minimizing the available resources, so it becomes an important resource management problem in distributed systems. Approach: The Neighbor Replication on Grid Deadlock Detection (NRGDD) transaction model has been developed to handle two deadlock cycle problems on grid. By deploying this method, the transactions communicate with each other by passing the probe messages. The victim message has been used to detect the deadlock when the number of waiting resource by other transaction is highest and become as the cause of deadlock occurs. In addition, this transaction must be aborted to solve the problem. Results: NRGDD transaction model are able to detect and solve more than one cycle of deadlocks. Conclusion: NRGDD has resolve the deadlock problem by sending the minimum number of probes message to detect the deadlock and it can resolve the deadlock to ensure the transaction can be done smoothly.

show abstract

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Solving Two Deadlock Cycles through Neighbor Replication on Grid Deadlock Detection Model

Zin¹,

Adzhar²,

Abdalla³

et al. 2012

Journal of Computer Science

View full text Add to dashboard Cite

show abstract

“…There are many examples of replication schemes in distributed file and database systems. Among them are based on synchronous replication [6,7,8] , which deploy quorum to execute the operations with high degree of consistency and ensure serializability. Synchronous replication can be categorized into several schemes, i.e., all -data-to-all-sites (full replication) and some-dataitems-to-all-sites.…”

Section: Introductionmentioning

confidence: 99%

Utility of Certain Î Acceptors for Spectrophotometric Determination of Sildenafil Citrate

Al-Shaalan¹

2007

American J. of Applied Sciences

View full text Add to dashboard Cite

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

“…Among them are based on synchronous replication (Holliday et al, 2003;Stockinger, 2001;Noraziah et al, 2006), which deploy quorum to execute the operations with high degree of consistency and ensure serializability. Synchronous replication can be categorized into several schemes, i.e., all -data-to-all-sites (full replication) and some-dataitems-to-all-sites.…”

Section: Introductionmentioning

confidence: 99%

Data Replication Using Read-One-Write-All Monitoring Synchronization Transaction System in Distributed Environment

Ahmad¹

2010

Journal of Computer Science

View full text Add to dashboard Cite

Nowadays, the demand of transmitted information over networks increase rapidly and the demand for steady bandwidth seems to be out of control. Particularly organizations need to provide updated data to users that might be geographically remote and handling a vast amount of requested data distributed in multiple sites. Problem statement: Replication in distributed environment has become increasingly popular due to its high degree of availability, fault tolerance and enhance the performance of a system. These advantages of replication are important because it enables organizations to provide users with access to current data anytime or anywhere even if the users are geographically remote. However, this way of data organization also introduces low data consistency among replicas when changes are made during transactions. The need to have a system to monitor this data replication arises. Approach: Read-One-Write-All Monitoring Synchronization Transaction System (ROWA-MSTS) has been developed to solve this problem by using Rapid Application Development (RAD). Results: ROWA-MSTS helped to monitor the replicated data distribution over multiple sites while maintaining the data consistency. Conclusion: Results showed that ROWA-MSTS solved the distributed concurrency transactions and guarantees the data consistency in distributed systems.

show abstract

Managing transactions on grid-neighbour replication in distributed systems

Cited by 11 publications

References 8 publications

Solving Two Deadlock Cycles through Neighbor Replication on Grid Deadlock Detection Model

Solving Two Deadlock Cycles through Neighbor Replication on Grid Deadlock Detection Model

Utility of Certain Î Acceptors for Spectrophotometric Determination of Sildenafil Citrate

Data Replication Using Read-One-Write-All Monitoring Synchronization Transaction System in Distributed Environment

Contact Info

Product

Resources

About