PRACTICAL USES OF SYNCHRONIZED CLOCKS IN DISTRIBUTED SYSTEMS

被引：47
作者：
LISKOV, B
机构：
[1] MIT Laboratory for Computer Science, Cambridge, 02139, MA
来源：
DISTRIBUTED COMPUTING | 1993年 / 6卷 / 04期
关键词：
DISTRIBUTED COMPUTING; SYNCHRONIZED CLOCKS; DISTRIBUTED ALGORITHMS;
D O I：
10.1007/BF02242709
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
Synchronized clocks are interesting because they can be used to improve performance of a distributed system by reducing communication. Since they have only recently become a reality in distributed systems, their use in distributed algorithms has received relatively little attention. This paper discusses a number of distributed algorithms that make use of synchronized clocks and analyzes how clocks are used in these algorithms.
引用
收藏
页码：211 / 219
页数：9
相关论文
共 26 条
[1]  
ALSBERG PA, 1976, 2ND P INT C SOFTW EN, P627
[2]  
ELABBADI A, 1986, 5TH P ACM SIGACT SIG, P240
[3]  
ELABBADI A, 1985, 4TH P ACM SIGACT SIG, P215
[4]  
GIFFORD DK, 1983, CSL818 XER CORP TECH
[5]  
GRAY C, 1989, 12 ACM S OP SYST PRI, P202
[6]  
KLEIMAN S, 1986, SUM USENIX 86 C P, P238
[7]   ON OPTIMISTIC METHODS FOR CONCURRENCY-CONTROL [J].
KUNG, HT ;
ROBINSON, JT .
ACM TRANSACTIONS ON DATABASE SYSTEMS, 1981, 6 (02) :213-226
[8]   USING TIME INSTEAD OF TIMEOUT FOR FAULT-TOLERANT DISTRIBUTED SYSTEMS [J].
LAMPORT, L .
ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS, 1984, 6 (02) :254-280
[9]  
Lampson B., 1979, CRASH RECOVERY DISTR
[10]   EFFICIENT AT-MOST-ONCE MESSAGES BASED ON SYNCHRONIZED CLOCKS [J].
LISKOV, B ;
SHRIRA, L ;
WROCLAWSKI, J .
ACM TRANSACTIONS ON COMPUTER SYSTEMS, 1991, 9 (02) :125-142
123