DocumentCode
3040591
Title
An algorithm for preventing deadlocks in distributed systems
Author
Datta, Ajoy Kumar ; Javagal, Ramesh Dutt ; Ghosh, Sukumar
Author_Institution
Dept. of Comput. Sci., Nevada Univ., Las Vegas, NV, USA
fYear
1992
fDate
1-3 April 1992
Firstpage
109
Lastpage
116
Abstract
The authors deal with a new method for preventing deadlocks in resource sharing for distributed systems. The algorithm is based on the notion of coloring the nodes of the waitfor graph and is built on a signaling mechanism which can be implemented on an underlying routing protocol. This algorithm supports multiple resources and multiple outstanding requests. The proof of correctness of the algorithm is also presented.<>
Keywords
concurrency control; distributed processing; resource allocation; deadlock prevention; distributed systems; resource sharing; routing protocol; waitfor graph; Cities and towns; Computer networks; Computer science; Distributed computing; Information science; Java; Probes; Resource management; Routing protocols; System recovery;
fLanguage
English
Publisher
ieee
Conference_Titel
Computers and Communications, 1992. Conference Proceedings., Eleventh Annual International Phoenix Conference on
Conference_Location
Scottsdale, AZ, USA
Print_ISBN
0-7803-0605-8
Type
conf
DOI
10.1109/PCCC.1992.200545
Filename
200545
Link To Document