Files in this item

FilesDescriptionFormat

application/pdf

application/pdf8701425.pdf (6MB)Restricted to U of Illinois
(no description provided)PDF

Description

Title:Distributed Deadlock Detection for Communicating Processes (Operating Systems)
Author(s):Adams, Richard Arthur
Department / Program:Computer Science
Discipline:Computer Science
Degree Granting Institution:University of Illinois at Urbana-Champaign
Degree:Ph.D.
Genre:Dissertation
Subject(s):Computer Science
Abstract:In a distributed system where processes communicate directly, deadlock among a set P of processes occurs when all processes in P are idle waiting for messages from other processes in P in order to start execution, but there are no messages in transit between them. For a process which suspects that it may be deadlocked to determine whether it is indeed deadlocked, it is necessary for it to query other processes. Chandy, Misra, and Haas have proposed a distributed deadlock detection algorithm which uses fixed-length queries and replies. According to this algorithm, a process which suspects it may be deadlocked initiates a query computation by querying each process from which it is waiting to receive a message. If the initiator receives one reply for each query sent out, then the initiator is deadlocked. Otherwise, if the initiator has not received all replies within a timeout period T, it assumes that it is not deadlocked. In this thesis, five algorithms which use variable-length queries and replies to detect deadlock are presented. Instead of using timeout to indicate an absence of deadlock, these algorithms use explicit messages called informs to convey the absence of deadlock to the initiator of a query computation. One of the algorithms detects a deadlock if it existed when the query computation was initiated. The other algorithms will detect deadlock as deadlock conditions develop. Proofs of correctness are provided for the algorithms, along with a simulation study which compares the performance of the new algorithms with that of the algorithm by Chandy, Misra, and Haas.
Issue Date:1986
Type:Text
Description:216 p.
Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1986.
URI:http://hdl.handle.net/2142/69557
Other Identifier(s):(UMI)AAI8701425
Date Available in IDEALS:2014-12-15
Date Deposited:1986


This item appears in the following Collection(s)

Item Statistics