COMPLEXITY OF NETWORK SYNCHRONIZATION

被引：369

作者：

AWERBUCH, B

机构：

[1] MIT, Lab for Computer Science,, Cambridge, MA, USA, MIT, Lab for Computer Science, Cambridge, MA, USA

来源：

JOURNAL OF THE ACM | 1985年 / 32卷 / 04期

关键词：

All Open Access; Bronze;

D O I：

10.1145/4221.4227

中图分类号：

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

学科分类号：

0812 ;

摘要：

COMPUTER NETWORKS

引用

页码：804 / 823

页数：20

共 12 条

[1] EFFICIENCY OF SYNCHRONOUS VERSUS ASYNCHRONOUS DISTRIBUTED SYSTEMS [J].

ARJOMANDI, E ;

FISCHER, MJ ;

LYNCH, NA .

JOURNAL OF THE ACM, 1983, 30 (03) :449-456

[2]

AWERBUCH B, UNPUB NETWORKS

[3]

Bollobas B., 1978, EXTREMAL GRAPH THEOR

[4]

ECKSTEIN D, 1977, THESIS U IOWA IOWA C

[5]

Even S., 1979, GRAPH ALGORITHMS

[6] A DISTRIBUTED ALGORITHM FOR MINIMUM-WEIGHT SPANNING-TREES [J].

GALLAGER, RG ;

HUMBLET, PA ;

SPIRA, PM .

ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS, 1983, 5 (01) :66-77

[7]

GALLAGER RG, 1982, LIDSP1175 MIT TECH R

[8] TIME, CLOCKS, AND ORDERING OF EVENTS IN A DISTRIBUTED SYSTEM [J].

LAMPORT, L .

COMMUNICATIONS OF THE ACM, 1978, 21 (07) :558-565

[9] SYNCHRONIZATION IN DISTRIBUTED PROGRAMS [J].

SCHNEIDER, FB .

ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS, 1982, 4 (02) :125-148

[10] DISTRIBUTED NETWORK PROTOCOLS [J].

SEGALL, A .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1983, 29 (01) :23-35

← 1 2 →