Periodic merging networks

  • Mirosław Kutyłowski
  • Krzysztof Loryś
  • Brigitte Oesterdiekhoff
Session 8b: Invited Presentation
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1178)

Abstract

We consider the problem of merging two sorted sequences on constant degree networks using comparators only. The classical solution to the problem are the networks based on Batcher's Odd-Even Merge and Bitonic Merge running in log(2n) time. Due to the obvious log n lower bound for the runtime, this is time-optimal.

We present new merging networks that have a novel property of being periodic: for some (small) constant k, each processing unit of the network performs the same operations at steps t and t+tk (as long as t+k does not exceed the runtime.) The only operations executed are compare-exchange operations, just like in the case of the Batcher's networks. The architecture of the networks is very simple, easy to be laid out. The runtimes achieved are c · log n, for a small constant c.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Kenneth E. Batcher. Sorting networks and their applications. In AFIPS Conf. Proc. 32, pages 307–314, 1968.Google Scholar
  2. 2.
    Ronald I. Becker, David Nassimi, and Yehoshua Perl. The new class of g-chain periodic sorters. In Proc. 5th ACM-SPAA, pages 356–364, 1993.Google Scholar
  3. 3.
    Gianfranco Bilardi. Merging and sorting networks with the topology of the Omega network. IEEE Transactions on Computers, 38:1396–1403, 1989.CrossRefGoogle Scholar
  4. 4.
    Allan Borodin and John E. Hopcroft. Routing, merging, and sorting on parallel models of computation. J. Comput. Syst. Sci., 30(1):130–145, 1985.CrossRefGoogle Scholar
  5. 5.
    Martin Dowd, Yehoshua Perl, Larry Rudolph, and Michael Saks. The periodic balanced sorting network. Journal of the ACM, 36:738–757, 1989.CrossRefGoogle Scholar
  6. 6.
    Marcin Kik, Mirosław Kutyłowski, and Grzegorz Stachowiak. Periodic constant depth sorting networks. In Proc. 11th STACS, pages 201–212, 1994.Google Scholar
  7. 7.
    Donald E. Knuth. The Art of Computer Programming, Volume 3: Sorting and Searching. Addison-Wesley, Reading, MA, 1973.Google Scholar
  8. 8.
    Mirosław Kutyłowski, Krzysztof Loryś, Brigitte Oesterdiekhoff, and Rolf Wanka. Fast and feasible periodic sorting networks of constant depth. In Proc. 35th IEEE-FOCS, pages 369–380, 1994.Google Scholar
  9. 9.
    Peter Bro Miltersen, Mike Paterson, and Jun Tarui. The asymptotic complexity of merging networks. In Proc. 33rd IEEE-FOCS, pages 236–246, 1992.Google Scholar
  10. 10.
    David Nassimi, Yehoshua Perl, and Ronald I. Becker. The generalized class of g-chain periodic sorting networks. In Proc. 8th IPPS, pages 424–432, 1994.Google Scholar
  11. 11.
    Yehoshua Perl. Better understanding of Batcher's merging networks. Discrete Applied Mathematics, 25:257–271, 1989.CrossRefGoogle Scholar
  12. 12.
    Uwe Schwiegelshohn. A shortperiodic two-dimensional systolic sorting algorithm. In International Conference on Systolic Arrays, pages 257–264, 1988.Google Scholar
  13. 13.
    Robert Sedgewick. Data movement in odd-even merging. SIAM J. Comput., 7:239–272, 1978.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag 1996

Authors and Affiliations

  • Mirosław Kutyłowski
    • 1
  • Krzysztof Loryś
    • 2
    • 3
  • Brigitte Oesterdiekhoff
    • 1
  1. 1.Heinz Nixdorf Institute and Department of Mathematics & Computer ScienceUniversity of PaderbornPaderbornGermany
  2. 2.Institute of Computer ScienceUniversity of WrocławPoland
  3. 3.Dept. of Computer ScienceUniversity of TrierTrierGermany

Personalised recommendations