Advertisement

Selection networks with 8n log2n size and O(log n) depth

  • Shuji Jimbo
  • Akira Maruoka
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 650)

Abstract

An (n,n/2)-selector is a comparator network that classifies a set of n values into two classes with the same number of values in such a way that each element in one class is at least as large as all of those in the other. Based on utilization of expanders, Pippenger[6] constructed (n,n/2)-selectors, whose size is asymptotic to 2nlog2n and whose depth is O((log n)2). In the same spirit, we obtain a relatively simple method to construct (n,n/2)-selectors of depth O(log n). We construct (n,n/2)-selectors of size at most 8n log2n + O(n). Moreover, for arbitrary C>3/log23=1.8927 ..., we construct (n,n/2)-selectors of size at most Cnlog2n+O(n).

Keywords

Positive Integer Total Size Selection Network Output Terminal Optimal Switching 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    M. Ajtai, J. Komlós, and E. Szemerédi. An O(n log n) sorting network. In Proceedings of the 15th Annual ACM Symposium on Theory of Computing, pp. 1–9, 1983.Google Scholar
  2. 2.
    M. Ajtai, J. Komlós, and E. Szemerédi. Sorting in c log n parallel steps. Combinatorica, Vol. 3 (1), pp. 1–19, 1983.Google Scholar
  3. 3.
    L. A. Bassalygo. Asymptotically optimal switching circuits. Problemy Peredachi Informatsii, Vol. 17, pp. 206–211, 1981. English translation in Problems of Information Transmission.Google Scholar
  4. 4.
    D. E. Knuth. The art of computer programming, Sorting and searching, Vol. 3. Addison-Wesley, 1975.Google Scholar
  5. 5.
    M. S. Paterson. Improved sorting networks with O(log n) depth. Algorithmica, to appear.Google Scholar
  6. 6.
    N. Pippenger. Selection networks. SIAM Journal on Computing, Vol. 20 (5), pp. 878–887, August 1991.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1992

Authors and Affiliations

  • Shuji Jimbo
    • 1
  • Akira Maruoka
    • 1
  1. 1.Tohoku UniversitySendaiJapan

Personalised recommendations