An algebraic theory for modeling direct interconnection networks

Proceedings of the International Conference on Supercomputing

Volumn Part F129723, Issue , 1992, Pages 488-497

  Kaushik, S D ^a   Sharma, S ^a   Huang, C H ^a   Johnson, J R ^b   Johnson, R W ^c   Sadayappan, P ^a  

^a OHIO STATE UNIVERSITY   (United States)

^b DREXEL UNIVERSITY   (United States)

^c ST CLOUD STATE UNIVERSITY   (United States)

Author keywords

Algorithm mapping; Block recursive algorithm; Direct interconnection network; Tensor product

Indexed keywords

CONFORMAL MAPPING; MATRIX ALGEBRA; MEMORY ARCHITECTURE; TENSORS;

ALGEBRAIC THEORIES; BLOCK RECURSIVE ALGORITHM; DIRECT INTERCONNECTION NETWORKS; DISTRIBUTED MEMORY ARCHITECTURE; MATRIX MULTIPLICATION; N-DIMENSIONAL MESHES; NUMERICAL ALGORITHMS; TENSOR PRODUCTS;

INTERCONNECTION NETWORKS (CIRCUIT SWITCHING);

EID: 0011668675     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/superc.1992.236655     Document Type: Conference Paper

References (24)

1. M. Y. Chan and F. Y. L. Chin. On embedding rectangular grids in hypercubes. IEEE Transactions on Computers, C-37(10):1285-1288, Oct. 1988.
2. M. Davio. Kronecker products and shuffle algebra. IEEE Transaction on Computers, C-30(2):116-125, Feb. 1981.
3. J. A. Ellis. Embedding rectangular grids into square grids. IEEE Transactions on Computers, C-40(1):46-52, Jan. 1991.
4. T. Feng. A survey of interconnection networks. IEEE Transactions on Computers, C-30(12):12-27, Dec. 1981.
5. P. M. Flanders. A unified approach to a class of data movements on an array processor. IEEE Transactions on Computers, C-31(9):809-819, Sept. 1982.
6. A. Graham. Kronecker Products and Matrix Calculus: With Applications. Ellis Horwood Limited, 1981.
7. J. P. Hayes. Computer Architecture and Organization. McGraw Hill, 1988.
8. C. T. Ho and S. L. Johnsson. Distributed routing algorithms for broadcasting and personalized communication in hypercubes. In International Conference on Parallel Processing, pages 640-648, 1986.
9. C. T. Ho and S. L. Johnsson. Embedding meshes in boolean cubes by graph decomposition. Journal of Parallel and Distributed Computing, 18:325-339, 1990.
10. R. A. Horn and C. R. Johnson. Topics in Matrix Analysis. Cambridge University Press, Cambridge, 1991.
11. C.-H. Huang, J. R. Johnson, and R. W. Johnson. A tensor product formulation of Strassen's matrix multiplication algorithm. Appl. Math Letters, 3(3):67-71, 1990.
12. C.-H. Huang, J. R. Johnson, and R. W. Johnson. Generating parallel programs from tensor product formulas: a case study of Strassen's matrix multiplication algorithm. In International Conference on Parallel Processing, volume III, pages 104-108, 1992.
13. J. R. Johnson, C.-H. Huang, and R. W. Johnson. Tensor permutations and block matrix allocation. In Second International Workshop on Array Structures (ATABLE-92), 1992. To appear.
14. J. R. Johnson, R. W. Johnson, D. Rodriguez, and R. Tolimieri. A methodology for designing, modifying and implementing Fourier transform algorithms on various architectures. Circuits Systems Signal Process, 9(4):450-500, 1990.
15. R. W. Johnson, C.-H. Huang, and J. R. Johnson. Multilinear algebra and parallel programming. Journal of Super computing, 5:189-218, 1991.
16. S. L. Johnsson and C. T. Ho. Communication efficient basic linear computations on hypercube architectures. Journal of Parallel and Distributed Computing, 4:133-172, 1987.
17. S. L. Johnsson and C. T. Ho. Shuffle permutations on boolean cubes. Technical Report YALEU/DCS/RR-653, Department of Computer Sciences, Yale University, Oct. 1988.
18. S. L. Johnsson and C. T. Ho. On the conversion between binary code and binary-reflected gray code on boolean cubes. Technical Report YALEU/DCS/TR-20-91, Department of Computer Sciences, Yale University, July 1991.
19. S. D. Kaushik, S. Sharma, C.-H. Huang, J. R. Johnson, R. W. Johnson, and P. Sadayappan. An algebraic theory for modeling direct interconnection networks. Technical Report OSU-CIS-RC-1/92-TR 5, Dept. of Computer and Information Science, The Ohio State University, Jan. 1992.
20. S. D. Kaushik, S. Sharma, C.-H. Huang, J. R. Johnson, R. W. Johnson, and P. Sadayappan. An algebraic theory for modeling multistage interconnection networks. Technical Report OSU-CIS-RC-1/92-TR 4, Dept. of Computer and Information Science, The Ohio State University, Jan. 1992.
21. R. G. Melhem and G. Hwang. Embedding rectangular grids into square grids with dilation two. IEEE Transactions on Computers, C-39(12):1446-1455, Dec. 1990.
22. D. Nassimi and S. Sahni. An optimal routing algorithm for mesh-connected parallel computers. Journal of ACM, 27(1):6-29, Jan. 1980.
23. Y. Saad and M. Schultz. Topological properties of hypercubes. IEEE Transactions on Computers, C-37:867-872, 1988.
24. Y. Saad and M. Schultz. Data communication in hypercubes. Journal of Parallel and Distributed Computing, 6:115-135, 1989.