VLSI complexity of sorting
Technical Report
·
OSTI ID:7091440
The area-time complexity of sorting is analyzed under an updated model of VLSI computation. The new model distinguishes between processing and memory circuits. Other adjustments to the model allow a comparison between pipelined and non-pipelined designs. Thirteen different designs for VLSI sorters are described and their sorting circuits are used to document the existence of an area-time tradeoff for the sorting problem. The area-time performance figure for all but three of the designs is close to the theoretical minimum value.
- Research Organization:
- California Univ., Berkeley (USA). Electronics Research Lab.
- OSTI ID:
- 7091440
- Report Number(s):
- PB-83-112847
- Country of Publication:
- United States
- Language:
- English
Similar Records
I/O overlapped sorting schemes for VLSI
Parallel enumeration sorting scheme for VLSI
The analysis and synthesis of a parallel sorting engine
Conference
·
Fri Dec 31 23:00:00 EST 1982
·
OSTI ID:5198185
Parallel enumeration sorting scheme for VLSI
Journal Article
·
Tue Nov 30 23:00:00 EST 1982
· IEEE Trans. Comput.; (United States)
·
OSTI ID:6153406
The analysis and synthesis of a parallel sorting engine
Thesis/Dissertation
·
Sat Dec 31 23:00:00 EST 1988
·
OSTI ID:6093165