A method for data allocation and manipulation in Hypercube computers

Batcher, 1977, The multidimensional access memory in STARAN, IEEE Trans. Comput., 174, 10.1109/TC.1977.5009297 Bhatt, 1985, How to embed trees in Hypercubes Budnik, 1971, The organization and use of parallel memories, IEEE Trans. Comput., 1566, 10.1109/T-C.1971.223171 Chan, 1986, Solving elliptic partial differential equations on hypercubes Danielsson, 1981, Computer architecture for pictorial information systems, Computer, 14, 53, 10.1109/C-M.1981.220251 Dally, 1986, The torus routing chip, Distributed Comput., 1, 187, 10.1007/BF01660031 Fox, 1985, The performance of the Caltech hypercube in scientific calculations, Caltech Report CALT-68-1298, Caltech Intel Corp, 1986 Lawrie, 1975, Access and alignment of data in an array processor, IEEE Trans. Comput., C-24, 1145, 10.1109/T-C.1975.224157 Lee, 1990, An efficient method for distributing data in hypercube computers, 858 Lee, 1988, Scrambled storage for parallel memory systems, 232 Nassimi, 1982, Optimal BPC permutations on a cube connected SIMD computer, IEEE Trans. Comput., C-31, 338, 10.1109/TC.1982.1676004 NCUBE Corp, 1986 Ortega, 1981 Peas, 1977, The indirect binary n-cube microprocessor array, IEEE Trans. Comput., C-26, 458, 10.1109/TC.1977.1674863 Saad, 1988, Topological properties of hypercubes, IEEE Trans. Comput., 37, 867, 10.1109/12.2234 Schwetman, 1990, CSIM user's guide Seitz, 1985, The cosmic cube, Commun. ACM, 28, 22, 10.1145/2465.2467 Shapiro, 1978, Theoretical limitations on the efficient use of parallel memories, IEEEE Trans. Comput., C-27, 421, 10.1109/TC.1978.1675122 Siegel, 1985 Wu, 1985, Embedding of tree networks into hypercubes, J. Parallel Distributed Comput., 2, 238, 10.1016/0743-7315(85)90026-7