research-article

Free access

An economical construction for sorting networks

Author:

David C. Van VoorhisAuthors Info & Claims

AFIPS '74: Proceedings of the May 6-10, 1974, national computer conference and exposition

Pages 921 - 927

https://doi.org/10.1145/1500175.1500347

Published: 06 May 1974 Publication History

PDF eReader

Abstract

An N-input sorting network, or an N-sorter, is a switching circuit with N outputs that satisfy the following: for any combination of inputs I = {i_a, i₁, ..., i_N-1}, the resulting outputs 0 = {o₀, o₁, ..., o_N-1} are a permutation of I, and o₀≤o₁≤...;≤o_N-1. Batcher shows that a basic 2-sorter, or comparator cell, can be used to construct N-sorters for arbitrary N. For example, the circuit in Figure 1 is a 4-sorter, since comparators A through D move the smallest input to o₀ and the largest input to o₃, and then comparator E orders the remaining two inputs.

References

[1]

Batcher, K. E., "Sorting Networks and their Applications," Proc. SJCC, 1968, pp. 307--314.

Digital Library

Google Scholar

[2]

Waksman, A., "A Permutation Network," JACM, Vol. 15, No. 1, Jan. 1959, pp. 159--163.

Digital Library

Google Scholar

[3]

Shell, D. L., "A High Speed Sorting Procedure," CACM, Vol. 2, No. 7, July 1959, pp. 30--32.

Digital Library

Google Scholar

[4]

Hoare, C. A. R., "Quicksort," Comp. J., Vol. 5, 1962, pp. 10--15.

Crossref

Google Scholar

[5]

Van Voorhis, D. C., "Toward a Lower Bound for Sorting Networks," in Complexity of Computer Computations, Plenum Press, 1972, pp. 119--129.

Google Scholar

[6]

Drysdale, R. L., Sorting Networks which Generalize Batcher's Odd-even Merge, Honors Paper, Knox College, Galesburg, Illinois, May 1973.

Google Scholar

[7]

Van Voorhis, D. C., A Generalization of the Divide-sort-merge Strategy for Sorting Networks, Technical Report No. 16, Digital Systems Laboratory, Stanford University, Stanford, California, August 1971.

Digital Library

Google Scholar

[8]

Van Voorhis, D. C., Large {g, d} Sorting Networks, Technical Report No. 18, Digital Systems Laboratory, Stanford University, Stanford, California, August 1971.

Digital Library

Google Scholar

[9]

Floyd, R. W. and D. E. Knuth, The Bose-Nelson Sorting Problem, CS Report 70--177, Stanford University, Stanford, California, November 1970.

Google Scholar

[10]

Knuth, D. E., "Sorting and Searching," The Art of Computer Programming, Vol. 3, Addison-Wesley, 1973.

Google Scholar

[11]

Green, M. W., "Some Improvements in Non-adaptive Sorting Algorithms," Proc. of the Sixth Annual Princeton Conference on Information Sciences and Systems, 1972, pp. 387--391.

Google Scholar

[12]

Gale, D. and R. K. Karp, "A Phenomenon in the Theory of Sorting," IEEE Conference Record of the Eleventh Annual Symposium on Switching and Automata Theory, 1970, pp. 51--59.

Digital Library

Google Scholar

[13]

Van Voorhis, D. C., An Economical Construction for Sorting Networks, Working Paper 16/A45 No. 1, IBM System Development Division, Los Gatos, California, January 1974.

Google Scholar

[14]

Van Voorhis, D. C., A Lower Bound for Sorting Networks that Use the Divide-sort-merge Strategy, Technical Report No. 17, Digital Systems Laboratory, Stanford University, Stanford, California, August 1971.

Digital Library

Google Scholar

Cited By

View all

