An algebraic model for the storage of data in parallel memories
The use of SIMD computers requires efficient schemes of storage of data in order to have conflict-free access in parallel computation. In this paper we restate the problem of finding such schemes in an algebraic context. This approach supplies simple statements and proofs of main results on the subject, and allows further development of it.
Index termsParallel memories conflict-free access skewing schemes
Unable to display preview. Download preview PDF.
- P. Budnik and D.J. Kuck, "The organization and use of parallel memories", IEEE Trans. Comput. C-20 (1971) 1566–1569.Google Scholar
- M.A. Fiol, "Applications of graph theory to interconnection networks" (in Spanish), Ph.D. Thesis, Politech. Univ. of Catalonia, Spain, (1982).Google Scholar
- H.D. Shapiro, "Theoretical limitations of the efficient use of parallel memories", IEEE Trans. Comput. C-27 (1978) 421–428.Google Scholar
- J. Tappe, J. van Leeuwen and H.A. Wijshoff, "Parallel memories, periodic skewing schemes and the theory of finite Abelian groups", Techn.Report RUU-CS-84-7, Dept. of Computer Science, University of Utrecht, (1984).Google Scholar
- H.A. Wijshoff and J. van Leeuwen, "Periodic storage schemes with a minimum number of memory banks", Techn.Report RUU-CS-83-4, Dept. of Computer Science, University of Utrecht (1983).Google Scholar
- W.A. Wijshoff and J. van Leeuwen, "The structure of periodic storage schemes for parallel memories", IEEE Trans. Comput. C-34 (1985) 501–504.Google Scholar