A correction network for N-sorters

  • Manfred Schimmler
  • Christoph Starke
Parallel Routing And Sorting
Part of the Lecture Notes in Computer Science book series (LNCS, volume 319)


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.


Sorting networks comparators fault tolerance reliability Hamming distance 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Batcher, K.E., Sorting Networks and Their Applications, AFIPS Spring Joint Computer Conference, Vol 23, 307–314, (1968)Google Scholar
  2. [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. [3]
    Knuth, D.E., The Art of Computer Programming, Vol 3. Sorting and Searching, Addison Wesley (1973)Google Scholar
  4. [4]
    Rudolph, L., A Robust Sorting Network. IEEE Trans. Comput.. C-34. 326–335, (1985)MathSciNetCrossRefGoogle Scholar
  5. [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. [6]
    Yao, A.C., Yao, F.E., On Fault Tolerant Networks for Sorting, SIAM J. on Comput., Vol 14, 120–128, (1985)MATHCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1988

Authors and Affiliations

  • Manfred Schimmler
    • 1
  • Christoph Starke
    • 1
  1. 1.Institut für Informatik und Praktische MathematikChristian-Albrechts-Universität KielKiel 1

Personalised recommendations