Evaluating local indirect addressing in SIMD proc essors
暂无分享,去创建一个
[1] Gyula A. Mago. The FFP machine , 1989 .
[2] W. Daniel Hillis,et al. The connection machine , 1985 .
[3] David Elliot Shaw. The NON-VON Supercomputer , 1982 .
[4] Sartaj Sahni,et al. A Self-Routing Benes Network and Parallel Permutation Algorithms , 1981, IEEE Transactions on Computers.
[5] David Middleton. Implementing nested conditional statements in SIMD machines , 1989 .
[6] S. Tomboulian. Overview and extensions of a system for routing directed graphs on SIMD architectures , 1988, Proceedings., 2nd Symposium on the Frontiers of Massively Parallel Computation.
[7] Salvatore J. Stolfo,et al. DADO: A Parallel Processor for Expert Systems , 1984 .
[8] Lawrence Snyder. A Taxonomy of Synchronous Parallel Machines , 1988, ICPP.
[9] Richard M. Brown,et al. The ILLIAC IV Computer , 1968, IEEE Transactions on Computers.
[10] W. Daniel Hillis,et al. Data parallel algorithms , 1986, CACM.
[11] Henry Fuchs,et al. PIXEL-PLANES: BUILDING A VLSI-BASED GRAPHIC SYSTEM. , 1985 .
[12] Tommaso Toffoli,et al. Cellular automata machines - a new environment for modeling , 1987, MIT Press series in scientific computation.
[13] Bradley C. Kuszmaul. Simulating Applicative Architectures on the Connection Machine , 1986 .
[14] Michael J. Flynn,et al. Some Computer Organizations and Their Effectiveness , 1972, IEEE Transactions on Computers.