Thumbnail
Access Restriction
Subscribed

Author Cole, Richard ♦ Siegel, Alan
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Copyright Year ©1988
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Abstract This work describes a large number of constructions for sorting $\textit{N}$ integers in the range [0, $\textit{M}$ - 1], for $\textit{N}$ ≤ $\textit{M}$ ≤ $\textit{N}2,$ for the standard VLSI bit model. Among other results, we attain:VLSI sorter constructions that are within a constant factor of optimal size, for all $\textit{M}$ and almost all running times $\textit{T}.a$ fundamentally new merging network for sorting numbers in a bit model.new organizational approaches for optimal tuning of merging networks and the proper management of data flow.
ISSN 00045411
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 1988-10-01
Publisher Place New York
e-ISSN 1557735X
Journal Journal of the ACM (JACM)
Volume Number 35
Issue Number 4
Page Count 33
Starting Page 777
Ending Page 809


Open content in new tab

   Open content in new tab
Source: ACM Digital Library