Skip to main content

Guaranteeing idempotence for tightly-coupled, fault-tolerant networks

  • Conference paper
  • First Online:
Parallel Computer Routing and Communication (PCRCW 1994)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 853))

Included in the following conference series:

Abstract

This paper presents techniques for guaranteeing idempotent semantics for classes of network operations in fault-tolerant networks. This is accomplished through operation transformation and message filtering. The conventional response to a failed or corrupted message transmission is to retransmit the failed message. This retry mechanism can lead to duplicate message delivery. If duplicated messages are non-idempotent, duplicate message delivery places the system into an inconsistent state. We explore methods of guaranteeing message idempotence at both the application and network protocol levels.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. T. Anderson, editor. Resilient Computing Systems, volume I, chapter 10, pages 178–196. Wiley-Interscience, 1985. Chapter by: C. I. Dimmer.

    Google Scholar 

  2. David E. Culler, Anurag Sah, Klaus Erik Schauser, Thorsten von Eicken, and John Wawrzynek. Fine-grain parallelism with minimal hardware support: A compiler-controlled threaded abstract machine. In Proceedings of the Fourth International Conference on the Architectural Support for Programming Languages and Operating Systems, April 1991.

    Google Scholar 

  3. André DeHon, Frederic Chong, Matthew Becker, Eran Egozy, Henry Minsky, Samuel Peretz, and Thomas F. Knight, Jr. METRO: A router architecture for high-performance, short-haul routing networks. In Proceedings of the International Symposium on Computer Architecture, pages 266–277, May 1994.

    Google Scholar 

  4. André DeHon. Robust, high-speed network design for large-scale multiprocessing. Master's thesis, MIT, 545 Technology Sq., Cambridge, MA 02139, February 1993.

    Google Scholar 

  5. A. Gottlieb, R. Grishman, C. Kruskal, K. McAuliffe, L. Rudolph, and M. Snir. Designing an mimd parallel computer. IEEE Transactions on Computers, C-32(2):175–189, February 1984.

    Google Scholar 

  6. G. Graunke and S. Thakkar. Synchronization algorithms for shared-memory multiprocessors. IEEE Computer, 23(6):60–70, June 1990.

    Google Scholar 

  7. (Ed.) Jon Postel. Transmission control protocol — darpa internet program protocol specification. RFC 793, USC/ISI, Information Sciences Institute, University of Southern California, 4676 Admiralty Way, Marina del Rey, California, 90291, September 1981.

    Google Scholar 

  8. J. H. Saltzer, D. P. Reed, and D. D. Clark. End-to-end arguments in system design. ACM Transactions on Computer Systems, 2(4):277–288, November 1984.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Kevin Bolding Lawrence Snyder

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Eslick, I., DeHon, A., Knight, T. (1994). Guaranteeing idempotence for tightly-coupled, fault-tolerant networks. In: Bolding, K., Snyder, L. (eds) Parallel Computer Routing and Communication. PCRCW 1994. Lecture Notes in Computer Science, vol 853. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58429-3_39

Download citation

  • DOI: https://doi.org/10.1007/3-540-58429-3_39

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-58429-2

  • Online ISBN: 978-3-540-48787-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics