Performance study of distributed deadlock detection algorithms for distributed database systems
Min, Kyungoh
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/20722
Description
Title
Performance study of distributed deadlock detection algorithms for distributed database systems
Author(s)
Min, Kyungoh
Issue Date
1990
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)
Computer Science
Language
eng
Abstract
Distributed deadlock in a distributed database system is a system state in which a set of concurrently running transactions are circularly waiting for each other to release resources. Over the past decade a number of algorithms have been proposed in the literature to detect such a deadlock, but not much attention has been given to their performance. Lack of understanding of the workload for such distributed algorithms has made it difficult to predict their performance prior to actually implementing them on a distributed system.
In this thesis, we present an approach to distributed workload analysis which can be used as a basis for the performance study of distributed deadlock detection algorithms. In particular, the expected number of times a deadlock detection algorithm is locally initiated and the subsequent number of remote invocations are derived. Simulation work was done to validate our approach.
For the performance analysis of distributed deadlock detection algorithms, we introduce three performance measures and explain how we can analytically derive them for a given system configuration. Then, we discuss some limitations of our approach and present the alternatives we took to study the performance of distributed deadlock detection algorithms using the results of the workload analysis. Finally, results from the analysis are validated using the results from the simulations and we compare the performance of two representative algorithms.
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.
