This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2010 European Dependable Computing Conference
Eventual Leader Election in Infinite Arrival Message-Passing System Model with Bounded Concurrency
Valencia, Spain
April 28-April 30
ISBN: 978-0-7695-4007-8
We study the failure detection problem in a message-passing system that may dynamically change over time, so that the number of processes which make progress during a computation may grow to infinity as time tends to infinity but the number of concurrently up processes do not exceed a known bound. We first propose the specification of a new oracle, called HB*, able to give hints on which processes are making progress in the system. A possible HB* implementation is given. Then, we show how to use HB* to implement the oracle Ω that eventually identifies a unique leader in the system. To the best of our knowledge this is the first implementation of Ω running in a message passing system with infinitely many processes.
Citation:
Sara Tucci-Piergiovanni, Roberto Baldoni, "Eventual Leader Election in Infinite Arrival Message-Passing System Model with Bounded Concurrency," edcc, pp.127-134, 2010 European Dependable Computing Conference, 2010
Usage of this product signifies your acceptance of the Terms of Use.