Periodic Correction Networks

  • Marcin Kik
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1900)


We present a comparator network that sorts sequences obtained by changing a limited number of keys in a sorted sequence. The network that we present is periodic and has a depth 8. The time required by this algorithm is O(log n+k) with a small constant hidden by “Oh” notation (n is the total number of keys, k is the number of changed keys).


Systolic Array Constant Depth Sorting Algorithm Sorting Network Comparator Network 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    M. Ajtai, J. Komlós and E. Szemerédi. Sorting in c log n parallel steps. Combinatorica, Vol. 3, pages 1–19, 1983.zbMATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    K. E. Batcher. Sorting networks and their applications. Proceedings of 32nd AFIPS, pages 307–314, 1968.Google Scholar
  3. 3.
    M. Dowd, Y. Perl, M. Saks, and L. Rudolph. The periodic balanced sorting network. Journal of the ACM, Vol. 36, pages 738–757, 1989.zbMATHCrossRefMathSciNetGoogle Scholar
  4. 4.
    M. Kik, M. Kutyłowski and M. Piotrów. Correction networks. Proceedings of the IEEE-ICPP, pages 40–47, 1999.Google Scholar
  5. 5.
    M. Kik, M. Kutyłowski and G. Stachowiak. Periodic constant depth sorting network. Proceedings of the 11th STACS, pages 201–212, 1994.Google Scholar
  6. 6.
    M. Kutyłowski, K. Loryś, B. Oesterdiekhoff, and R. Wanka. Fast and feasible periodic sorting networks. Proceedings of the 55th IEEE-FOCS, 1994. Full version to appear in the Journal of ACM.Google Scholar
  7. 7.
    D. E. Knuth. The art of Computer Programming. Volume 3: Sorting and Searching. Addison-Wesley, 1973.Google Scholar
  8. 8.
    M. Schimmler, C. Starke. A Correction Network for N-Sorters. SIAM Journal on Computing, Vol. 6, No. 6, 1989.Google Scholar
  9. 9.
    U. Schwiegelshohn. A short-periodic two-dimensional systolic sorting algorithm. IEEE International Conference on Systolic Arrays, pages 257–264, 1988.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2000

Authors and Affiliations

  • Marcin Kik
    • 1
  1. 1.Institute of Computer ScienceWrocław UniversityPoland

Personalised recommendations