A low-cost processor group membership protocol for a hard real-time distributed system
- 23 November 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
Processor group membership protocols implement a service that allow processors to agree on which processors are operational. Implementations of group membership for hard real-time systems have concentrated on either reducing failure detection latency or minimizing message complexity. Instead, we present a protocol that uses shared resources-processor time and network bandwidth-as a small, bounded tax imposed on existing broadcast message traffic. In doing so, the group membership protocol can easily be taken into account by any schedulability analysis.Keywords
This publication has 8 references indexed in Scilit:
- An efficient decentralized approach to processor-group membership maintenance in real-time LAN systems: the PRHB/ED schemePublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- A low-level processor group membership protocol for LANsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Reaching agreement on processor-group membrship in synchronous distributed systemsDistributed Computing, 1991
- A local area network architecture for communication in distributed real-time systemsReal-Time Systems, 1991
- Implementing fault-tolerant services using the state machine approach: a tutorialACM Computing Surveys, 1990
- Synchronous atomic broadcast for redundant broadcast channelsReal-Time Systems, 1990
- New directions in communications (or which way to the information age?)IEEE Communications Magazine, 1986
- Streets of Byzantium: Network Architectures for Fast Reliable BroadcastsIEEE Transactions on Software Engineering, 1985