Skip to main content

An algebraic model for the storage of data in parallel memories

  • 159 Accesses

Part of the Lecture Notes in Computer Science book series (LNCS,volume 356)

Abstract

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 terms

This work has been supported by the Spanish Research Council (Comision Interministerial de Ciencia y Tecnologia, CYCIT) under projects 1180/84 and 0173/86.

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. P. Budnik and D.J. Kuck, "The organization and use of parallel memories", IEEE Trans. Comput. C-20 (1971) 1566–1569.

    Google Scholar 

  2. M.A. Fiol, "Applications of graph theory to interconnection networks" (in Spanish), Ph.D. Thesis, Politech. Univ. of Catalonia, Spain, (1982).

    Google Scholar 

  3. M.A. Fiol, "Congruences in ζn, finite Abelian groups and the Chinese remainder theorem", Discrete Math. 67 (1987) 101–105.

    Article  Google Scholar 

  4. H.D. Shapiro, "Theoretical limitations of the efficient use of parallel memories", IEEE Trans. Comput. C-27 (1978) 421–428.

    Google Scholar 

  5. 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 

  6. 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 

  7. 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 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Llorenç Huguet Alain Poli

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Fiol, M.A., Serra, O. (1989). An algebraic model for the storage of data in parallel memories. In: Huguet, L., Poli, A. (eds) Applied Algebra, Algebraic Algorithms and Error-Correcting Codes. AAECC 1987. Lecture Notes in Computer Science, vol 356. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51082-6_82

Download citation

  • DOI: https://doi.org/10.1007/3-540-51082-6_82

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-51082-6

  • Online ISBN: 978-3-540-46150-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics