AN OPTIMAL SYNCHRONIZER FOR THE HYPERCUBE

被引:200
作者
PELEG, D [1 ]
ULLMAN, JD [1 ]
机构
[1] STANFORD UNIV,DEPT COMP SCI,STANFORD,CA 94305
关键词
D O I
10.1137/0218050
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
引用
收藏
页码:740 / 747
页数:8
相关论文
共 10 条
[1]   REDUCING COMPLEXITIES OF THE DISTRIBUTED MAX-FLOW AND BREADTH-1ST-SEARCH ALGORITHMS BY MEANS OF NETWORK SYNCHRONIZATION [J].
AWERBUCH, B .
NETWORKS, 1985, 15 (04) :425-437
[2]   COMPLEXITY OF NETWORK SYNCHRONIZATION [J].
AWERBUCH, B .
JOURNAL OF THE ACM, 1985, 32 (04) :804-823
[3]  
AWERBUCH B, 1985, 4TH P ACM S PRINC DI, P272
[4]   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
[5]  
HILL R, 1986, OXFORD APPLIED MATH
[6]  
PEASE NC, 1977, IEEE T COMPUT, V6, P458
[7]  
PELEG D, IN PRESS J GRAPH THE
[8]  
PELEG D, 1988, RJ6171 IBM RES REP
[9]  
Ullman J., 1984, COMPUTATIONAL ASPECT
[10]  
[No title captured]