Abstract
The problem of real-time leader election in a shared memory environment requires a single processor to be distinguished as the leader and requires an upper bound on the duration for which no leader is present. This processor can be used to provide services that must be continuously available. We propose an improved protocol, which requires O(log N) time and O(N/log N) variables.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 57-61 |
| Number of pages | 5 |
| Journal | Information Processing Letters |
| Volume | 49 |
| Issue number | 2 |
| DOIs | |
| State | Published - Jan 28 1994 |
| Externally published | Yes |
Keywords
- Distributed Computing
- Election
- Real-Time Systems
ASJC Scopus subject areas
- Theoretical Computer Science
- Signal Processing
- Information Systems
- Computer Science Applications