Neighbour Replication on Grid Deadlock Detection Framework

Zin, Noriyani Mohd; Ahmad, Nesar; Fauzi, Ainul Azila Che

doi:10.1007/978-3-642-22603-8_32

Cited by 2 publications

(1 citation statement)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…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).…”

Section: Introductionmentioning

confidence: 99%

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%

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

Provide a New Mapping for Deadlock Detection and Resolution Modeling of Distributed Database to Colored Petri Net

Ghodrati¹,

Harounabadi²

2014

IJCA

View full text Add to dashboard Cite

One of the most important applications of distributed systems is enabling resource sharing between systems. In such environments, if a sequence of procedures to control resource allocation is not possible to create a deadlock exists. Deadlock problem for a distributed database system that uses locking as a concurrency control algorithm, as there are inherent. The following new rule for the modeling of the proposed method using colored Petri nets is presented. In the model proposed the new rules for mapping TWFG with colored Petri nets for modeling the deadlocks detection and resolve. Colored Petri net is considered one of the most widely used formal methods capable of modeling a wide variety of distributed systems are concurrent. A lot of work being done to define the concurrency execution of transactions in Petri nets is that none of these methods of communication with how mapping TWFG with colored Petri nets for modeling the deadlocks detection and resolve.

show abstract

Neighbour Replication on Grid Deadlock Detection Framework

Cited by 2 publications

References 6 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

Provide a New Mapping for Deadlock Detection and Resolution Modeling of Distributed Database to Colored Petri Net

Contact Info

Product

Resources

About