TY - GEN
T1 - Optimal bounded-degree VLSI networks for sorting in a constant number of rounds
AU - Alnuweiri, Hussein M.
PY - 1991
Y1 - 1991
N2 - The author presents novel designs of optimal VLSI sorters which combine rotate-sort with enumeration-sort. One major contribution of the present work is the development of an efficient index-mapping methodology to construct simple reduced-area shuffle networks which are used to permute data between sorting stages. Moreover, the proposed networks which are used to permute data work are amenable to simple partitioning schemes resulting in multiple chip networks in which each chip has a small number of I/O (input/output) pins.
AB - The author presents novel designs of optimal VLSI sorters which combine rotate-sort with enumeration-sort. One major contribution of the present work is the development of an efficient index-mapping methodology to construct simple reduced-area shuffle networks which are used to permute data between sorting stages. Moreover, the proposed networks which are used to permute data work are amenable to simple partitioning schemes resulting in multiple chip networks in which each chip has a small number of I/O (input/output) pins.
UR - https://www.scopus.com/pages/publications/0026264266
U2 - 10.1145/125826.126169
DO - 10.1145/125826.126169
M3 - Conference contribution
AN - SCOPUS:0026264266
SN - 0818621583
SN - 9780818621581
T3 - Proceedings Supercomputing 1991
SP - 732
EP - 739
BT - Proceedings Supercomputing 1991
PB - Publ by IEEE
T2 - 1991 ACM/IEEE conference on Supercomputing, SC 1991
Y2 - 18 November 1991 through 22 November 1991
ER -