Date of Publication

1993

Document Type

Master's Thesis

Degree Name

Master of Science in Computer Science

Subject Categories

Databases and Information Systems | Data Storage Systems | Digital Communications and Networking | Numerical Analysis and Scientific Computing | Theory and Algorithms

College

College of Computer Studies

Department/Unit

Computer Science

Thesis Adviser

Mitch Andaya

Defense Panel Chair

Manuel Lopez

Defense Panel Member

Kelsey Hartigan Go
Roshan Tarar

Abstract/Summary

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.

Abstract Format

html

Language

English

Format

Print

Accession Number

TG02155

Shelf Location

Archives, The Learning Commons, 12F Henry Sy Sr. Hall

Physical Description

116 leaves

Keywords

Algorithms; Electronic data processing--Distributed processing; Database management; Computer programming

Upload Full Text

wf_yes

Download

Share

COinS