A performance study of deadlock resolution in distributed systems

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.

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

• Boeheim, Chidori Kawamura

Contributors dc:contributor

• Belford, Geneva G.

• Artificial Intelligence
• Computer Science

Statement dc:rights

• Copyright 1991 Boeheim, Chidori Kawamura

Language dc:language

eng

Identifier

AAI9136547
(UMI)AAI9136547

OAI identifier oai:identifier

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