ALGORITHM TO CHECK NETWORK STATES FOR DEADLOCK

被引：4

作者：

AHUJA, V

机构：

来源：

IBM JOURNAL OF RESEARCH AND DEVELOPMENT | 1979年 / 23卷 / 01期

关键词：

Compendex;

D O I：

10.1147/rd.231.0082

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

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 left bracket m plus n**2 right bracket operations, where m and n are, respectively, the number of tasks and nodes in the state. (

引用

页码：82 / 86

页数：5

共 9 条

[1]

AHUJA V, 1976, 29160 IBM SYST COMM

[2]

AHUJA V, 1978, TRENDS APPLICATIONS

[3]

AHUJA V, UNPUBLISHED

[4]

AHUJA V, 1976, THESIS U N CAROLINA

[5]

Coffman Jr E. G., 1973, OPERATING SYSTEMS TH

[6] CONTROL OF CONGESTION IN PACKET-SWITCHING NETWORKS [J].

DAVIES, DW .

IEEE TRANSACTIONS ON COMMUNICATIONS, 1972, CO20 (03) :546-&

[7] FLOW CONTROL IN A RESOURCE-SHARING COMPUTER NETWORK [J].

KAHN, RE ;

CROWTHER, WR .

IEEE TRANSACTIONS ON COMMUNICATIONS, 1972, CO20 (03) :539-&

[8]

KLEINROCK L, 1976, QUEUING SYSTEM, V2

[9]

RAUBOLD E, 1976, 3RD P INT C COMP COM, P483

← 1 →