|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
External Sorting in VLSI
October 1984 (vol. 33 no. 10)
pp. 931-934
| ASCII Text | x | ||
| M.A. Bonuccelli, E. Lodi, L. Pagli, "External Sorting in VLSI," IEEE Transactions on Computers, vol. 33, no. 10, pp. 931-934, October, 1984. | |||
| BibTex | x | ||
| @article{ 10.1109/TC.1984.1676356, author = {M.A. Bonuccelli and E. Lodi and L. Pagli}, title = {External Sorting in VLSI}, journal ={IEEE Transactions on Computers}, volume = {33}, number = {10}, issn = {0018-9340}, year = {1984}, pages = {931-934}, doi = {http://doi.ieeecomputersociety.org/10.1109/TC.1984.1676356}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - JOUR JO - IEEE Transactions on Computers TI - External Sorting in VLSI IS - 10 SN - 0018-9340 SP931 EP934 EPD - 931-934 A1 - M.A. Bonuccelli, A1 - E. Lodi, A1 - L. Pagli, PY - 1984 KW - VLSI KW - Bitonic sort KW - external sorting KW - merge sort KW - mesh of trees KW - time complexity VL - 33 JA - IEEE Transactions on Computers ER - | |||
The problem of sorting n elements using VLSI chips that can sort only q(q < n) elements at a time is considered. The proposed VLSI chip consists of a mesh of trees. Two classical algorithms, i.e., merge sort and bitonic sort, are modified to efficiently solve the external sorting problem using this chip.
Index Terms:
VLSI, Bitonic sort, external sorting, merge sort, mesh of trees, time complexity
Citation:
M.A. Bonuccelli, E. Lodi, L. Pagli, "External Sorting in VLSI," IEEE Transactions on Computers, vol. 33, no. 10, pp. 931-934, Oct. 1984, doi:10.1109/TC.1984.1676356
Usage of this product signifies your acceptance of the Terms of Use.