loading...
Leader Election in the Timed Finite Average Response Time Model
Riverside, California December 18-December 20
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/PRDC.2006.4112th Pacific Rim International Sympos ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Christof Fetzer, Technische Universitat Dresden, Germany
Martin Subkraut, Technische Universitat Dresden, Germany
Leader Election is one of the fundamental problems in distributed systems. A leader is a correct process that can be used to coordinate the work of a set of processes. An algorithm has to implement two properties to solve the Leader Election problem:
Citation:
Christof Fetzer, Martin Subkraut, "Leader Election in the Timed Finite Average Response Time Model," prdc, pp.375-376, 12th Pacific Rim International Symposium on Dependable Computing (PRDC'06), 2006
Usage of this product signifies your acceptance of the Terms of Use.