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.
Partially supported by KBN grants 8 S503 002 07, 2 P301 034 07, DFG-Sonderforschungsbereich 376 “Massive Parallelität”, DFG Leibniz Grant Me872/6-1 and EU ESPRIT Long Term Research Project 20244 (ALCOM-IT); this research was partially done while the second author visited University of Paderborn
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Kenneth E. Batcher. Sorting networks and their applications. In AFIPS Conf. Proc. 32, pages 307–314, 1968.
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.
Gianfranco Bilardi. Merging and sorting networks with the topology of the Omega network. IEEE Transactions on Computers, 38:1396–1403, 1989.
Allan Borodin and John E. Hopcroft. Routing, merging, and sorting on parallel models of computation. J. Comput. Syst. Sci., 30(1):130–145, 1985.
Martin Dowd, Yehoshua Perl, Larry Rudolph, and Michael Saks. The periodic balanced sorting network. Journal of the ACM, 36:738–757, 1989.
Marcin Kik, Mirosław Kutyłowski, and Grzegorz Stachowiak. Periodic constant depth sorting networks. In Proc. 11th STACS, pages 201–212, 1994.
Donald E. Knuth. The Art of Computer Programming, Volume 3: Sorting and Searching. Addison-Wesley, Reading, MA, 1973.
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.
Peter Bro Miltersen, Mike Paterson, and Jun Tarui. The asymptotic complexity of merging networks. In Proc. 33rd IEEE-FOCS, pages 236–246, 1992.
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.
Yehoshua Perl. Better understanding of Batcher's merging networks. Discrete Applied Mathematics, 25:257–271, 1989.
Uwe Schwiegelshohn. A shortperiodic two-dimensional systolic sorting algorithm. In International Conference on Systolic Arrays, pages 257–264, 1988.
Robert Sedgewick. Data movement in odd-even merging. SIAM J. Comput., 7:239–272, 1978.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kutyłowski, M., Loryś, K., Oesterdiekhoff, B. (1996). Periodic merging networks. In: Asano, T., Igarashi, Y., Nagamochi, H., Miyano, S., Suri, S. (eds) Algorithms and Computation. ISAAC 1996. Lecture Notes in Computer Science, vol 1178. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0009510
Download citation
DOI: https://doi.org/10.1007/BFb0009510
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-62048-8
Online ISBN: 978-3-540-49633-5
eBook Packages: Springer Book Archive