DETERMINING DEADLOCK EXPOSURE FOR A CLASS OF STORE AND FORWARD COMMUNICATION-NETWORKS

被引：3

作者：

AHUJA, V

机构：

来源：

关键词：

D O I：

10.1147/rd.241.0049

中图分类号：

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

学科分类号：

0812 ;

摘要：

引用

页码：49 / 55

页数：7

共 13 条

[1] ALGORITHM TO CHECK NETWORK STATES FOR DEADLOCK [J].

AHUJA, V .

[2]

AHUJA V, 1976, THESIS U N CAROLINA

[3]

[Anonymous], 1970, SOVIET MATH DOKL

[4]

Busacker R.G., 1965, FINITE GRAPHS NETWOR

[5]

Coffman E. G., 1971, COMPUT SURV, V3, P67, DOI DOI 10.1145/356586.356588

[6] PATHS TREES AND FLOWERS [J].

EDMONDS, J .

CANADIAN JOURNAL OF MATHEMATICS, 1965, 17 (03) :449-&

[7]

Ford Lester R., 1962, FLOWS NETWORKS

[8] PREVENTION OF SYSTEM DEADLOCKS [J].

HABERMANN, AN .

[9]

HOLT RC, 1971, THESIS CORNELL U

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

KAHN, RE ;

CROWTHER, WR .