Show simple item record

dc.contributor.authorFàbrega Canudas, José
dc.contributor.authorFiol Mora, Miquel Àngel
dc.contributor.authorSerra Albó, Oriol
dc.contributor.authorAndrés Yebra, José Luis
dc.date.accessioned2011-05-12T12:09:12Z
dc.date.available2011-05-12T12:09:12Z
dc.date.issued2011
dc.identifier.citationFàbrega Canudas, José [et al.]. A mathematical model for dynamic memory networks. A: International Workshop on Optimal Networks Topologies. "Proceedings of the 3rd International Workshop on Optimal Networks Topologies IWONT 2010". Barcelona: Iniciativa Digital Politècnica, 2011, p. 239-251.
dc.identifier.isbn978-84-7653-565-3
dc.identifier.urihttp://hdl.handle.net/2099/10388
dc.description.abstractThe aim of this paper is to bring together the work done several years ago by M.A. Fiol and the other authors to formulate a quite general mathematical model for a kind of permutation networks known as dynamic memories. A dynamic memory is constituted by an array of cells, each storing one datum, and an interconnection network between the cells that allows the constant circulation of the stored data. The objective is to design the interconnection network in order to have short access time and a simple memory control. We review how most of the proposals of dynamic memories that have appeared in the literature fit in this general model, and how it can be used to design new structures with good access properties. Moreover, using the idea of projecting a digraph onto a de Bruijn digraph, we propose new structures for dynamic memories with vectorial capabilities. Some of these new proposals are based on iterated line digraphs, which have been widely and successfully used by M.A. Fiol and his coauthors to solve many different problems in graph theory.
dc.format.extent13 p.
dc.language.isoeng
dc.publisherIniciativa Digital Politècnica
dc.relation.ispartofInternational Workshop on Optimal Networks Topologies
dc.subjectÀrees temàtiques de la UPC::Matemàtiques i estadística::Anàlisi numèrica::Modelització matemàtica
dc.subjectÀrees temàtiques de la UPC::Matemàtiques i estadística::Matemàtica discreta::Teoria de grafs
dc.subject.lcshMathematical models
dc.subject.lcshPermutations
dc.subject.lcshDirected graphs
dc.subject.lcshGraph theory
dc.titleA mathematical model for dynamic memory networks
dc.typeConference report
dc.subject.lemacModels matemàtics
dc.subject.lemacPermutacions
dc.subject.lemacGrafs, Teoria de
dc.description.peerreviewedPeer Reviewed
dc.subject.amsClassificació AMS::05 Combinatorics::05C Graph theory
dc.rights.accessOpen Access
upcommons.citation.authorFàbrega Canudas, José; Fiol Mora, Miquel Àngel; Serra Albó, Oriol; Andrés Yebra, José Luis
upcommons.citation.contributorInternational Workshop on Optimal Networks Topologies
upcommons.citation.pubplaceBarcelona
upcommons.citation.publishedtrue
upcommons.citation.publicationNameProceedings of the 3rd International Workshop on Optimal Networks Topologies IWONT 2010
upcommons.citation.startingPage239
upcommons.citation.endingPage251


Files in this item

Thumbnail

This item appears in the following Collection(s)

  • 3er. 2010 [27]
    Facultat de Matemàtiques i Estadística, Universitat Politècnica de Catalunya, Barcelona, 9-11 June 2010

Show simple item record

All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder