Transposition of Banded Matrices in Hypercubes: A Nearly Isotropic Task
暂无分享,去创建一个
[1] Emmanouel A. Varvarigos,et al. Communication algorithms for isotropic tasks in hypercubes and wraparound meshes , 1992, Parallel Comput..
[2] Alan Edelman,et al. Optimal Matrix Transposition and Bit Reversal on Hypercubes: All-to-All Personalized Communication , 1991, J. Parallel Distributed Comput..
[3] M. H. Schultz,et al. Topological properties of hypercubes , 1988, IEEE Trans. Computers.
[4] John N. Tsitsiklis,et al. Parallel and distributed computation , 1989 .
[5] S. Lennart Johnsson,et al. Optimum Broadcasting and Personalized Communication in Hypercubes , 1989, IEEE Trans. Computers.
[6] Leslie G. Valiant,et al. Universal schemes for parallel communication , 1981, STOC '81.
[7] John N. Tsitsiklis,et al. Optimal Communication Algorithms for Hypercubes , 1991, J. Parallel Distributed Comput..
[8] Dimitri P. Bertsekas,et al. Linear network optimization - algorithms and codes , 1991 .
[9] S. Lennart Johnsson,et al. Algorithms for Matrix Transposition on Boolean n-Cube Configured Ensemble Architectures , 1988, ICPP.
[10] C. T. Howard Ho,et al. Efficient communication primitives on hypercubes , 1992, Concurr. Pract. Exp..
[11] Yousef Saad,et al. Data Communication in Hypercubes , 1989, J. Parallel Distributed Comput..
[12] Oliver A. McBryan,et al. Hypercube Algorithms and Implementations , 1985, PPSC.
[13] Yousef Saad,et al. Data communication in parallel architectures , 1989, Parallel Comput..
[14] Alan Edelman,et al. Index Transformation Algorithms in a Linear Algebra Framework , 1994, IEEE Trans. Parallel Distributed Syst..