A new multi-dimensional interconnection network for SIMD architectures
We describe a new alignment network for a SIMD architecture. The linear skewing scheme can provide conflict free access to vectors which belong to a class called p-ordered vectors. For an odd number of memory banks, we present a new multidimensionnal interconnection network based on the Chinese Remainder Theorem which is able to unscramble all p-ordered vectors and which gives a topology easy to implement.
Unable to display preview. Download preview PDF.
- P.Budnik, D.J.Kuck, “The organization and use of parallel memories”, IEEE Trans. on Computers, Dec. 1975.Google Scholar
- A. Demeure, C. Verdier, “Procédé d'accès, et réseau de permutation pour mémoire à accès parallèles”, Patent Thomson-Sintra-ASM, June 1992.Google Scholar
- D.H.Lawrie, C.R.Vora, “The prime memory system for array access”, IEEE Trans. on Computers, vol. 31, nℴ5, May 1982.Google Scholar
- M.R. Schroeder, “Number theory in science and communication”, Springer-Verlag 2nd ed. 1986.Google Scholar
- H.D. Shapiro, “Theoretical limitations on the efficient use of parallel memories”, IEEE Trans. on Computers, vol. 27, nℴ5, May 1978.Google Scholar
- R.C.Swanson,“Interconnections for parallel memories to unscramble p-ordered vectors”, IEEE Trans. on Computers, vol. 23, nℴ11, May 1974.Google Scholar
- C. Verdier, A. Demeure, F. Jutand, “Addressing scheme for a parallel memory system”, Proc. Euromicro Workshop on Parallel and Distributed Processing, Jan. 93.Google Scholar