论文信息 - An economical construction for sorting networks

An economical construction for sorting networks

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 = {ia, i1, ..., iN-1}, the resulting outputs 0 = {o0, o1, ..., oN-1} are a permutation of I, and o0≤o1≤...;≤oN-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 o0 and the largest input to o3, and then comparator E orders the remaining two inputs.

David C. van Voorhis

[1] D. Voorhis. A generalization of the divide-sort-merge strategy for sorting networks , 1971 .

[2] Kenneth E. Batcher,et al. Sorting networks and their applications , 1968, AFIPS Spring Joint Computing Conference.

[3] David C. Van Voorhis. A lower bound for sorting networks that use the divide-sort-merge strategy , 1971 .

[4] Donald E. Knuth,et al. Sorting and Searching , 1973 .

[5] D. Voorhis. Large [g,d] sorting networks , 1971 .

[6] David C. van Voorhis. Toward a Lower Bound for Sorting Networks , 1972, Complexity of Computer Computations.

[7] Donald L. Shell,et al. A high-speed sorting procedure , 1959, CACM.

[8] Richard M. Karp,et al. A Phenomenon in the Theory of Sorting , 1970, SWAT.

[9] Abraham Waksman,et al. A Permutation Network , 1968, JACM.

[10] Robert W. Floyd,et al. The Bose-Nelson Sorting Problem††The preparation of this report has been supported in part by the National Science Foundation, and in part by the Office of Naval Research. , 1970 .