An Algebraic Theory for Regular Data Mappings on Parallel Computers
暂无分享,去创建一个
[1] E. D. Dahl,et al. Mapping and Compiled Communication on the Connection Machine System , 1990, Proceedings of the Fifth Distributed Memory Computing Conference, 1990..
[2] F. Leighton,et al. Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes , 1991 .
[3] Harold S. Stone,et al. Parallel Processing with the Perfect Shuffle , 1971, IEEE Transactions on Computers.
[4] Douglas Stott Parker,et al. Notes on Shuffle/Exchange-Type Switching Networks , 1980, IEEE Transactions on Computers.
[5] Jacques Lenfant,et al. Parallel Permutations of Data: A Benes Network Control Algorithm for Frequently Used Permutations , 1978, IEEE Transactions on Computers.
[6] David Steinberg. Invariant Properties of the Shuffle-Exchange and a Simplified Cost-Effective Version of the Omega Network , 1983, IEEE Transactions on Computers.
[7] Dhiraj K. Pradhan,et al. The De Bruijn Multiprocessor Network: A Versatile Parallel Processing and Sorting Network for VLSI , 1989, IEEE Trans. Computers.
[8] Christopher L. Kuszmaul. FFT communications requirement optimizations on massively parallel architectures with local and global interprocessor communications capabilities , 1990 .
[9] Sartaj Sahni,et al. A Self-Routing Benes Network and Parallel Permutation Algorithms , 1981, IEEE Transactions on Computers.
[10] Tom Blank,et al. The MasPar MP-1 architecture , 1990, Digest of Papers Compcon Spring '90. Thirty-Fifth IEEE Computer Society International Conference on Intellectual Leverage.
[11] V. Benes,et al. Mathematical Theory of Connecting Networks and Telephone Traffic. , 1966 .
[12] Shing-Tsaan Huang,et al. Self-Routing Technique in Perfect-Shuffle Networks Using Control Tags , 1988, IEEE Trans. Computers.