Data broadcasting and reduction, prefix computation, and sorting on reduced hypercube parallel computers

Parallel Computing

Volumn 22, Issue 4, 1996, Pages 595-606

  Ziavras, Sotirios G ^a   Mukherjee, Arup ^a  

^a NEW JERSEY INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Data broadcasting; Data reduction; Hypercube architecture; Prefix computation; Reduced hypercube interconnection network; Sorting; VLSI complexity

Indexed keywords

COMPUTATIONAL METHODS; COMPUTER HARDWARE; DATA REDUCTION; INTERCONNECTION NETWORKS; PARALLEL PROCESSING SYSTEMS; REDUCED INSTRUCTION SET COMPUTING; SORTING; VLSI CIRCUITS;

DATA BROADCASTING; EQUIVALENT ALGORITHMS; HIGH WIRING VLSI COMPLEXITY; HYPERCUBE EMULATION; PREFIX COMPUTATION; REDUCED HYPERCUBE PARALLEL COMPUTERS;

PARALLEL ALGORITHMS;

EID: 0030164822     PISSN: 01678191     EISSN: None     Source Type: Journal    
DOI: 10.1016/0167-8191(96)00008-7     Document Type: Article

References (18)

1. S.G. Ziavras, On the problem of expanding hypercube-based systems, J. Parallel Distrib. Computing (Sep. 1992) 41-53.
2. S.G. Ziavras, RH: A versatile family of reduced hypercube interconnection networks, IEEE Trans. Parallel Distrib. Systems (Nov. 1994) 1210-1220.
3. S.R. Deshpande and R.M. Jenevin, Scalability of a binary tree on a hypercube, Int. Conf. Parallel Proc. (Aug. 1986) 661-668.
4. K. Ghose and K.R. Desai, The HCN: A versatile interconnection network based on cubes, Supercomputing '89 Conf. (Nov. 1989) 426-435.
5. F.T. Leighton, Introduction to Parallel Algorithms and Architectures (Morgan Kaufmann, San Mateo, CA, 1992).
6. G.C. Fox et al., Solving Problems on Concurrent Processors (Prentice Hall, Englewood Cliffs, NJ, 1988).
7. F.P. Preparata and J. Vuillemin, The cube-connected cycles: A versatile network for parallel computation, Comm. ACM 24 (May 1981) 300-309.
8. V. Kumar et al., Introduction to Parallel Computing (Benjamin/Cummings, CA, 1994).
9. W.J. Dally and C.L. Seitz, Deadlock-free message routing in multiprocessor interconnection networks, IEEE Trans. Computers (May 1987) 547-553.
10. T.H. Lai and W. White, Mapping pyramid algorithms into hypercubes, J. Parallel Distrib. Comput. 9 (1990) 42-54.
11. S.G. Ziavras and M.A. Siddiqui, Pyramid mappings onto hypercubes for computer vision: Connection Machine comparative study, Concurrency: Practice Experience 5 (Sep. 1993) 471-489.
12. C.T. Ho and S.L. Johnsson, Spanning balanced trees in Boolean cubes, SIAM J. Sci. Stat. Comput. (July 1989) 607-630.
13. T.F. Chan and Y. Saad, Multigrid algorithms on the hypercube multiprocessor, IEEE Trans. Computers 35 (Aug. 1988) 969-977.
14. S.L. Johnsson, Communication efficient basic linear algebra computation on hypercube architectures, J. Parallel Distrib. Comput. (Apr. 1987) 133-172.
15. S.G. Ziavras and M.A. Sideras, Facilitating high-performance image analysis on reduced hypercube (RH) parallel computers, Int. J. Pattern Recogn. Artif. Intell. (special issue, Aug. 1995) 679-598.
16. H.P. Katseff, Incomplete hypercubes, IEEE Trans. Computers (May 1988) 604-608.
17. S.G. Ziavras, A class of scalable architectures for high-performance, cost-effective parallel computing, 6th IEEE Symp. Parallel Distrib. Processing, Dallas. Texas (Oct. 1994) 162-169.
18. S.G. Ziavras, Generalized reduced hypercube interconnection networks for massively parallel computers, in: D.F. Hsu, A. Rosenberg, and D. Sotteau, eds., Series in Discrete Math. and Theor. Computer Science 21 (American Math. Soc. 1995) 307-325.