Agreeing on a leader in real-time (fault tolerant computer system)
- 1 January 1990
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 166-172
- https://doi.org/10.1109/real.1990.128743
Abstract
A method is devised for maintaining the continuing availability of a vital service in a real-time shared-memory multiprocessor fault-tolerant computer system. The essential characteristics of the service to be provided are given. The service can be correctly provided by any one operational processor acting alone. The job of selecting the processor to provide the service is the real-time leader election problem. Two protocols are given which solve this problem in shared-memory systems. Each tolerates the failure of any subset of the processors. The first protocol is extremely simple and has running time linear in the number of processors. The second is slightly more complicated and has running time logarithmic in the number of processors. Both protocols use space that is linear in the number of processors.Keywords
This publication has 10 references indexed in Scilit:
- Time bounds for real-time process control in the presence of timing uncertaintyPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Bounds on the Time to Reach Agreement in the Presence of Timing UncertaintyPublished by Defense Technical Information Center (DTIC) ,1990
- Early-delivery atomic broadcastPublished by Association for Computing Machinery (ACM) ,1990
- Internet Time Synchronization: The Network Time ProtocolPublished by RFC Editor ,1989
- A hundred impossibility proofs for distributed computingPublished by Association for Computing Machinery (ACM) ,1989
- Misconceptions about real-time computing: a serious problem for next-generation systemsComputer, 1988
- On interprocess communicationDistributed Computing, 1986
- Symmetry and similarity in distributed systemsPublished by Association for Computing Machinery (ACM) ,1985
- An upper and lower bound for clock synchronizationInformation and Control, 1984
- Scheduling Algorithms for Multiprogramming in a Hard-Real-Time EnvironmentJournal of the ACM, 1973