Kent RPattichis M(2023)Beyond 0-1: The 1-N Principle and Fast Validation of N-Sorter Sorting NetworksIEEE Access10.1109/ACCESS.2023.329373411(70574-70586)Online publication date: 2023
https://doi.org/10.1109/ACCESS.2023.3293734
Kent RPattichis M(2022)Design of High-Speed Multiway Merge Sorting Networks Using Fast Single-Stage N-Sorters and N-FiltersIEEE Access10.1109/ACCESS.2022.319337010(77980-77992)Online publication date: 2022
https://doi.org/10.1109/ACCESS.2022.3193370
Piestrak SBakalis DKavousianos X(2001)On the design of self-testing checkers for modified Berger codesProceedings Seventh International On-Line Testing Workshop10.1109/OLT.2001.937835(153-157)Online publication date: 2001
https://doi.org/10.1109/OLT.2001.937835
Show More Cited By

An economical construction for sorting networks
1. Theory of computation
  1. Design and analysis of algorithms
    1. Data structures design and analysis

Recommendations

Pancake flipping and sorting permutations

In this paper, we study several variations of the pancake flipping problem, which is also well known as the problem of sorting by prefix reversals. We consider the variations in the sorting process by adding with prefix reversals other similar ...
The sorting index and permutation codes

In the combinatorial study of the coefficients of a bivariate polynomial that generalizes both the length and the reflection length generating functions for finite Coxeter groups, Petersen introduced a new Mahonian statistic sor, called the sorting ...
Large [g,d] sorting networks

Comments

Information & Contributors

Information

Published In

AFIPS '74: Proceedings of the May 6-10, 1974, national computer conference and exposition

May 1974

1083 pages

ISBN:9781450379205

DOI:10.1145/1500175

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 06 May 1974

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Research-article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

6
Total Citations
View Citations
186
Total Downloads

Downloads (Last 12 months)29
Downloads (Last 6 weeks)1

Reflects downloads up to 07 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Kent RPattichis M(2023)Beyond 0-1: The 1-N Principle and Fast Validation of N-Sorter Sorting NetworksIEEE Access10.1109/ACCESS.2023.329373411(70574-70586)Online publication date: 2023
https://doi.org/10.1109/ACCESS.2023.3293734
Kent RPattichis M(2022)Design of High-Speed Multiway Merge Sorting Networks Using Fast Single-Stage N-Sorters and N-FiltersIEEE Access10.1109/ACCESS.2022.319337010(77980-77992)Online publication date: 2022
https://doi.org/10.1109/ACCESS.2022.3193370
Piestrak SBakalis DKavousianos X(2001)On the design of self-testing checkers for modified Berger codesProceedings Seventh International On-Line Testing Workshop10.1109/OLT.2001.937835(153-157)Online publication date: 2001
https://doi.org/10.1109/OLT.2001.937835
Chien MYavuz Oruc A(1994)Adaptive Binary Sorting Schemes and Associated Interconnection NetworksIEEE Transactions on Parallel and Distributed Systems10.1109/71.2856035:6(561-572)Online publication date: 1-Jun-1994
https://dl.acm.org/doi/10.1109/71.285603
Parker BParberry I(1989)Constructing sorting networks from k-sortersInformation Processing Letters10.1016/0020-0190(89)90196-833:3(157-162)Online publication date: Nov-1989
https://doi.org/10.1016/0020-0190(89)90196-8
Lakshmivarahan SDhall SMiller L(1984)Parallel Sorting AlgorithmsAdvances in Computers Volume 2310.1016/S0065-2458(08)60467-2(295-354)Online publication date: 1984
https://doi.org/10.1016/S0065-2458(08)60467-2

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Recommendations

Pancake flipping and sorting permutations

The sorting index and permutation codes

Large [g,d] sorting networks

Comments

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Other Metrics

Article Metrics

Other Metrics

Cited By

PDF

eReader

Login options

Full Access

Abstract

References

Cited By

Recommendations

Pancake flipping and sorting permutations

The sorting index and permutation codes

Large [g,d] sorting networks

Comments

Information

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Login options

Full Access

Share

Share this Publication link

Share on social media

Affiliations