Abstract
We present a family of periodic comparator networks that transform the input so that it consists of a few sorted subsequences. The depths of the networks range from 4 to 2log n while the number of sorted subsequences ranges from 2log n to 2. They work in time clog2 n + O(log n) with 4 ≤ c ≤ 12, and the remaining constants are also suitable for practical applications. So far, known periodic sorting networks of a constant depth that run in time O(log2 n) (a periodic version of AKS network [7]) are impractical because of complex structure and very large constant factor hidden by big “Oh”.
Research supported by KBN grant 7T11C 3220 in the years 2002, 2003.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ajtai, M., Komlós, J., Szemerédi, E.: Sorting in c log n parallel steps. Combinatorica 3, 1–19 (1983)
Batcher, K.E.: Sorting networks and their applications. In: Proceedings of 32nd AFIPS, pp. 307–314 (1968)
Dowd, M., Perl, Y., Rudolph, L., Saks, M.: The periodic balanced sorting network. Journal of the ACM 36, 738–757 (1989)
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)
Kik, M., Kutyłowski, M., Stachowiak, G.: Periodic constant depth sorting network. In: Enjalbert, P., Mayr, E.W., Wagner, K.W. (eds.) STACS 1994. LNCS, vol. 775, pp. 201–212. Springer, Heidelberg (1994)
Kutyłowski, M., Loryś, K., Oesterdiekhoff, B.: Periodic merging networks. In: Proceedings of the 7th ISAAC, pp. 336–345 (1996)
Kutyłowski, M., Loryś, K., Oesterdiekhoff, B., Wanka, R.: Fast and feasible periodic sorting networks. In: Proceedings of the 55th IEEE-FOCS (1994)
Knuth, D.E.: The art of Computer Programming. Sorting and Searching, vol. 3. Addison-Wesley, Reading (1973)
Lee, D.-L., Batcher, K.E.: A multiway merge sorting network. IEEE Transactions on Parallel and Distributed Systems 6, 211–215 (1995)
Schwiegelshohn, U.: A short-periodic two-dimensional systolic sorting algorithm. In: IEEE International Conference on Systolic Arrays, pp. 257–264 (1988)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kik, M. (2003). Periodic Multisorting Comparator 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_13
Download citation
DOI: https://doi.org/10.1007/978-3-540-45077-1_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40543-6
Online ISBN: 978-3-540-45077-1
eBook Packages: Springer Book Archive