Spectrum analysis and min-cut transformation of communication networks in parallel computers
暂无分享,去创建一个
[1] Donald Fraser,et al. Array Permutation by Index-Digit Permutation , 1976, JACM.
[2] S. Lennart Johnsson,et al. Optimum Broadcasting and Personalized Communication in Hypercubes , 1989, IEEE Trans. Computers.
[3] Ramesh Subramonian,et al. LogP: towards a realistic model of parallel computation , 1993, PPOPP '93.
[4] Lennart Johnson,et al. Communication in network architectures , 1990 .
[5] S. Lennart Johnsson,et al. Algorithms for Matrix Transposition on Boolean n-Cube Configured Ensemble Architectures , 1988, ICPP.
[6] Charles E. Leiserson,et al. Fat-trees: Universal networks for hardware-efficient supercomputing , 1985, IEEE Transactions on Computers.
[7] Peter M. Flanders. A Unified Approach to a Class of Data Movements on an Array Processor , 1982, IEEE Transactions on Computers.
[8] Xiaojing Wang,et al. Optimal Mappings of m Dimensional FFT Communication to k Dimensional Mesh for Arbitrary m and k , 1993, PARLE.
[9] P. M. Flanders,et al. Data mapping and routing for highly parallel processor arrays , 1987 .