Leader election in asynchronous distributed systems with unreliable failure detectors

被引：0
|
作者：
Park, SH [1 ]
Yamashita, M [1 ]
机构：
[1] NamSeoul Univ, Chungnam, South Korea
来源：
PDPTA '04: PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED PROCESSING TECHNIQUES AND APPLICATIONS, VOLS 1-3 | 2004年
关键词：
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
This paper is about the Election problem in asynchronous distributed systems with failure detectors. We first discuss the relationship between the Election problem and the Consensus problem in asynchronous distributed systems with unreliable failure detectors. It is stated in [7] that a Perfect Failure Detector is needed to solve the Election problem. But in contrast to the result, there is a failure detector that solves Election weaker than the Perfect Failure Detector We introduce the Leader Perfect failure detector LP We show that to solve Election, LP is necessary while P is not, whereas LP+ lozengeS is sufficient when a majority of the processes are correct.
引用
收藏
页码：687 / 693
页数：7
相关论文
共 50 条
  • [21] Non-blocking atomic commit in asynchronous distributed systems with failure detectors
    Rachid Guerraoui
    Distributed Computing, 2002, 15 : 17 - 25
  • [22] Implementable failure detectors in asynchronous systems
    Garg, VK
    Mitchell, JR
    FOUNDATIONS OF SOFTWARE TECHNOLOGY AND THEORETICAL COMPUTER SCIENCE, 1998, 1530 : 158 - 169
  • [23] EXPECTED CONNECTIVITY AND LEADER ELECTION IN UNRELIABLE NETWORKS
    SINGH, S
    INFORMATION PROCESSING LETTERS, 1992, 42 (05) : 283 - 285
  • [24] An election protocol in asynchronous distributed systems with practical specifications
    Lee, S
    Yang, SI
    Park, SH
    PDPTA '05: Proceedings of the 2005 International Conference on Parallel and Distributed Processing Techniques and Applications, Vols 1-3, 2005, : 928 - 934
  • [25] On the implementation of unreliable failure detectors in partially synchronous systems
    Larrea, M
    Fernández, A
    Arévalo, S
    IEEE TRANSACTIONS ON COMPUTERS, 2004, 53 (07) : 815 - 828
  • [26] About hardness of the Election problem in asynchronous distributed systems
    Park, SH
    Cho, MH
    CIC'2000: PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON COMMUNICATIONS IN COMPUTING, 2000, : 185 - 191
  • [27] Analysis of an election problem for CSCW in asynchronous distributed systems
    Park, SH
    ENGINEERING AND DEPLOYMENT OF COOPERATIVE INFORMATION SYSTEMS, PROCEEDINGS, 2002, 2480 : 280 - 288
  • [28] A probabilistically correct election protocol in asynchronous distributed systems
    Park, SH
    ADVANCED PARALLEL PROCESSING TECHNOLOGIES, PROCEEDINGS, 2003, 2834 : 177 - 185
  • [29] Anonymous Asynchronous Systems: The Case of Failure Detectors
    Bonnet, Francois
    Raynal, Michel
    DISTRIBUTED COMPUTING, 2010, 6343 : 206 - 220
  • [30] Anonymous asynchronous systems: the case of failure detectors
    François Bonnet
    Michel Raynal
    Distributed Computing, 2013, 26 : 141 - 158
12345