An algebraic model for the storage of data in parallel memories
Document typePart of book or chapter of book
Rights accessOpen Access
Except where otherwise noted, content on this work is licensed under a Creative Commons license : Attribution-NonCommercial-NoDerivs 3.0 Spain
The use of SIMD computers requires efficient schemes of storage of data in order to have conflict-free acces in parallel computation. In this paper we restate the problem of finding such chemes in an algebraic context. This approach supplies simple statements and proofs of main results on the subject, and allows further development of it.
CitationFiol, M.; Serra, O. An algebraic model for the storage of data in parallel memories. A: "Applied algebra, algebraic algorithms and error-correcting codes (Lec. Not. Comput. Sci. 356)". Berlin, Heidelberg: Springer, 1989, p. 238-246.