Abstract
Replicated processing with voting provides a powerful means of constructing highly reliable computing systems. We will consider a functionally distributed computing system intended for real-time applications, where each functional module — a node — has been configured in an NMR (N-modular redundant) fashion. Such a system receives processing requests from ‘actuators’ (the entities that demand services) that require distributed processing at various nodes. The paper will discuss various approaches to scheduling computations to ensure that each processor of an NMR node processes input messages in an identical order. The concept of exception handling for voters will be developed to detect failures in the system.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
M. Pease, R. Shostak and L. Lamport, ‘Reaching agreement in the presence of faults', Journal of ACM, April 1980, pp.228–234.
L. Lamport, R. Shostak and M. Pease, ‘The Byzantine Generals problem', ACM TOPLAS, July 1982, pp.382–401.
R.D. Schlichting and F.B. Schneider, ‘Fail-Stop processors: an approach to designing fault tolerant computing systems', ACM TOCS, August 1983, pp. 222–238.
F.B. Schneider, ‘Byzantine generals in action: implementing fail-stop processors’ ACM TOCS, May 1984.
P.D. Ezhilchelvan and S.K. Shrivastava, ‘Task scheduling for replicated processing in distributed real time systems', Tech. Report, Computing Laboratory, University of Newcastle upon Tyne (to appear).
F. Cristian, M. Aghili, R. Strong and D. Dolev, ‘Atomic broadcast: from simple message diffusion to Byzantine agreement', Digest of papers, FTCS-15, Ann Arbor, June 1985, pp.200–206.
L. Mancini, ‘Modular redundancy in a message passing system', IEEE Trans. on Software Eng., Jan. 1986, pp.79–86.
L. Mancini and S.K. Shrivastava, ‘Exception handling in replicated systems with voting', Digest of papers, FTCS-16, Vienna, July 1986, pp.384–389.
L. Lamport and P.M. Melliar-Smith, ‘Synchronizing clocks in the presence of faults', Journal of ACM, Jan. 1985, pp.52–78.
R. Rivest, A. Shamir and L. Adleman, ‘A method for obtaining digital signatures and public-key cryptosystems', Comm. ACM, Feb. 1978, pp.120–126.
T.V. McTigue, ‘F/A-18 Software development — a case study', Proc. of AGARD Conf. on software for avionics, Sept. 1982 (AGARD — CPP — 330).
A. Avizienis, ‘The N-version approach to fault-tolerant software', IEEE Trans. on Software Eng., Dec. 1985, pp.1491–1501.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1987 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Shrivastava, S.K. (1987). Replicated distributed processing. In: Müller, G., Blanc, R.P. (eds) Networking in Open Systems. Lecture Notes in Computer Science, vol 248. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0026969
Download citation
DOI: https://doi.org/10.1007/BFb0026969
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-17707-4
Online ISBN: 978-3-540-47777-8
eBook Packages: Springer Book Archive