Skip to main content

A correction network for N-sorters

  • Parallel Routing And Sorting
  • Conference paper
  • First Online:
VLSI Algorithms and Architectures (AWOC 1988)

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

Included in the following conference series:

Abstract

A correction network C is introduced that can be added to an arbitrary N input sorting net in order to achieve single fault tolerance. Multiple (m) fault robustness ist attained by adding Cm. For single fault correction C is proved to be assymptotically optimal.

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. Batcher, K.E., Sorting Networks and Their Applications, AFIPS Spring Joint Computer Conference, Vol 23, 307–314, (1968)

    Google Scholar 

  2. Dowd. M., Perl. Y., Rudolph. L., Saks. M., The Balanced Sorting Network. in Proc. ACM Princ. Distrib. Comput., 161–172, (1983)

    Google Scholar 

  3. Knuth, D.E., The Art of Computer Programming, Vol 3. Sorting and Searching, Addison Wesley (1973)

    Google Scholar 

  4. Rudolph, L., A Robust Sorting Network. IEEE Trans. Comput.. C-34. 326–335, (1985)

    Article  MathSciNet  Google Scholar 

  5. Schimmler, M., Starke, C., A Correction Network for N-Sorters. Technical Report 8714, Institut für Informatik und Praktische Mathematik, Kiel, W.-Germany, (1987)

    Google Scholar 

  6. Yao, A.C., Yao, F.E., On Fault Tolerant Networks for Sorting, SIAM J. on Comput., Vol 14, 120–128, (1985)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

John H. Reif

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Schimmler, M., Starke, C. (1988). A correction network for N-sorters. In: Reif, J.H. (eds) VLSI Algorithms and Architectures. AWOC 1988. Lecture Notes in Computer Science, vol 319. Springer, New York, NY. https://doi.org/10.1007/BFb0040411

Download citation

  • DOI: https://doi.org/10.1007/BFb0040411

  • Published:

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-0-387-96818-6

  • Online ISBN: 978-0-387-34770-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics