Algorithm to check network states for deadlock

  • Authors:

  • V. Ahuja

  • Affiliations:

  • IBM System Communications Division laboratory, Research Triangle Park, North Carolina

  • Venue:
  • IBM Journal of Research and Development
  • Year:
  • 1979

Quantified Score

Hi-index 0.00

Visualization

Abstract

The problem of checking the states of a system for deadlock is treated for a single class of system, or networks, and for a single class of resources, or buffers. An algorithm is described that, for a given state, requires O[m + n2] operations, where m and n are, respectively, the number of tasks and nodes in the state. (In general, m is greater than n.)