Advertisement

On Optimal Merging Networks

  • Kazuyuki Amano
  • Akira Maruoka
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2747)

Abstract

We prove that Batcher’s odd-even (m,n)-merging networks are exactly optimal for (m,n)=(3,4k+2) and (4,4k+2) for k ≥ 0 in terms of the number of comparators used. For other cases where m ≤ 4, the optimality of Batcher’s (m,n)-merging networks has been proved. So we can conclude that Batcher’s odd-even merge yields optimal (m,n)-merging networks for every m ≤ 4 and for every n. The crucial part of the proof is characterizing the structure of optimal (2,n)-merging networks.

Keywords

Lower Bound Induction Hypothesis Induction Step Crucial Part Detailed Proof 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Aigner, M., Schwarzkopf, O.: Bounds of the Size of Merging Networks. Discrete Applied Mathematics 61, 187–194 (1995)zbMATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    Batcher, K.E.: Sorting Networks and Their Applications. Proc. AFIPS 1968 SJCC 32, 307–314 (1968)Google Scholar
  3. 3.
    Iwata, S.: Lower Bounds for Merging Networks. Information and Computation 168, 187–205 (2001)zbMATHCrossRefMathSciNetGoogle Scholar
  4. 4.
    Knuth, D.E.: The Art of Computer Programming, 2nd edn. Sorting and Searching, vol. 3. Addison-Wesley, Reading (1998)Google Scholar
  5. 5.
    Leighton, T., Ma, Y., Suel, T.: On Probabilistic Networks for Selection, Merging, and Sorting. In: Proc. 7th Symp. Parallel Algorithms and Architectures, pp. 106–118 (1995)Google Scholar
  6. 6.
    Miltersen, P.B., Paterson, M., Tarui, J.: The Asymptotic Complexity of Merging Networks. J. Assoc. Comput. Mach. 43, 147–165 (1996)zbMATHMathSciNetGoogle Scholar
  7. 7.
    Yamazaki, K., Mizuno, H., Masuda, K., Iwata, S.: Minimum Number of Comparators in (6,6)-merging Network. IEICE Trans. Inform. Syst. E83-D, 137–141 (2000)Google Scholar
  8. 8.
    Yao, A.C., Yao, F.F.: Lower Bounds of Merging Networks. J. Assoc. Comput. Mach. 23, 566–571 (1976)zbMATHMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Kazuyuki Amano
    • 1
  • Akira Maruoka
    • 1
  1. 1.Graduate School of Information SciencesTohoku UniversitySendaiJapan

Personalised recommendations