An algebraic model for the storage of data in parallel memories

Home | About RECERCAT | Contact

Català | Castellano

All of RECERCAT

By Communities &
Collections By Defense Date By Authors By Titles By Subject

This Collection

By Defense Date By Authors By Titles By Subject

Statistics

View Statistics All RECERCAT

My RECERCAT

Other repositories directory

RECERCAT Home > Universitat Politècnica de Catalunya > Documents de recerca > View document

To access the full text documents, please follow this link: http://hdl.handle.net/2117/27169

dc.contributor	Universitat Politècnica de Catalunya. Departament de Matemàtica Aplicada IV
dc.contributor	Universitat Politècnica de Catalunya. COMBGRAPH - Combinatòria, Teoria de Grafs i Aplicacions
dc.contributor.author	Fiol Mora, Miquel Àngel
dc.contributor.author	Serra Albó, Oriol
dc.date	1989
dc.identifier.citation	Fiol, 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.
dc.identifier.citation	978-3-540-51082-6
dc.identifier.uri	http://hdl.handle.net/2117/27169
dc.language.iso	eng
dc.publisher	Springer
dc.relation	http://link.springer.com/book/10.1007/3-540-51082-6
dc.rights	Attribution-NonCommercial-NoDerivs 3.0 Spain
dc.rights	info:eu-repo/semantics/openAccess
dc.rights	http://creativecommons.org/licenses/by-nc-nd/3.0/es/
dc.subject	Àrees temàtiques de la UPC::Matemàtiques i estadística::Investigació operativa::Programació matemàtica
dc.subject	Àrees temàtiques de la UPC::Matemàtiques i estadística::Àlgebra
dc.subject	Programming (Mathematics)
dc.subject	Algorithms
dc.subject	Parallel memories
dc.subject	conflict-free acces
dc.subject	skewing schemes
dc.subject	Programació (Matemàtica)
dc.subject	Algorismes
dc.subject	65K Mathematical programming, optimization and variational techniques
dc.subject	65Y Computer aspects of numerical algorithms
dc.title	An algebraic model for the storage of data in parallel memories
dc.type	info:eu-repo/semantics/publishedVersion
dc.type	info:eu-repo/semantics/bookPart
dc.description.abstract	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.
dc.description.abstract	Peer Reviewed

Show simple item record

All of RECERCAT

This Collection

Statistics

My RECERCAT

Related documents

Other documents of the same author