A deadlock detection and recovery algorithm using the formalism of a directed graph matrix

  • Authors:
  • T. F. Leibfried

  • Affiliations:
  • University of Houston Clear Lake, Houston

  • Venue:
  • ACM SIGOPS Operating Systems Review
  • Year:
  • 1989

Quantified Score

Hi-index 0.00

Visualization

Abstract

A new method of detecting and resolving deadlocked processes in an operating system or database system is presented. It is based on matric theoretic principles and effectively automates tasks heretofore only achievable via adjacency list representations. Two algorithms are presented with examples for each.