REAL-TIME LEADER ELECTION

被引:1
作者
SINGH, G
机构
[1] Department of Computing and Information Sciences, Kansas State University, Manhattan, KS 66506
关键词
DISTRIBUTED COMPUTING; REAL-TIME SYSTEMS; ELECTION;
D O I
10.1016/0020-0190(94)90028-0
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The problem of real-time leader election in a shared memory environment requires a single processor to be distinguished as the leader and requires an upper bound on the duration for which no leader is present. This processor can be used to provide services that must be continuously available. We propose an improved protocol, which requires O(log N) time and O(N/log N) variables.
引用
收藏
页码:57 / 61
页数:5
相关论文
共 6 条
[1]  
AFEK Y, 1985, 4TH ACM S PRINC DIST, P186
[2]  
CHRISTIAN F, 1991, DISTRIBUTED COMPUT, V4
[3]  
COAN BA, 1990, PROCEEDINGS : 11TH REAL-TIME SYSTEMS SYMPOSIUM, P166, DOI 10.1109/REAL.1990.128743
[4]  
GARCIAMOLINA H, 1982, IEEE T COMPUT, V31, P48, DOI 10.1109/TC.1982.1675885
[5]  
KORACH E, 1984, 3RD ACM S PRINC DIST, P199
[6]  
Singh G., 1992, Proceedings of the Eleventh Annual ACM Symposium on Principles of Distributed Computing, P179, DOI 10.1145/135419.135457