Abstract
A set of input vectors S is conclusive if correct functionality for all input vectors is implied by correct functionality over vectors in S. We consider four functionalities of comparator networks: sorting, merging of two equal length sorted vectors, sorting of bitonic vectors, and halving (i.e., separating values above and below the median). For each of these functionalities, we present tight lower and upper bounds on the size of conclusive sets. Bounds are given both for conclusive sets composed of binary vectors and of general vectors. The bounds for general vectors are smaller than the bounds for binary vectors implied by the 0-1 principle. Our results hold also for comparator networks with unbounded fanout.
Assume the network at hand has n inputs and outputs, where n is even. We present a conclusive set for sorting that contains \(\binom{n}{n/2}\) nonbinary vectors. For merging, we present a conclusive set with \(\frac n2 +1\) nonbinary vectors. For bitonic sorting, we present a conclusive set with n nonbinary vectors. For halving, we present \(\binom{n}{n/2}\) binary vectors that constitute a conclusive set. We prove that all these conclusive sets are optimal.
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
Batcher, K.E.: Sorting Networks and their Applications. In: Proc. AFIPS Spring Joint Computer Conference, vol. 32, pp. 307–314 (1968)
Even, G., Levi, T., Litman, A.: A complete characterization of functions that commute with monotonic functions (in preparation)
Bender, E.A., Williamson, S.G.: Periodic Sorting Using Minimum Delay Recursively Constructed Merging Networks. Electronic Journal Of Combinatorics 5 (1998)
Dilworth, R.P.: A Decomposition Theorem for Partially Ordered Sets. Annals of Mathematics 51, 161–166 (1950)
Knuth, D.E.: The art of computer programming Sorting and searching, vol. 3. Addison-Wesley, London (1973)
Lee, D.L., Batcher, K.E.: A Multiway merge sorting network. IEEE Transactions on Parallel and Distributed Systems 6, 211–215 (1995)
Levi, T.: Minimal depth merging networks. M.Sc. Thesis, Technion (March 2006)
Liszka, K.J., Batcher, K.E.: A Modulo merge sorting network. In: Symposium on the Frontiers of Massively Parallel Computation (1992)
Lubell, D.: A short proof of Sperner’s theorem. J. Combin. Theory 1, 299 (1966)
Miltersen, P.B., Paterson, M., Tarui, J.: The asymptotic complexity of merging networks. J. ACM 43(1), 147–165 (1996)
Nakatani, T., et al.: K-way bitonic Sort. IEEE Trans. on Computers 38, 283–288 (1989)
Rajasekaran, S., Sen, S.: A generalization of the 0-1 principle for Sorting. IPL 94, 43–47 (2005)
Rice, W.D.: Continuous Algorithms. Topology Appl. 85, 299–318 (1998)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Even, G., Levi, T., Litman, A. (2007). Optimal Conclusive Sets for Comparator Networks. In: Prencipe, G., Zaks, S. (eds) Structural Information and Communication Complexity. SIROCCO 2007. Lecture Notes in Computer Science, vol 4474. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72951-8_24
Download citation
DOI: https://doi.org/10.1007/978-3-540-72951-8_24
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72918-1
Online ISBN: 978-3-540-72951-8
eBook Packages: Computer ScienceComputer Science (R0)