10 search results - page 1 / 2 » Electing an Eventual Leader in an Asynchronous Shared Memory... |
DSN
2007
IEEE
13 years 10 months ago
2007
IEEE
This paper considers the problem of electing an eventual leader in an asynchronous shared memory system. While this problem has received a lot of attention in messagepassing syste...
ATVA
2006
Springer
13 years 6 months ago
2006
Springer
Abstract. In this paper, we give an algorithm for fault-tolerant proactive leader election in asynchronous shared memory systems, and later its formal verification. Roughly speakin...
TPDS
2010
13 years 2 months ago
2010
—Considering an asynchronous system made up of n processes and where up to t of them can crash, finding the weakest assumption that such a system has to satisfy for a common lea...
DSN
2006
IEEE
13 years 10 months ago
2006
IEEE
This paper considers the eventual leader election problem in asynchronous message-passing systems where an arbitrary number t of processes can crash (t < n, where n is the tota...