Toggle Main Menu Toggle Search

Open Access padlockePrints

Guaranteed Deadlock Recovery: Deadlock Resolution with Rollback Propagation

Lookup NU author(s): Professor Alexander Romanovsky

Downloads


Abstract

Traditionally, deadlock resolution is performed by simply aborting any process or the lowest-priority process (called the victim) involved in a deadlock cycle. In message-passing applications where rollback propagation due to message dependencies is possible, the rollback of the victim may require other processes to roll back as well, and the restarted processes may get into the same deadlock again. We introduce the concept of guaranteed deadlock recovery which guarantees that a broken deadlock cycle will not be re-formed after the rollback, and show how to achieve this by carefully selecting the victim based on run-time dependency information. We also demonstrate a technique to incorporate a dynamic priority scheme into a distributed deadlock detection algorithm to perform guaranteed deadlock recovery.


Publication metadata

Author(s): Wang Y-M, Merritt MJ, Romanovsky A

Publication type: Report

Publication status: Published

Series Title: Department of Computing Science Technical Report Series

Year: 1998

Pages: 21

Report Number: 648

Institution: Department of Computing Science, University of Newcastle upon Tyne

Place Published: Newcastle upon Tyne

URL: http://www.cs.ncl.ac.uk/publications/trs/papers/648.pdf


Share