Abstract
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.
Preview
Unable to display preview. Download preview PDF.
References
P.Budnik, D.J.Kuck, “The organization and use of parallel memories”, IEEE Trans. on Computers, Dec. 1975.
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.
D.H.Lawrie, C.R.Vora, “The prime memory system for array access”, IEEE Trans. on Computers, vol. 31, nℴ5, May 1982.
M.R. Schroeder, “Number theory in science and communication”, Springer-Verlag 2nd ed. 1986.
H.D. Shapiro, “Theoretical limitations on the efficient use of parallel memories”, IEEE Trans. on Computers, vol. 27, nℴ5, May 1978.
R.C.Swanson,“Interconnections for parallel memories to unscramble p-ordered vectors”, IEEE Trans. on Computers, vol. 23, nℴ11, May 1974.
C. Verdier, A. Demeure, F. Jutand, “Addressing scheme for a parallel memory system”, Proc. Euromicro Workshop on Parallel and Distributed Processing, Jan. 93.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Verdier, C., Lafage, A., Boutillon, E., Demeure, A. (1994). A new multi-dimensional interconnection network for SIMD architectures. In: Halatsis, C., Maritsas, D., Philokyprou, G., Theodoridis, S. (eds) PARLE'94 Parallel Architectures and Languages Europe. PARLE 1994. Lecture Notes in Computer Science, vol 817. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58184-7_153
Download citation
DOI: https://doi.org/10.1007/3-540-58184-7_153
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58184-0
Online ISBN: 978-3-540-48477-6
eBook Packages: Springer Book Archive