Performance study of distributed deadlock detection algorithms for distributed database systems

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.

Name thesis:degree_name

Ph.D.

Level thesis:degree_level

Dissertation

Discipline thesis:degree_discipline

Computer Science

Grantor

University of Illinois at Urbana-Champaign

Year dc:date

2011

Author dc:creator

• Min, Kyungoh

Contributors dc:contributor

• Belford, Geneva G.

• Computer Science

Statement dc:rights

• Copyright 1990 Min, Kyungoh

Language dc:language

eng

Identifier

AAI9021729
(UMI)AAI9021729

OAI identifier oai:identifier

oai:www.ideals.illinois.edu:2142/20722