Leader Election in Asynchronous Distributed Systems

Simple item page
dc.contributor.authorStoller, Scott
dc.date.accessioned2025-11-11T23:14:19Z
dc.date.available2025-11-11T23:14:19Z
dc.date.issued1999-01
dc.description.abstractIn a classic paper, Garcia-Molina specifies the leader election problem for synchronous and asynchronous distributed systems with crash and link failures and gives an elegant algorithm for each type of system. This paper points out a flaw in Garcia-Molina's specification of leader election in asynchronous systems and proposes a new specification.
dc.identifier.urihttps://hdl.handle.net/2022/34363
dc.relation.ispartofseriesIndiana University Computer Science Technical Reports; TR521
dc.rightsThis work is protected by copyright unless stated otherwise.
dc.rights.uri
dc.titleLeader Election in Asynchronous Distributed Systems

Files

Original bundle

Now showing 1 - 1 of 1
Thumbnail Image
Name:
TR521.pdf
Size:
112.89 KB
Format:
Adobe Portable Document Format
Download

Collections

Technical Reports
Can’t use the file because of accessibility barriers? Contact us