|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
| ASCII Text | x | ||
| P.J. Varman, K. Doshi, "Sorting with Linear Speedup on a Pipelined Hypercube," IEEE Transactions on Computers, vol. 41, no. 1, pp. 97-103, January, 1992. | |||
| BibTex | x | ||
| @article{ 10.1109/12.123384, author = {P.J. Varman and K. Doshi}, title = {Sorting with Linear Speedup on a Pipelined Hypercube}, journal ={IEEE Transactions on Computers}, volume = {41}, number = {1}, issn = {0018-9340}, year = {1992}, pages = {97-103}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.123384}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - JOUR JO - IEEE Transactions on Computers TI - Sorting with Linear Speedup on a Pipelined Hypercube IS - 1 SN - 0018-9340 SP97 EP103 EPD - 97-103 A1 - P.J. Varman, A1 - K. Doshi, PY - 1992 KW - linear speedup; pipelined hypercube; distributed-memory parallel architecture; coarse-grained parallel sorting algorithm; communication mechanism; processing elements; data communication problems; binary code architecture; parallel architectures; sorting. VL - 41 JA - IEEE Transactions on Computers ER - | |||
The authors formally define a distributed-memory parallel architecture called the pipelined hypercube. A coarse-grained parallel sorting algorithm that can be mapped efficiently on such an architecture is also presented. The pipelined hypercube has a more powerful communication mechanism than the traditional binary code architecture, in that it permits communication of blocks of data between processing elements (PEs) to be performed in a pipelined manner. Certain data communication problems which would probably be serialized on the binary code architecture, can be performed optimally on the pipelined hypercube. The sorting algorithm can be mapped efficiently onto a pipelined hypercube of P PEs. It sorts N data items, initially distributed among the PEs, in time O((N log N/P)+log/sup 2/ P), thereby achieving linear speedup when P is O(N/log N).
[1] A. Aggarwal and M. A. Huang, "Network complexity of sorting and graph problems and simulating CRCW PRAMS by interconnection networks," inProc. 3rd Aegean Workshop Comput., AWOC 88, Corfu, Greece, June/July 1988, pp. 339-350.
[2] M. Ajtai, J. Komlos, and E. Szemeredi, "AnO(nlogn) sorting network,"Combinatorica, vol. 3, pp. 1-19, 1983.
[3] S. G. Akl,Parallel Sorting Algorithms. Orlando, FL: Academic, 1985.
[4] S. G. Akl and N. Santoro, "Optimal parallel merging and sorting without memory conflicts,"IEEE Trans. Comput., vol. C-36, pp. 1367-1369, 1987.
[5] K. E. Batcher, "Sorting networks and their applications," inProc. AFIPS Spring Joint Comput. Conf., vol. 32, pp. 307-314, 1968.
[6] G. Bilardi and A. Nicolau, "Bitonic sorting withO(nlogn) comparisons," inProc. Twentieth Annu. Conf. Inform. Sci. and Syst., 1986.
[7] G. Bilardi and F. P. Preparata, "A minimum area VLSI network forO(logn) time sorting,"IEEE Trans. Comput., vol. C-34, no. 4, Apr. 1985.
[8] R. A. Borodin and J. E. Hopcroft, "Routing, merging and sorting on parallel models of computation," inProc. 14th ACM Symp. Theory Comput., San Francisco, CA, Apr. 1982, pp. 338-344.
[9] R. Cole, "Parallel merge sort," inProc. Twenty Seventh Annu. Symp. Foundations Comput. Sci., 1986, pp. 511-516.
[10] R. Cypher and J. Sanz, "A new sorting algorithm for distributed memory parallel computers," inProc. 3rd Aegean Workshop Comput., AWOC 88, Corfu, Greece, June/July 1988.
[11] D. Hirschberg, "Fast parallel sorting algorithms,"Commun. ACM, vol. 21, no. 8, pp. 657-661, 1978. pp. 444-448, 1979.
[12] C. T. Ho and S. L. Johnsson, "Algorithms for matrix transportation on Boolean n-cube configured ensemble architectures," inProc. 1987 Int. Conf. Parallel Processing, pp. 621-629.
[13] S. L. Johnsson, "Combining parallel and sequential sorting on a Boolean n-cube," inProc. 1979 Int. Conf. Parallel Processing, 1979, pp. 444-448.
[14] S. L. Johnsson, "Communication efficient basic linear algebra computations on hypercube architectures,"J. Parallel Distributed Comput., pp. 133-172, 1987.
[15] C. P. Kruskal, "Searching, merging and sorting in parallel computation,"IEEE Trans. Comput., vol. C-32, no. 10, pp. 942-946, 1983.
[16] C. P. Kruskal, L. Rudolph, and M. Snir, "The power of parallel prefix,"IEEE Trans. Comput., vol. C-34, no. 10, pp. 965-968, 1985.
[17] S. Lakshmivarahan, S. K. Dhall, and L. L. Miller, "Parallel sorting algorithms," inAdvances in Computers, vol. 23, New York: Academic, 1984.
[18] T. Leighton, "Tight bounds on the complexity of parallel sorting,"IEEE Trans. Comput., vol. C-34, no. 4, pp. 344-354, Apr. 1985.
[19] D. Nassimi and S. Sahni, "Bitonic sort on a mesh connected parallel computer,"IEEE Trans. Comput., vol. C-28, no. 1, pp. 2-7, 1979.
[20] D. Nassimi and S. Sahni, "Parallel permutation and sorting algorithms and a new generalized connection network,"J. ACM, vol. 29, no. 3, pp. 642-667, 1982.
[21] G. Plaxton, "Load balancing, selection and sorting on the hypercube," inProc. 1st ACM Symp. Parallel Algorithms and Architectures, June 1989, pp. 64-73.
[22] G. Plaxton and E. W. Mayr, "Pipelined parallel prefix computations and sorting on a pipelined hypercube," Tech. Rep. STAN-CS-89-1269, Dep. Comput. Sci., Stanford Univ., May 1989.
[23] F. Preparata, "New parallel sorting schemes,"IEEE Trans. Comput., vol. C-27, no. 7, pp. 669-673, 1978.
[24] F. P. Preparata and J. Vuillemin, "The cube-connected cycle: A versatile network for parallel computation,"Commun. ACM, vol. 24, pp. 300-309, May 1981.
[25] J. H. Reif and L. Valiant, "A logarithmic time sort for linear size networks," inProc. Fifteenth Annu. ACM Symp. Theory Comput., 1983, pp. 10-16.
[26] Y. Saad and M. H. Schultz, "Data communication in hypercubes,"J. Parallel Distributed Comput., vol. 6, pp. 115-135, 1989.
[27] Y. Shiloach and U. Vishkin, "Finding the maximum, merging, and sorting in a parallel computation model,"J. Algorithms, vol. 2, pp. 88-102, 1981.
[28] H. S. Stone, "Parallel processing with the perfect shuffle,"IEEE Trans. Comput., vol. C-20, no. 2, pp. 153-161, 1971.
[29] C. Seitz, "Concurrent VLSI architectures,"IEEE Trans. Comput., vol. C- 33, no. 12, pp. 1247-1265, 1984.
[30] C. D. Thompson and H. T. Kung, "Sorting on a mesh connected processor array,"Commun. ACM, pp. 263-271, 1972.
[31] L. Valiant, "Parallelism in comparison problems,"SIAM J. Comput., vol. 4, no. 3, pp. 348-355, 1975.
[32] P. Varman and K. Doshi, "Sorting with linear speedup on a VLSI network," inProc. 1988 Int. Conf. Parallel Processing, Aug. 1988, pp. 202-206.