Extended Sinha-Natarajan's algorithm for distributed deadlock detection and resolution in a distributed database system

In the recent years, the availability of databases and of computer networks gave rise to a new field: Distributed Database System. The primary motivation of using distributed database system is the possibility of resource sharing. If the sequence of resource allocation to processes is not controlled...

Full description

Saved in:
Bibliographic Details
Main Author: Ahmed, Tanweer
Format: text
Language:English
Published: Animo Repository 1993
Subjects:
Online Access:https://animorepository.dlsu.edu.ph/etd_masteral/1499
https://animorepository.dlsu.edu.ph/cgi/viewcontent.cgi?article=8337&context=etd_masteral
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: De La Salle University
Language: English
id oai:animorepository.dlsu.edu.ph:etd_masteral-8337
record_format eprints
spelling oai:animorepository.dlsu.edu.ph:etd_masteral-83372022-03-14T08:59:33Z Extended Sinha-Natarajan's algorithm for distributed deadlock detection and resolution in a distributed database system Ahmed, Tanweer In the recent years, the availability of databases and of computer networks gave rise to a new field: Distributed Database System. The primary motivation of using distributed database system is the possibility of resource sharing. If the sequence of resource allocation to processes is not controlled a deadlock may occur. Majority of the previous algorithms for deadlock detection are incorrect because of two reasons.1) They do not detect all existing deadlocks,2) They detect false deadlocks. This study will present a distributed deadlock detection algorithm and resolution in distributed database systems. A priority is assigned to each transaction to minimize the number of messages initiated for detection of deadlocks. It does not construct any transaction-wait-for (TWF) graph but detect cycles by an edge-chasing method. First an abstract model of DDBS will be presented. The algorithm will then be formulated for deadlock detection. A proof of correctness will be conducted for the validation of the algorithm. 1993-01-01T08:00:00Z text application/pdf https://animorepository.dlsu.edu.ph/etd_masteral/1499 https://animorepository.dlsu.edu.ph/cgi/viewcontent.cgi?article=8337&context=etd_masteral Master's Theses English Animo Repository Algorithms Electronic data processing--Distributed processing Database management Computer programming Databases and Information Systems Data Storage Systems Digital Communications and Networking Numerical Analysis and Scientific Computing Theory and Algorithms
institution De La Salle University
building De La Salle University Library
continent Asia
country Philippines
Philippines
content_provider De La Salle University Library
collection DLSU Institutional Repository
language English
topic Algorithms
Electronic data processing--Distributed processing
Database management
Computer programming
Databases and Information Systems
Data Storage Systems
Digital Communications and Networking
Numerical Analysis and Scientific Computing
Theory and Algorithms
spellingShingle Algorithms
Electronic data processing--Distributed processing
Database management
Computer programming
Databases and Information Systems
Data Storage Systems
Digital Communications and Networking
Numerical Analysis and Scientific Computing
Theory and Algorithms
Ahmed, Tanweer
Extended Sinha-Natarajan's algorithm for distributed deadlock detection and resolution in a distributed database system
description In the recent years, the availability of databases and of computer networks gave rise to a new field: Distributed Database System. The primary motivation of using distributed database system is the possibility of resource sharing. If the sequence of resource allocation to processes is not controlled a deadlock may occur. Majority of the previous algorithms for deadlock detection are incorrect because of two reasons.1) They do not detect all existing deadlocks,2) They detect false deadlocks. This study will present a distributed deadlock detection algorithm and resolution in distributed database systems. A priority is assigned to each transaction to minimize the number of messages initiated for detection of deadlocks. It does not construct any transaction-wait-for (TWF) graph but detect cycles by an edge-chasing method. First an abstract model of DDBS will be presented. The algorithm will then be formulated for deadlock detection. A proof of correctness will be conducted for the validation of the algorithm.
format text
author Ahmed, Tanweer
author_facet Ahmed, Tanweer
author_sort Ahmed, Tanweer
title Extended Sinha-Natarajan's algorithm for distributed deadlock detection and resolution in a distributed database system
title_short Extended Sinha-Natarajan's algorithm for distributed deadlock detection and resolution in a distributed database system
title_full Extended Sinha-Natarajan's algorithm for distributed deadlock detection and resolution in a distributed database system
title_fullStr Extended Sinha-Natarajan's algorithm for distributed deadlock detection and resolution in a distributed database system
title_full_unstemmed Extended Sinha-Natarajan's algorithm for distributed deadlock detection and resolution in a distributed database system
title_sort extended sinha-natarajan's algorithm for distributed deadlock detection and resolution in a distributed database system
publisher Animo Repository
publishDate 1993
url https://animorepository.dlsu.edu.ph/etd_masteral/1499
https://animorepository.dlsu.edu.ph/cgi/viewcontent.cgi?article=8337&context=etd_masteral
_version_ 1728621143632379904