A performance study of deadlock resolution in distributed systems
Boeheim, Chidori Kawamura
This item is only available for download by members of the University of Illinois community. Students, faculty, and staff at the U of I may log in with your NetID and password to view the item. If you are trying to access an Illinois-restricted dissertation or thesis, you can request a copy through your library's Inter-Library Loan office or purchase a copy directly from ProQuest.
Permalink
https://hdl.handle.net/2142/20480
Description
Title
A performance study of deadlock resolution in distributed systems
Author(s)
Boeheim, Chidori Kawamura
Issue Date
1991
Doctoral Committee Chair(s)
Belford, Geneva G.
Department of Study
Computer Science
Discipline
Computer Science
Degree Granting Institution
University of Illinois at Urbana-Champaign
Degree Name
Ph.D.
Degree Level
Dissertation
Keyword(s)
Artificial Intelligence
Computer Science
Language
eng
Abstract
Distributed deadlock is a state where there exists among some processes running on different computers a cyclic wait to acquire some resources such that no process can proceed. Since a deadlock is a state that persists unless it is solved by some method, and the number and size of deadlocks increase substantially as the concurrency level or number of sites in a distributed system grows, we need an efficient approach to solve this problem.
Distributed deadlock resolution consists of choosing a victim, aborting and restarting it. There has been no detailed study of resolution, despite the fact that deadlock detection does not complete its task without resolution. The performance analysis of different resolution strategies that have been proposed and new approaches for distributed deadlock resolution are the subject of this study.
Different heuristic strategies (rules) to choose victims to break deadlocks are discussed and the direct and indirect goals that the rules were hypothesized to achieve are described. Various simulation runs (experiments) were conducted to analyze in depth the performance of the rules. The system throughput and the overhead of running the rules are evaluated and the effectiveness of each rule in achieving its goals are compared.
The assessment of each rule under different system conditions is used to evaluate the possibility of incorporating more than one rule in deadlock resolution. This leads to the suggestion for use of a first-principles expert system to monitor and diagnose distributed systems, including the resolution of problems such as deadlocks. The rule base of such an expert system would include rules to choose the optimum victim to resolve a distributed deadlock.
Use this login method if you
don't
have an
@illinois.edu
email address.
(Oops, I do have one)
IDEALS migrated to a new platform on June 23, 2022. If you created
your account prior to this date, you will have to reset your password
using the forgot-password link below.
