Abstract
This paper constructs a probabilistic selection network with size 0.5n log n+O(n 0.822 log n) and depth 5.62 log n + O(log log n). This paper further researches the practical aspects of a butterfly network and shows some useful properties of a butterfly network, which improves in the size and the depth of the selection network.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Ajtai, M., Komlós, J., and Szemerédi, E., “Sorting in c log n Parallel Steps,” Combinatorica, 3, 1983, pp. 1–19.
Alekseev, V. E., “Sorting Algorithms with Minimum Memory,” Kibernetica, 3, 1969, pp. 99–103.
Jimbo, M., and Maruoka, A., “Selection Networks with 8 n log2 n Size and O(log n) Depth,” ISAAC '92, Lecture Notes in Computer Science 650, 1992, pp. 165–174.
Knuth, D. E., The Art of Computer Programming, 3 Addison-Wesley, 1973.
Leighton, T., and Plaxton, C. G., “A (fairly) Simple Circuit that (usually) Sorts,” Proc. 31st Annual Symp. on Foundations of Computer Science, 1, 1990, pp. 264–274.
Paterson, M. S., “Improved Sorting Networks with O(log n) Depth,” Algorithmica, 5, 1990, pp. 75–92.
Pippenger, N., “Selection Networks,” SIAM Journal on Computing, 20, 1991, pp. 878–887.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ikeda, T. (1993). A probabilistic selection network with butterfly networks. In: Ng, K.W., Raghavan, P., Balasubramanian, N.V., Chin, F.Y.L. (eds) Algorithms and Computation. ISAAC 1993. Lecture Notes in Computer Science, vol 762. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57568-5_257
Download citation
DOI: https://doi.org/10.1007/3-540-57568-5_257
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57568-9
Online ISBN: 978-3-540-48233-8
eBook Packages: Springer Book Archive