Skip to main content
SpringerLink
Log in

Lower Bounds on Correction Networks

  • Conference paper
Algorithms and Computation (ISAAC 2003)

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

Included in the following conference series:

Abstract

Correction networks are comparator networks that sort inputs differing from sorted sequences of length N in a small number of positions. The main application of such networks is producing fault-tolerant sorting networks. We show the lower bound 1.44log2 N on the depth of correction networks settling an open problem from [7]. This bound is tight since the upper bound 1.44log2 N is known.

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

Access this chapter

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Ajtai, M., Komló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. Kik, M., Kutyłowski, M., Piotrów, M.: Correction Networks. In: Proc. of 1999 ICPP, pp. 40–47 (1999)

    Google Scholar 

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

    Google Scholar 

  5. 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 

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

    Article  MATH  MathSciNet  Google Scholar 

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

    Chapter  Google Scholar 

  8. Yao, A.C.: Bounds on Selection Networks. SIAM J. Comput. 9, 566–582 (1980)

    Article  MATH  MathSciNet  Google Scholar 

  9. Yao, A.C., Yao, F.F.: On Fault-Tolerant Networks for Sorting. SIAM J. Comput. 14, 120–128 (1985)

    Article  MATH  MathSciNet  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. School of Science and Technology, Kwansei Gakuin University, Sanda, Japan

    Toshihide Ibaraki

  2. Department of Architecture and Architectural Engineering, Kyoto University, 615-8540, Nishikyo-ku, Kyoto, Japan

    Naoki Katoh

  3. Department of Computer Science and Communication Engineering, Kyushu University, 812-8581, Fukuoka, Japan

    Hirotaka Ono

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Stachowiak, G. (2003). Lower Bounds on Correction Networks. In: Ibaraki, T., Katoh, N., Ono, H. (eds) Algorithms and Computation. ISAAC 2003. Lecture Notes in Computer Science, vol 2906. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24587-2_24

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24587-2_24

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-20695-8

  • Online ISBN: 978-3-540-24587-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation