Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Fundamentals of Computation Theory

FCT 2003: Fundamentals of Computation Theory pp 144–156Cite as

Fast Periodic Correction Networks

  • Conference paper

  • 433 Accesses

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

Abstract

We consider the problem of sorting N-element inputs differing from already sorted sequences on t entries. To perform this task we construct a comparator network that is applied periodically. The two constructions for this problem made by previous authors required O(log n + t) iterations of the network. Our construction requires O(log n + (log log N)2 (log t)3) iterations which makes it faster for t ≫ log N.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Ajtai, M., Komolós, J., Szemerédi, E.: Sorting in c log n parallel steps. Combinatorica 3, 1–19 (1983)

    Article  MATH  MathSciNet  Google Scholar 

  2. Batcher, K.E.: Sorting networks and their applications. In: AFIPS Conf. Proc., vol. 32, pp. 307–314 (1968)

    Google Scholar 

  3. Dowd, M., Perl, Y., Saks, M., Rudolph, L.: The Periodic Balanced Sorting Network. Journal of the ACM 36, 738–757 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  4. Kik, M., Kutyłowski, M., Piotrów, M.: Correction Networks. In: Proc. of 1999 ICPP, pp. 40–47 (1999)

    Google Scholar 

  5. Kik, M., Kutyłowski, M., Stachowiak, G.: Periodic constant depth sorting networks. In: Proc. of the 11th STACS, pp. 201–212 (1994)

    Google Scholar 

  6. Kik, M.: Periodic Correction Networks. In: Bode, A., Ludwig, T., Karl, W.C., Wismüller, R. (eds.) Euro-Par 2000. LNCS, vol. 1900, pp. 471–478. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  7. Knuth, D.E.: The Art of Computer Programming, 2nd edn., vol. 3. AddisonWesley, Reading (1975)

    Google Scholar 

  8. Krammer, J.: Lösung von Datentransportproblemen in integrierten Schaltungen. Dissertation, TU München (1991)

    Google Scholar 

  9. Loryś, K., Kutyłowski, M., Oesterdiekoff, B., Wanka, R.: Fast and Feasible Periodic Sorting Networks of Constant Depth. In: Proc of 35 IEEE-FOCS, pp. 369–380 (1994)

    Google Scholar 

  10. Oesterdiekoff, B.: On the Minimal Period of Fast Periodic Sorting Networks, Technical Report TR-RI-95-167, University of Paderborn (1995)

    Google Scholar 

  11. Piotrów, M.: Depth Optimal Sorting Networks Resistant to k Passive Faults. In: Proc. 7th SIAM Symposium on Discrete Algorithms, pp. 242–251 (1996); (also accepted for SIAM J. Comput.)

    Google Scholar 

  12. Piotrów, M.: Periodic Random-Fault-Tolerant Correction Networks. In: Proceedings of 13th SPAA, pp. 298–305. ACM Press, New York (2001)

    Google Scholar 

  13. Rudolph, L.: ARobust Sorting Network. IEEETransactions on Computers 34, 326–336 (1985)

    Article  MATH  MathSciNet  Google Scholar 

  14. Schimmler, M., Starke, C.: A Correction Network for N-Sorters. SIAM J. Comput. 18, 1179–1197 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  15. Schwiegelsohn, U.: A shortperiodic two-dimensional systolic sorting algorithm. In: International Conference on Systolic Arrays, pp. 257–264. Computer Society Press, Baltimore (1988)

    Chapter  Google Scholar 

  16. Stachowiak, G.: Fibonacci Correction Networks. In: Halldórsson, M.M. (ed.) SWAT 2000. LNCS, vol. 1851, pp. 535–548. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Computer Science, University of Wrocław, Przesmyckiego 20, 51-151, Wrocław, Poland

    Grzegorz Stachowiak

Authors
  1. Grzegorz Stachowiak
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, Lund University, 22100, Lund, Sweden

    Andrzej Lingas

  2. School of Technology and Society, Malmö University, SE-205 06, Malmö, Sweden

    Bengt J. Nilsson

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Stachowiak, G. (2003). Fast Periodic Correction Networks. In: Lingas, A., Nilsson, B.J. (eds) Fundamentals of Computation Theory. FCT 2003. Lecture Notes in Computer Science, vol 2751. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45077-1_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-45077-1_14

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40543-6

  • Online ISBN: 978-3-540-45077-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation