{"id":{"repo_id":"uiuc","oai_identifier":"oai:www.ideals.illinois.edu:2142/69557"},"canonical_url":"https://search.dev.ndltd.org/etd/uiuc/oai:www.ideals.illinois.edu:2142/69557","repository":{"repo_id":"uiuc","name":"University of Illinois - Urbana-Champaign","base_url":"https://www.ideals.illinois.edu/oai-pmh"},"display":{"title":"Distributed Deadlock Detection for Communicating Processes (Operating Systems)","abstract":"216 p.","abstract_html":"216 p.","abstract_has_math":false,"creators":["Adams, Richard Arthur"],"institution":"University of Illinois at Urbana-Champaign","degree_name":"Ph.D.","degree_level":"Dissertation","degree_discipline":"Computer Science","degree_department":null,"school":null,"contributors":[],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2014,"date_issued":"2014-12-15T19:25:46Z","date_published":"2014-12-15T19:25:46Z","updated_at":"2026-07-22T22:26:01Z","subjects":["Computer Science"],"languages":[],"rights":[],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier","label":"Identifier","values":["(UMI)AAI8701425"],"render_values":[{"text":"(UMI)AAI8701425","href":null,"code":true}]}]},"links":{"outbound_url":"http://hdl.handle.net/2142/69557","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:creator","label":"Author","values":["Adams, Richard Arthur"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2014-12-15T19:25:46Z","10000-01-01","1986"]},{"key":"dc:type","label":"Dc Type","values":["text"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Computer Science"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Dissertation"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Ph.D."]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["University of Illinois at Urbana-Champaign"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Computer Science"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["http://hdl.handle.net/2142/69557","(UMI)AAI8701425"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["216 p.","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.","Made available in DSpace on 2014-12-15T19:25:46Z (GMT). No. of bitstreams: 1 8701425.pdf: 6250045 bytes, checksum: 600069521b7c486909e31e47f9ebd279 (MD5) Previous issue date: 1986","Embargo set by: Seth Robbins for item 69723 Lift date: Forever Reason: Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","U of I Only","Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1986."]},{"key":"dc:title","label":"Title","values":["Distributed Deadlock Detection for Communicating Processes (Operating Systems)"]}]}],"canonical_facts":{"dc:creator":["Adams, Richard Arthur"],"dc:date":["2014-12-15T19:25:46Z","10000-01-01","1986"],"dc:description":["216 p.","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.","Made available in DSpace on 2014-12-15T19:25:46Z (GMT). No. of bitstreams: 1 8701425.pdf: 6250045 bytes, checksum: 600069521b7c486909e31e47f9ebd279 (MD5) Previous issue date: 1986","Embargo set by: Seth Robbins for item 69723 Lift date: Forever Reason: Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","U of I Only","Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1986."],"dc:identifier":["http://hdl.handle.net/2142/69557","(UMI)AAI8701425"],"dc:subject":["Computer Science"],"dc:title":["Distributed Deadlock Detection for Communicating Processes (Operating Systems)"],"dc:type":["text"],"thesis:degree_discipline":["Computer Science"],"thesis:degree_level":["Dissertation"],"thesis:degree_name":["Ph.D."],"thesis:institution_name":["University of Illinois at Urbana-Champaign"]},"updated_at":"2026-07-22T22:26:01Z"}