Optimal bounded-degree VLSI networks for sorting in a constant number of rounds

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

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.

Original languageEnglish
Title of host publicationProc Supercomput 91
PublisherPubl by IEEE
Pages732-739
Number of pages8
ISBN (Print)0818621583
Publication statusPublished - 1 Dec 1991
Externally publishedYes
EventProceedings of Supercomputing '91 - Albuquerque, NM, USA
Duration: 18 Nov 199122 Nov 1991

Other

OtherProceedings of Supercomputing '91
CityAlbuquerque, NM, USA
Period18/11/9122/11/91

Fingerprint

Sorting

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Alnuweiri, H. (1991). Optimal bounded-degree VLSI networks for sorting in a constant number of rounds. In Proc Supercomput 91 (pp. 732-739). Publ by IEEE.

Optimal bounded-degree VLSI networks for sorting in a constant number of rounds. / Alnuweiri, Hussein.

Proc Supercomput 91. Publ by IEEE, 1991. p. 732-739.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Alnuweiri, H 1991, Optimal bounded-degree VLSI networks for sorting in a constant number of rounds. in Proc Supercomput 91. Publ by IEEE, pp. 732-739, Proceedings of Supercomputing '91, Albuquerque, NM, USA, 18/11/91.
@inproceedings{94218d44f6994a08b0fb1379ef4c4029,
title = "Optimal bounded-degree VLSI networks for sorting in a constant number of rounds",
abstract = "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.",
author = "Hussein Alnuweiri",
year = "1991",
month = "12",
day = "1",
language = "English",
isbn = "0818621583",
pages = "732--739",
booktitle = "Proc Supercomput 91",
publisher = "Publ by IEEE",

}

TY - GEN

T1 - Optimal bounded-degree VLSI networks for sorting in a constant number of rounds

AU - Alnuweiri, Hussein

PY - 1991/12/1

Y1 - 1991/12/1

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 - http://www.scopus.com/inward/record.url?scp=0026264266&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0026264266&partnerID=8YFLogxK

M3 - Conference contribution

SN - 0818621583

SP - 732

EP - 739

BT - Proc Supercomput 91

PB - Publ by IEEE

ER -