Referenced Items are not available for this document.
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.
Published in:
Real-Time Systems Symposium, 1997. Proceedings., The 18th IEEE
Date of Conference: 5-5 Dec. 1997
- Page(s):
- 90 - 98
- Meeting Date :
- 02 Dec 1997-05 Dec 1997
- ISSN :
- 1052-8725
- Print ISBN:
- 0-8186-6600-5
- INSPEC Accession Number:
- 5795317
- Conference Location :
- San Francisco, CA, USA
- Digital Object Identifier :
- 10.1109/REAL.1997.641272
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
