Show simple item record

dc.contributor.authorBarrière Figueroa, Eulalia
dc.contributor.authorCohen, Johanne
dc.contributor.authorMitjana Riera, Margarida
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament de Matemàtica Aplicada I
dc.description.abstractThe line model assumes long distance calls between non neighboring processors. In this sense, the line model is strongly related to circuit-switched networks, wormhole routing, optical networks supporting wavelength division multiplexing, ATM switching, and networks supporting connected mode routing protocols. Since the chordal rings are competitors of networks as meshes or tori because of theirs short diameter and bounded degree, it is of interest to ask whether they can support intensive communications (typically all-to-all) as efficiently as these networks. We propose polynomial algorithms to derive optimal or near optimal gossip protocols in the chordal ring.
dc.rightsAttribution-NonCommercial-NoDerivs 2.5 Spain
dc.subject.lcshComputer systems
dc.subject.lcshCircuits & Systems
dc.subject.lcshIEEE Symposium on
dc.subject.otherChordal Rings
dc.subject.otherLine Model
dc.titleGossiping in chordal rings under the line model
dc.subject.lemacArquitectura de computadors
dc.subject.lemacAnàlisi de xarxes (Planificació)
dc.contributor.groupUniversitat Politècnica de Catalunya. COMBGRAPH - Combinatòria, Teoria de Grafs i Aplicacions
dc.subject.amsClassificació AMS::68 Computer science::68M Computer system organization
dc.subject.amsClassificació AMS::94 Information And Communication, Circuits::94C Circuits, networks
dc.rights.accessOpen Access

Files in this item


This item appears in the following Collection(s)

Show simple item record

Except where otherwise noted, content on this work is licensed under a Creative Commons license: Attribution-NonCommercial-NoDerivs 2.5 Spain