Skip to main content

Applicative Architectures for Fault-Tolerant Multiprocessors

  • Chapter
Concurrent Computations

Abstract

This paper proposes functional programming frameworks for the design of highly reliable multiprocessor systems. In contrast to imperative programming environments, a functional environment offers elegant, relatively simple, and efficient solutions to concurrent error detection and recovery problems in multiprocessors. Specific fault tolerance mechanisms for upset exposure, fault containment, secure task assignment, and recovery are developed for a class of applicative multiprocessor architectures. Verification of abstract behavioral characteristics of applicative tasks is used for exposing faults during the execution of tasks. The fault containment mechanism is based on isolation of stack and heap segments of tasks. A protocol for secure task assignment is defined between system components. The architecture permits incremental, distributed, and asynchronous backups of system state. Finally, recovery is accomplished, even in the worst cases, by re-execution of a small number of tasks.

This research was supported in part by the National Aeronautics and Space Administration (NASA) under Contract NASA NAG 1-613 in cooperation with the Illinois Computer Laboratory for Aerospace Systems and Software (ICLASS), by the Joint Services Electronics Program (U.S. Army, U.S. Navy, and the U.S. Air Force) under Contract N00014-84-C-0149, by the National Science Foundation under Grant No. US NSF DCR84-10110, by the U. S. Department of Energy under Grant No. US DOE-DE-FG02-85ER25001, and by an IBM Donation.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

eBook
USD 16.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. R.P. Gabriel and J. McCarthy, Queue-based Multi-processing LISP, Pro- ceedings, 1984 ACM Symposium on LISP and Functional Programming.

    Google Scholar 

  2. D. H. Grit, Towards Fault Tolerance in a Distributed Applicative Multiprocessor, Proceedings, International Symposium on Fault Tolerant Computing, Jun 1984, pp 272–277.

    Google Scholar 

  3. R.H. Halstead, Jr., Implementation of Multilisp: LISP on a Multiprocessor, Proceedings, 1984 ACM Symposium on LISP and Functional Programming.

    Google Scholar 

  4. J. L. A. Hughes, Error Detection and Correction Techniques for Data-Flow Systems, Proceedings, International Symposium on Fault Tolerant Computing, June 1983, pp 318–321.

    Google Scholar 

  5. R. M. Keller, G. Lindstrom, and S. Patil, A Loosely-Coupled Applicative Multi-processing System,AFIPS Conference Proceedings, June 1979, pp 613–622.

    Google Scholar 

  6. R. M. Keller, F. C. H. Lin, and J. Tanaka, Rediflow Multiprocessing, Proceedings, COMPCON Spring 84, Feb. 1984, pp 410–417.

    Google Scholar 

  7. C. K. C. Leung and J. B. Dennis, Design of a Fault-Tolerant Packet Communication Computer Architecture, Proceedings, International Symposium on Fault Tolerant Computing, 1980, pp 328–335.

    Google Scholar 

  8. F.C.H. Lin and R.M. Keller,Distributed Recovery in Applicative Systems, Proceedings, 1986 International Conference on Parallel Processing.

    Google Scholar 

  9. D. P. Misunas, Error Detection and Recovery in a Data-flow Computer, Proceedings, 1976 Conference on Parallel Processing, August 1976, pp 123–131.

    Google Scholar 

  10. B. Randell, Fault Tolerance and System Structuring, Proceedings, 4th Jerusalem Conference on Information Technology, 1984.

    Google Scholar 

  11. V.P. Srini, A Fault Tolerant Datafiow System, IEEE Computer, March 1985, pp 54–68.

    Google Scholar 

  12. S.R. Vegdahl, A Survey of Proposed Architectures for the Execution of Functional Languages, IEEE Trans. on Computers, Dec. 1984, pp 1050–1071.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Plenum Press, New York

About this chapter

Cite this chapter

Sharma, M., Fuchs, W.K. (1988). Applicative Architectures for Fault-Tolerant Multiprocessors. In: Tewksbury, S.K., Dickinson, B.W., Schwartz, S.C. (eds) Concurrent Computations. Springer, Boston, MA. https://doi.org/10.1007/978-1-4684-5511-3_24

Download citation

  • DOI: https://doi.org/10.1007/978-1-4684-5511-3_24

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4684-5513-7

  • Online ISBN: 978-1-4684-5511-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics