The problem of checking the states of a system for deadlock is treated for a single class of systems, 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.)
Note: The Institute of Electrical and Electronics Engineers, Incorporated is distributing this Article with permission of the International Business Machines Corporation (IBM) who is the exclusive owner. The recipient of this Article may not assign, sublicense, lease, rent or otherwise transfer, reproduce, prepare derivative works, publicly display or perform, or distribute the Article.