IMPLICIT COMPUTATION OF SYNCHRONIZATION PRIMITIVES

被引：2

作者：

DEMILLO, RA

MILLER, RE

机构：

[1] School of Information and Computer Science, Georgia Institute of Technology, Atlanta

[2] Mathematical Sciences Department, IBM T.J. Watson Research Center, Yorktown Heights

来源：

基金：

美国国家科学基金会;

关键词：

complexity; Loosely connected processes; synchronization;

D O I：

10.1016/0020-0190(79)90105-4

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

[No abstract available]

引用

页码：35 / 38

页数：4

共 7 条

[1]

Aho, Hopcroft, Ullman, The Design and Analysis of Computer Algorithms, (1974)

[2]

Hansen, The Architecture of Concurrent Programs, (1977)

[3]

Gold, Deadlock prediction easy and difficult cases, SIAM Journal on Computing, 7, pp. 320-336, (1978)

[4]

Habermann, Introduction to Operating System Design, (1976)

[5]

Karp, Miller, Parallel program schemata, J. Comput. System Sci., 3, pp. 147-195, (1969)

[6]

Lipton, Reduction: a method of proving properties of parallel programs, Comm. ACM, 18, pp. 717-721, (1975)

[7]

Lipton, On synchronization primitive systems, Ph.D. Thesis, (1973)