Neighbour replication on grid deadlock detection framework
Data grid is a distributed computing architecture that integrates a large number of data and computing resources into a single virtual data management system. It coordinated the data from several of resources and enables the sharing of the data. In handling and managing data grid some of problems mu...
Saved in:
Main Authors: | , , |
---|---|
Format: | Conference or Workshop Item |
Language: | English |
Published: |
Springer, Berlin, Heidelberg
2011
|
Subjects: | |
Online Access: | http://umpir.ump.edu.my/id/eprint/26137/1/Neighbour%20replication%20on%20grid%20deadlock%20detection%20framework.pdf http://umpir.ump.edu.my/id/eprint/26137/ https://doi.org/10.1007/978-3-642-22603-8_32 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Summary: | Data grid is a distributed computing architecture that integrates a large number of data and computing resources into a single virtual data management system. It coordinated the data from several of resources and enables the sharing of the data. In handling and managing data grid some of problems must be considered such as reliability and availability of the data to the user access, network latency, failures or malicious attacks during execution and etc. These problems can overcome by using replication technique. The data will replicate into several sites. If one of the sites has fail, it will fail independently and not affect to others node. The deadlock is the most important problem that must be manages when sharing any data in data grids. Furthermore, it can reduce the throughput by minimizing the available resources, so it becomes an important resource management problem in distributed systems. In this paper, we propose Neighbour Replication Grid Deadlock Detection (NRGDD) framework to detect the deadlock during transaction occur in Neighbour Replication on Grid replication model. Based on this framework it shows how the deadlock can be detected. |
---|