|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
Parallel Sorting in a Ring Network of Processors
March 1989 (vol. 38 no. 3)
pp. 458-464
| ASCII Text | x | ||
| Y.-C. Hong, T.H. Payne, "Parallel Sorting in a Ring Network of Processors," IEEE Transactions on Computers, vol. 38, no. 3, pp. 458-464, March, 1989. | |||
| BibTex | x | ||
| @article{ 10.1109/12.21133, author = {Y.-C. Hong and T.H. Payne}, title = {Parallel Sorting in a Ring Network of Processors}, journal ={IEEE Transactions on Computers}, volume = {38}, number = {3}, issn = {0018-9340}, year = {1989}, pages = {458-464}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.21133}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - JOUR JO - IEEE Transactions on Computers TI - Parallel Sorting in a Ring Network of Processors IS - 3 SN - 0018-9340 SP458 EP464 EPD - 458-464 A1 - Y.-C. Hong, A1 - T.H. Payne, PY - 1989 KW - parallel sorting; ring network of processors; parallel implementation; selection sorting algorithms; ring-connected array; manufacture; maintenance; inventory; item placement; performance improvement; carry-look-ahead techniques; computer networks; sorting. VL - 38 JA - IEEE Transactions on Computers ER - | |||
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.21133
A parallel implementation of selection sorting algorithms is presented that uses a ring-connected array of processors, in which each processor has the same amount of memory. The scheme allows all processors to have the same amount of memory with a small fragmentation loss. Uniformity in the size of the memories provides advantages from the viewpoint of manufacture, maintenance, inventory, item
[1] P. N. Armstrong, U.S. Patent 4 131 947, Dec. 26, 1978.
[2] D. Bitton, D. J. Dewitt, D. K. Hsiao, and J. Menon, "A taxonomy of parallel sorting,"Comput. Surveys, vol. 16, pp. 287-318, 1984.
[3] D. E. Knuth,The Art of Computer Programming, Vol. 3, Reading, MA: Addison-Wesley, 1973.
[4] Y. Tanaka, Y. Nozaka, and A. Masuyama, "Pipeline searching and sorting modules as components of dataflow database computer," inProc. Int. Fed. Inform. Processing, Oct. 1980, pp. 427-432.
[5] J. W. J. Williams, "Heapsort,"Commun. ACM, vol. 7, pp. 347- 348, 1964.
Index Terms:
parallel sorting; ring network of processors; parallel implementation; selection sorting algorithms; ring-connected array; manufacture; maintenance; inventory; item placement; performance improvement; carry-look-ahead techniques; computer networks; sorting.
Citation:
Y.-C. Hong, T.H. Payne, "Parallel Sorting in a Ring Network of Processors," IEEE Transactions on Computers, vol. 38, no. 3, pp. 458-464, March 1989, doi:10.1109/12.21133
Usage of this product signifies your acceptance of the Terms of Use.