InforLorV4, Hal, Corpus, bibRecord, 002642

Gossiping in chordal rings under the line model

Identifieur interne : 002642 ( Hal/Corpus ); précédent : 002641; suivant : 002643

Gossiping in chordal rings under the line model

Auteurs : Lali Barrière ; Johanne Cohen ; Margarida Mitjana

Source :

Theoretical Computer Science [ 0304-3975 ] ; 2001.

RBID : Hal:inria-00100504

Descripteurs français

mix :
- 1-port, communication de groupe, gossip, group communication, line model, modèle commute, one-port, échange total.

Abstract

This paper is devoted to the gossip (or all-to-all) problem in the chordal ring under the one-port line model. The 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 eÆciently as these networks. We propose polynomial algorithms to derive optimal or near optimal gossip protocols in the chordal ring.

Url:

https://hal.inria.fr/inria-00100504

Links to Exploration step

Hal:inria-00100504

Le document en format XML

<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en">Gossiping in chordal rings under the line model</title>
<author><name sortKey="Barriere, Lali" sort="Barriere, Lali" uniqKey="Barriere L" first="Lali" last="Barrière">Lali Barrière</name>
</author>
<author><name sortKey="Cohen, Johanne" sort="Cohen, Johanne" uniqKey="Cohen J" first="Johanne" last="Cohen">Johanne Cohen</name>
<affiliation><hal:affiliation type="researchteam" xml:id="struct-2363" status="OLD"><idno type="RNSR">199621458W</idno>
<orgName>Software Tools for Telecommunications and Distributed Systems</orgName>
<orgName type="acronym">RESEDAS</orgName>
<desc><address><country key="FR"></country>
</address>
<ref type="url">http://www.inria.fr/equipes/resedas</ref>
</desc>
<listRelation><relation active="#struct-160" type="direct"></relation>
<relation name="UMR7503" active="#struct-441569" type="indirect"></relation>
<relation active="#struct-300009" type="indirect"></relation>
<relation active="#struct-300291" type="indirect"></relation>
<relation active="#struct-300292" type="indirect"></relation>
<relation active="#struct-300293" type="indirect"></relation>
<relation active="#struct-2496" type="direct"></relation>
</listRelation>
<tutelles><tutelle active="#struct-160" type="direct"><org type="laboratory" xml:id="struct-160" status="OLD"><orgName>Laboratoire Lorrain de Recherche en Informatique et ses Applications</orgName>
<orgName type="acronym">LORIA</orgName>
<desc><address><addrLine>Campus Scientifique BP 239 54506 Vandoeuvre-lès-Nancy Cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.loria.fr</ref>
</desc>
<listRelation><relation name="UMR7503" active="#struct-441569" type="direct"></relation>
<relation active="#struct-300009" type="direct"></relation>
<relation active="#struct-300291" type="direct"></relation>
<relation active="#struct-300292" type="direct"></relation>
<relation active="#struct-300293" type="direct"></relation>
</listRelation>
</org>
</tutelle>
<tutelle name="UMR7503" active="#struct-441569" type="indirect"><org type="institution" xml:id="struct-441569" status="VALID"><idno type="ISNI">0000000122597504</idno>
<idno type="IdRef">02636817X</idno>
<orgName>Centre National de la Recherche Scientifique</orgName>
<orgName type="acronym">CNRS</orgName>
<date type="start">1939-10-19</date>
<desc><address><country key="FR"></country>
</address>
<ref type="url">http://www.cnrs.fr/</ref>
</desc>
</org>
</tutelle>
<tutelle active="#struct-300009" type="indirect"><org type="institution" xml:id="struct-300009" status="VALID"><orgName>Institut National de Recherche en Informatique et en Automatique</orgName>
<orgName type="acronym">Inria</orgName>
<desc><address><addrLine>Domaine de VoluceauRocquencourt - BP 10578153 Le Chesnay Cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.inria.fr/en/</ref>
</desc>
</org>
</tutelle>
<tutelle active="#struct-300291" type="indirect"><org type="institution" xml:id="struct-300291" status="OLD"><orgName>Université Henri Poincaré - Nancy 1</orgName>
<orgName type="acronym">UHP</orgName>
<date type="end">2011-12-31</date>
<desc><address><addrLine>24-30 rue Lionnois, BP 60120, 54 003 NANCY cedex, France</addrLine>
<country key="FR"></country>
</address>
</desc>
</org>
</tutelle>
<tutelle active="#struct-300292" type="indirect"><org type="institution" xml:id="struct-300292" status="OLD"><orgName>Université Nancy 2</orgName>
<date type="end">2011-12-31</date>
<desc><address><addrLine>91 avenue de la Libération, BP 454, 54001 Nancy cedex</addrLine>
<country key="FR"></country>
</address>
</desc>
</org>
</tutelle>
<tutelle active="#struct-300293" type="indirect"><org type="institution" xml:id="struct-300293" status="OLD"><orgName>Institut National Polytechnique de Lorraine</orgName>
<orgName type="acronym">INPL</orgName>
<date type="end">2011-12-31</date>
<desc><address><country key="FR"></country>
</address>
</desc>
</org>
</tutelle>
<tutelle active="#struct-2496" type="direct"><org type="laboratory" xml:id="struct-2496" status="OLD"><orgName>INRIA Lorraine</orgName>
<desc><address><addrLine>615 rue du Jardin Botanique 54600 Villers-lès-Nancy</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.inria.fr/centre-de-recherche-inria/nancy-grand-est</ref>
</desc>
<listRelation><relation active="#struct-300009" type="direct"></relation>
</listRelation>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
</affiliation>
</author>
<author><name sortKey="Mitjana, Margarida" sort="Mitjana, Margarida" uniqKey="Mitjana M" first="Margarida" last="Mitjana">Margarida Mitjana</name>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">HAL</idno>
<idno type="RBID">Hal:inria-00100504</idno>
<idno type="halId">inria-00100504</idno>
<idno type="halUri">https://hal.inria.fr/inria-00100504</idno>
<idno type="url">https://hal.inria.fr/inria-00100504</idno>
<date when="2001">2001</date>
<idno type="wicri:Area/Hal/Corpus">002642</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en">Gossiping in chordal rings under the line model</title>
<author><name sortKey="Barriere, Lali" sort="Barriere, Lali" uniqKey="Barriere L" first="Lali" last="Barrière">Lali Barrière</name>
</author>
<author><name sortKey="Cohen, Johanne" sort="Cohen, Johanne" uniqKey="Cohen J" first="Johanne" last="Cohen">Johanne Cohen</name>
<affiliation><hal:affiliation type="researchteam" xml:id="struct-2363" status="OLD"><idno type="RNSR">199621458W</idno>
<orgName>Software Tools for Telecommunications and Distributed Systems</orgName>
<orgName type="acronym">RESEDAS</orgName>
<desc><address><country key="FR"></country>
</address>
<ref type="url">http://www.inria.fr/equipes/resedas</ref>
</desc>
<listRelation><relation active="#struct-160" type="direct"></relation>
<relation name="UMR7503" active="#struct-441569" type="indirect"></relation>
<relation active="#struct-300009" type="indirect"></relation>
<relation active="#struct-300291" type="indirect"></relation>
<relation active="#struct-300292" type="indirect"></relation>
<relation active="#struct-300293" type="indirect"></relation>
<relation active="#struct-2496" type="direct"></relation>
</listRelation>
<tutelles><tutelle active="#struct-160" type="direct"><org type="laboratory" xml:id="struct-160" status="OLD"><orgName>Laboratoire Lorrain de Recherche en Informatique et ses Applications</orgName>
<orgName type="acronym">LORIA</orgName>
<desc><address><addrLine>Campus Scientifique BP 239 54506 Vandoeuvre-lès-Nancy Cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.loria.fr</ref>
</desc>
<listRelation><relation name="UMR7503" active="#struct-441569" type="direct"></relation>
<relation active="#struct-300009" type="direct"></relation>
<relation active="#struct-300291" type="direct"></relation>
<relation active="#struct-300292" type="direct"></relation>
<relation active="#struct-300293" type="direct"></relation>
</listRelation>
</org>
</tutelle>
<tutelle name="UMR7503" active="#struct-441569" type="indirect"><org type="institution" xml:id="struct-441569" status="VALID"><idno type="ISNI">0000000122597504</idno>
<idno type="IdRef">02636817X</idno>
<orgName>Centre National de la Recherche Scientifique</orgName>
<orgName type="acronym">CNRS</orgName>
<date type="start">1939-10-19</date>
<desc><address><country key="FR"></country>
</address>
<ref type="url">http://www.cnrs.fr/</ref>
</desc>
</org>
</tutelle>
<tutelle active="#struct-300009" type="indirect"><org type="institution" xml:id="struct-300009" status="VALID"><orgName>Institut National de Recherche en Informatique et en Automatique</orgName>
<orgName type="acronym">Inria</orgName>
<desc><address><addrLine>Domaine de VoluceauRocquencourt - BP 10578153 Le Chesnay Cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.inria.fr/en/</ref>
</desc>
</org>
</tutelle>
<tutelle active="#struct-300291" type="indirect"><org type="institution" xml:id="struct-300291" status="OLD"><orgName>Université Henri Poincaré - Nancy 1</orgName>
<orgName type="acronym">UHP</orgName>
<date type="end">2011-12-31</date>
<desc><address><addrLine>24-30 rue Lionnois, BP 60120, 54 003 NANCY cedex, France</addrLine>
<country key="FR"></country>
</address>
</desc>
</org>
</tutelle>
<tutelle active="#struct-300292" type="indirect"><org type="institution" xml:id="struct-300292" status="OLD"><orgName>Université Nancy 2</orgName>
<date type="end">2011-12-31</date>
<desc><address><addrLine>91 avenue de la Libération, BP 454, 54001 Nancy cedex</addrLine>
<country key="FR"></country>
</address>
</desc>
</org>
</tutelle>
<tutelle active="#struct-300293" type="indirect"><org type="institution" xml:id="struct-300293" status="OLD"><orgName>Institut National Polytechnique de Lorraine</orgName>
<orgName type="acronym">INPL</orgName>
<date type="end">2011-12-31</date>
<desc><address><country key="FR"></country>
</address>
</desc>
</org>
</tutelle>
<tutelle active="#struct-2496" type="direct"><org type="laboratory" xml:id="struct-2496" status="OLD"><orgName>INRIA Lorraine</orgName>
<desc><address><addrLine>615 rue du Jardin Botanique 54600 Villers-lès-Nancy</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.inria.fr/centre-de-recherche-inria/nancy-grand-est</ref>
</desc>
<listRelation><relation active="#struct-300009" type="direct"></relation>
</listRelation>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
</affiliation>
</author>
<author><name sortKey="Mitjana, Margarida" sort="Mitjana, Margarida" uniqKey="Mitjana M" first="Margarida" last="Mitjana">Margarida Mitjana</name>
</author>
</analytic>
<series><title level="j">Theoretical Computer Science</title>
<idno type="ISSN">0304-3975</idno>
<imprint><date type="datePub">2001</date>
</imprint>
</series>
</biblStruct>
</sourceDesc>
</fileDesc>
<profileDesc><textClass><keywords scheme="mix" xml:lang="fr"><term>1-port</term>
<term>communication de groupe</term>
<term>gossip</term>
<term>group communication</term>
<term>line model</term>
<term>modèle commute</term>
<term>one-port</term>
<term>échange total</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">This paper is devoted to the gossip (or all-to-all) problem in the chordal ring under the one-port line model. The 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 eÆciently as these networks. We propose polynomial algorithms to derive optimal or near optimal gossip protocols in the chordal ring.</div>
</front>
</TEI>
<hal api="V3"><titleStmt><title xml:lang="en">Gossiping in chordal rings under the line model</title>
<author role="aut"><persName><forename type="first">Lali</forename>
<surname>Barrière</surname>
</persName>
<email></email>
<idno type="halauthor">131779</idno>
<orgName ref="#struct-365104"></orgName>
</author>
<author role="aut"><persName><forename type="first">Johanne</forename>
<surname>Cohen</surname>
</persName>
<email>Johanne.Cohen@loria.fr</email>
<idno type="idhal">johanne-cohen</idno>
<idno type="halauthor">130081</idno>
<orgName ref="#struct-364475"></orgName>
<affiliation ref="#struct-2363"></affiliation>
</author>
<author role="aut"><persName><forename type="first">Margarida</forename>
<surname>Mitjana</surname>
</persName>
<email></email>
<idno type="halauthor">131780</idno>
<orgName ref="#struct-365104"></orgName>
</author>
<editor role="depositor"><persName><forename>Publications</forename>
<surname>Loria</surname>
</persName>
<email>publications@loria.fr</email>
</editor>
</titleStmt>
<editionStmt><edition n="v1" type="current"><date type="whenSubmitted">2006-09-26 14:46:20</date>
<date type="whenModified">2016-05-19 01:09:07</date>
<date type="whenReleased">2006-09-28 15:22:47</date>
<date type="whenProduced">2001</date>
</edition>
<respStmt><resp>contributor</resp>
<name key="108626"><persName><forename>Publications</forename>
<surname>Loria</surname>
</persName>
<email>publications@loria.fr</email>
</name>
</respStmt>
</editionStmt>
<publicationStmt><distributor>CCSD</distributor>
<idno type="halId">inria-00100504</idno>
<idno type="halUri">https://hal.inria.fr/inria-00100504</idno>
<idno type="halBibtex">barriere:inria-00100504</idno>
<idno type="halRefHtml">Theoretical Computer Science, Elsevier, 2001, 264 (1), pp.53-64</idno>
<idno type="halRef">Theoretical Computer Science, Elsevier, 2001, 264 (1), pp.53-64</idno>
</publicationStmt>
<seriesStmt><idno type="stamp" n="INRIA">INRIA - Institut National de Recherche en Informatique et en Automatique</idno>
<idno type="stamp" n="CNRS">CNRS - Centre national de la recherche scientifique</idno>
<idno type="stamp" n="INPL">Institut National Polytechnique de Lorraine</idno>
<idno type="stamp" n="LORIA2">Publications du LORIA</idno>
<idno type="stamp" n="LORIA">LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications</idno>
<idno type="stamp" n="INRIA-NANCY-GRAND-EST">INRIA Nancy - Grand Est</idno>
<idno type="stamp" n="UNIV-LORRAINE">Université de Lorraine</idno>
<idno type="stamp" n="INRIA-LORRAINE">INRIA Nancy - Grand Est</idno>
<idno type="stamp" n="LABO-LORIA-SET" p="LORIA">LABO-LORIA-SET</idno>
</seriesStmt>
<notesStmt><note type="commentary">Article dans revue scientifique avec comité de lecture.</note>
<note type="audience" n="1">Not set</note>
<note type="popular" n="0">No</note>
<note type="peer" n="1">Yes</note>
</notesStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en">Gossiping in chordal rings under the line model</title>
<author role="aut"><persName><forename type="first">Lali</forename>
<surname>Barrière</surname>
</persName>
<idno type="halAuthorId">131779</idno>
<orgName ref="#struct-365104"></orgName>
</author>
<author role="aut"><persName><forename type="first">Johanne</forename>
<surname>Cohen</surname>
</persName>
<email>Johanne.Cohen@loria.fr</email>
<idno type="idHal">johanne-cohen</idno>
<idno type="halAuthorId">130081</idno>
<orgName ref="#struct-364475"></orgName>
<affiliation ref="#struct-2363"></affiliation>
</author>
<author role="aut"><persName><forename type="first">Margarida</forename>
<surname>Mitjana</surname>
</persName>
<idno type="halAuthorId">131780</idno>
<orgName ref="#struct-365104"></orgName>
</author>
</analytic>
<monogr><idno type="localRef">A01-R-152 || barriere01a</idno>
<idno type="halJournalId" status="VALID">19594</idno>
<idno type="issn">0304-3975</idno>
<title level="j">Theoretical Computer Science</title>
<imprint><publisher>Elsevier</publisher>
<biblScope unit="volume">264</biblScope>
<biblScope unit="issue">1</biblScope>
<biblScope unit="pp">53-64</biblScope>
<date type="datePub">2001</date>
</imprint>
</monogr>
</biblStruct>
</sourceDesc>
<profileDesc><langUsage><language ident="en">English</language>
</langUsage>
<textClass><keywords scheme="author"><term xml:lang="fr">group communication</term>
<term xml:lang="fr">échange total</term>
<term xml:lang="fr">gossip</term>
<term xml:lang="fr">one-port</term>
<term xml:lang="fr">line model</term>
<term xml:lang="fr">1-port</term>
<term xml:lang="fr">modèle commute</term>
<term xml:lang="fr">communication de groupe</term>
</keywords>
<classCode scheme="halDomain" n="info.info-oh">Computer Science [cs]/Other [cs.OH]</classCode>
<classCode scheme="halTypology" n="ART">Journal articles</classCode>
</textClass>
<abstract xml:lang="en">This paper is devoted to the gossip (or all-to-all) problem in the chordal ring under the one-port line model. The 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 eÆciently as these networks. We propose polynomial algorithms to derive optimal or near optimal gossip protocols in the chordal ring.</abstract>
</profileDesc>
</hal>
</record>

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Hal/Corpus

HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 002642 | SxmlIndent | more

HfdSelect -h $EXPLOR_AREA/Data/Hal/Corpus/biblio.hfd -nk 002642 | SxmlIndent | more

Pour mettre un lien sur cette page dans le réseau Wicri

{{Explor lien
   |wiki=    Wicri/Lorraine
   |area=    InforLorV4
   |flux=    Hal
   |étape=   Corpus
   |type=    RBID
   |clé=     Hal:inria-00100504
   |texte=   Gossiping in chordal rings under the line model
}}

This area was generated with Dilib version V0.6.33.
Data generation: Mon Jun 10 21:56:28 2019. Site generation: Fri Feb 25 15:29:27 2022

	Serveur d'exploration sur la recherche en informatique en Lorraine
	Attention, ce site est en cours de développement ! Attention, site généré par des moyens informatiques à partir de corpus bruts. Les informations ne sont donc pas validées.

Serveur d'exploration sur la recherche en informatique en Lorraine

Gossiping in chordal rings under the line model

Gossiping in chordal rings under the line model

Source :

Descripteurs français

Abstract

Links to Exploration step

Le document en format XML

Pour manipuler ce document sous Unix (Dilib)

Pour mettre un lien sur cette page dans le réseau Wicri