|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
Bitonic Sort on a Mesh-Connected Parallel Computer
January 1979 (vol. 28 no. 1)
pp. 2-7
| ASCII Text | x | ||
| D. Nassimi, S. Sahni, "Bitonic Sort on a Mesh-Connected Parallel Computer," IEEE Transactions on Computers, vol. 28, no. 1, pp. 2-7, January, 1979. | |||
| BibTex | x | ||
| @article{ 10.1109/TC.1979.1675216, author = {D. Nassimi and S. Sahni}, title = {Bitonic Sort on a Mesh-Connected Parallel Computer}, journal ={IEEE Transactions on Computers}, volume = {28}, number = {1}, issn = {0018-9340}, year = {1979}, pages = {2-7}, doi = {http://doi.ieeecomputersociety.org/10.1109/TC.1979.1675216}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - JOUR JO - IEEE Transactions on Computers TI - Bitonic Sort on a Mesh-Connected Parallel Computer IS - 1 SN - 0018-9340 SP2 EP7 EPD - 2-7 A1 - D. Nassimi, A1 - S. Sahni, PY - 1979 KW - SIMD machine KW - Bitonic sort KW - complexity KW - mesh-connected parallel computer KW - parallel sorting VL - 28 JA - IEEE Transactions on Computers ER - | |||
An O(n) algorithm to sort n2elements on an Illiac IV-like n ? n mesh-connected processor array is presented. This algorithm sorts the n2elements into row-major order and is an adaptation of Batcher's bitonic sort. A slight modification of our algorithm yields an O(n) algorithm to sort n2elements into snake-like row-major order. Extensions to the case of a j-dimensi
Index Terms:
SIMD machine, Bitonic sort, complexity, mesh-connected parallel computer, parallel sorting
Citation:
D. Nassimi, S. Sahni, "Bitonic Sort on a Mesh-Connected Parallel Computer," IEEE Transactions on Computers, vol. 28, no. 1, pp. 2-7, Jan. 1979, doi:10.1109/TC.1979.1675216
Usage of this product signifies your acceptance of the Terms of Use.