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

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 pa...

Full description

Bibliographic Details
Main Authors:	Noriyani, Mohd Zin, Noraziah, Ahmad, Abdalla, Ahmed N., Ainul Azila, Che Fauzi
Format:	Article
Language:	English
Published:	Science Publications 2012
Subjects:	QA75 Electronic computers. Computer science
Online Access:	http://umpir.ump.edu.my/id/eprint/6610/ http://umpir.ump.edu.my/id/eprint/6610/ http://umpir.ump.edu.my/id/eprint/6610/ http://umpir.ump.edu.my/id/eprint/6610/1/JCS-Noriyani.pdf

id	ump-6610
recordtype	eprints
spelling	ump-66102018-10-03T07:41:17Z http://umpir.ump.edu.my/id/eprint/6610/ Solving Two Deadlock Cycles through Neighbor Replication on Grid Deadlock Detection Model Noriyani, Mohd Zin Noraziah, Ahmad Abdalla, Ahmed N. Ainul Azila, Che Fauzi QA75 Electronic computers. Computer science 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. Science Publications 2012 Article PeerReviewed application/pdf en http://umpir.ump.edu.my/id/eprint/6610/1/JCS-Noriyani.pdf Noriyani, Mohd Zin and Noraziah, Ahmad and Abdalla, Ahmed N. and Ainul Azila, Che Fauzi (2012) Solving Two Deadlock Cycles through Neighbor Replication on Grid Deadlock Detection Model. Journal of Computer Science, 8 (2). pp. 265-271. ISSN 1549-3636 http://dx.doi.org/10.3844/jcssp.2012.265.271 DOI: 10.3844/jcssp.2012.265.271
repository_type	Digital Repository
institution_category	Local University
institution	Universiti Malaysia Pahang
building	UMP Institutional Repository
collection	Online Access
language	English
topic	QA75 Electronic computers. Computer science
spellingShingle	QA75 Electronic computers. Computer science Noriyani, Mohd Zin Noraziah, Ahmad Abdalla, Ahmed N. Ainul Azila, Che Fauzi Solving Two Deadlock Cycles through Neighbor Replication on Grid Deadlock Detection Model
description	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.
format	Article
author	Noriyani, Mohd Zin Noraziah, Ahmad Abdalla, Ahmed N. Ainul Azila, Che Fauzi
author_facet	Noriyani, Mohd Zin Noraziah, Ahmad Abdalla, Ahmed N. Ainul Azila, Che Fauzi
author_sort	Noriyani, Mohd Zin
title	Solving Two Deadlock Cycles through Neighbor Replication on Grid Deadlock Detection Model
title_short	Solving Two Deadlock Cycles through Neighbor Replication on Grid Deadlock Detection Model
title_full	Solving Two Deadlock Cycles through Neighbor Replication on Grid Deadlock Detection Model
title_fullStr	Solving Two Deadlock Cycles through Neighbor Replication on Grid Deadlock Detection Model
title_full_unstemmed	Solving Two Deadlock Cycles through Neighbor Replication on Grid Deadlock Detection Model
title_sort	solving two deadlock cycles through neighbor replication on grid deadlock detection model
publisher	Science Publications
publishDate	2012
url	http://umpir.ump.edu.my/id/eprint/6610/ http://umpir.ump.edu.my/id/eprint/6610/ http://umpir.ump.edu.my/id/eprint/6610/ http://umpir.ump.edu.my/id/eprint/6610/1/JCS-Noriyani.pdf
first_indexed	2023-09-18T22:02:32Z
last_indexed	2023-09-18T22:02:32Z
_version_	1777414494024105984

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

Similar Items