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.

Modeling, Predicting and Optimizing Redistribution between Clusters on Low Latency Networks

Identifieur interne : 003309 ( Hal/Curation ); précédent : 003308; suivant : 003310

Modeling, Predicting and Optimizing Redistribution between Clusters on Low Latency Networks

Auteurs : Emmanuel Jeannot [France] ; Frédéric Wagner [France]

Source :

RBID : Hal:inria-00097260

English descriptors

Abstract

In this paper we study the problem of scheduling messages between two parallelmachines connected by a low latency network during a data redistribution. We compare two approaches. In the first approach no scheduling is performed. Since all the messages cannot be transmitted at the same time, the transport layer has to manage the congestion. In the second approach we use two higher-level scheduling algorithms proposed in our previous work [10] called GGP and OGGP. The contribution of this paper is the following: We show that the redistribution time with scheduling is always better than the brute-force approach (up to 30%). As this speedup depends on the input redistribution pattern, we propose a modelization of the behavior of both approaches and show that we are able to accurately predict the redistribution time with or without scheduling and thus able to choose for each pattern whether or not to schedule the communications.

Url:
DOI: 10.1109/AINA.2006.232

Links toward previous steps (curation, corpus...)


Links to Exploration step

Hal:inria-00097260

Le document en format XML

<record>
<TEI>
<teiHeader>
<fileDesc>
<titleStmt>
<title xml:lang="en">Modeling, Predicting and Optimizing Redistribution between Clusters on Low Latency Networks</title>
<author>
<name sortKey="Jeannot, Emmanuel" sort="Jeannot, Emmanuel" uniqKey="Jeannot E" first="Emmanuel" last="Jeannot">Emmanuel Jeannot</name>
<affiliation wicri:level="1">
<hal:affiliation type="researchteam" xml:id="struct-2346" status="OLD">
<idno type="RNSR">200718299P</idno>
<orgName>Algorithms for the Grid</orgName>
<orgName type="acronym">ALGORILLE</orgName>
<desc>
<address>
<country key="FR"></country>
</address>
</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>
<country>France</country>
<placeName>
<settlement type="city">Nancy</settlement>
<region type="region" nuts="2">Grand Est</region>
<region type="old region" nuts="2">Lorraine (région)</region>
</placeName>
<orgName type="university">Université Nancy 2</orgName>
<orgName type="institution" wicri:auto="newGroup">Université de Lorraine</orgName>
<placeName>
<settlement type="city">Nancy</settlement>
<region type="region" nuts="2">Grand Est</region>
<region type="old region" nuts="2">Lorraine (région)</region>
</placeName>
<orgName type="university">Institut national polytechnique de Lorraine</orgName>
<orgName type="institution" wicri:auto="newGroup">Université de Lorraine</orgName>
</affiliation>
</author>
<author>
<name sortKey="Wagner, Frederic" sort="Wagner, Frederic" uniqKey="Wagner F" first="Frédéric" last="Wagner">Frédéric Wagner</name>
<affiliation wicri:level="1">
<hal:affiliation type="laboratory" xml:id="struct-100376" status="VALID">
<orgName>Laboratoire Informatique d'Avignon</orgName>
<orgName type="acronym">LIA</orgName>
<desc>
<address>
<addrLine>339 Chemin des Meinajaries Agroparc BP 1228 84911 Avignon cedex 9</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://lia.univ-avignon.fr/</ref>
</desc>
<listRelation>
<relation active="#struct-195507" type="direct"></relation>
<relation active="#struct-302221" type="direct"></relation>
</listRelation>
<tutelles>
<tutelle active="#struct-195507" type="direct">
<org type="institution" xml:id="struct-195507" status="VALID">
<orgName>Université d'Avignon et des Pays de Vaucluse</orgName>
<orgName type="acronym">UAPV</orgName>
<desc>
<address>
<addrLine>74 rue Louis Pasteur - 84 029 Avignon cedex 1</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.univ-avignon.fr/</ref>
</desc>
</org>
</tutelle>
<tutelle active="#struct-302221" type="direct">
<org type="institution" xml:id="struct-302221" status="VALID">
<orgName>Centre d'Enseignement et de Recherche en Informatique - CERI</orgName>
<desc>
<address>
<country key="FR"></country>
</address>
</desc>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
<country>France</country>
<placeName>
<settlement type="city">Avignon</settlement>
<region type="region" nuts="2">Provence-Alpes-Côte d'Azur</region>
</placeName>
<orgName type="university">Université d'Avignon</orgName>
</affiliation>
</author>
</titleStmt>
<publicationStmt>
<idno type="wicri:source">HAL</idno>
<idno type="RBID">Hal:inria-00097260</idno>
<idno type="halId">inria-00097260</idno>
<idno type="halUri">https://hal.inria.fr/inria-00097260</idno>
<idno type="url">https://hal.inria.fr/inria-00097260</idno>
<idno type="doi">10.1109/AINA.2006.232</idno>
<date when="2006">2006</date>
<idno type="wicri:Area/Hal/Corpus">003309</idno>
<idno type="wicri:Area/Hal/Curation">003309</idno>
</publicationStmt>
<sourceDesc>
<biblStruct>
<analytic>
<title xml:lang="en">Modeling, Predicting and Optimizing Redistribution between Clusters on Low Latency Networks</title>
<author>
<name sortKey="Jeannot, Emmanuel" sort="Jeannot, Emmanuel" uniqKey="Jeannot E" first="Emmanuel" last="Jeannot">Emmanuel Jeannot</name>
<affiliation wicri:level="1">
<hal:affiliation type="researchteam" xml:id="struct-2346" status="OLD">
<idno type="RNSR">200718299P</idno>
<orgName>Algorithms for the Grid</orgName>
<orgName type="acronym">ALGORILLE</orgName>
<desc>
<address>
<country key="FR"></country>
</address>
</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>
<country>France</country>
<placeName>
<settlement type="city">Nancy</settlement>
<region type="region" nuts="2">Grand Est</region>
<region type="old region" nuts="2">Lorraine (région)</region>
</placeName>
<orgName type="university">Université Nancy 2</orgName>
<orgName type="institution" wicri:auto="newGroup">Université de Lorraine</orgName>
<placeName>
<settlement type="city">Nancy</settlement>
<region type="region" nuts="2">Grand Est</region>
<region type="old region" nuts="2">Lorraine (région)</region>
</placeName>
<orgName type="university">Institut national polytechnique de Lorraine</orgName>
<orgName type="institution" wicri:auto="newGroup">Université de Lorraine</orgName>
</affiliation>
</author>
<author>
<name sortKey="Wagner, Frederic" sort="Wagner, Frederic" uniqKey="Wagner F" first="Frédéric" last="Wagner">Frédéric Wagner</name>
<affiliation wicri:level="1">
<hal:affiliation type="laboratory" xml:id="struct-100376" status="VALID">
<orgName>Laboratoire Informatique d'Avignon</orgName>
<orgName type="acronym">LIA</orgName>
<desc>
<address>
<addrLine>339 Chemin des Meinajaries Agroparc BP 1228 84911 Avignon cedex 9</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://lia.univ-avignon.fr/</ref>
</desc>
<listRelation>
<relation active="#struct-195507" type="direct"></relation>
<relation active="#struct-302221" type="direct"></relation>
</listRelation>
<tutelles>
<tutelle active="#struct-195507" type="direct">
<org type="institution" xml:id="struct-195507" status="VALID">
<orgName>Université d'Avignon et des Pays de Vaucluse</orgName>
<orgName type="acronym">UAPV</orgName>
<desc>
<address>
<addrLine>74 rue Louis Pasteur - 84 029 Avignon cedex 1</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.univ-avignon.fr/</ref>
</desc>
</org>
</tutelle>
<tutelle active="#struct-302221" type="direct">
<org type="institution" xml:id="struct-302221" status="VALID">
<orgName>Centre d'Enseignement et de Recherche en Informatique - CERI</orgName>
<desc>
<address>
<country key="FR"></country>
</address>
</desc>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
<country>France</country>
<placeName>
<settlement type="city">Avignon</settlement>
<region type="region" nuts="2">Provence-Alpes-Côte d'Azur</region>
</placeName>
<orgName type="university">Université d'Avignon</orgName>
</affiliation>
</author>
</analytic>
<idno type="DOI">10.1109/AINA.2006.232</idno>
</biblStruct>
</sourceDesc>
</fileDesc>
<profileDesc>
<textClass>
<keywords scheme="mix" xml:lang="en">
<term>Code-coupling</term>
<term>cluster computing</term>
<term>message scheduling</term>
<term>modelization</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front>
<div type="abstract" xml:lang="en">In this paper we study the problem of scheduling messages between two parallelmachines connected by a low latency network during a data redistribution. We compare two approaches. In the first approach no scheduling is performed. Since all the messages cannot be transmitted at the same time, the transport layer has to manage the congestion. In the second approach we use two higher-level scheduling algorithms proposed in our previous work [10] called GGP and OGGP. The contribution of this paper is the following: We show that the redistribution time with scheduling is always better than the brute-force approach (up to 30%). As this speedup depends on the input redistribution pattern, we propose a modelization of the behavior of both approaches and show that we are able to accurately predict the redistribution time with or without scheduling and thus able to choose for each pattern whether or not to schedule the communications.</div>
</front>
</TEI>
<hal api="V3">
<titleStmt>
<title xml:lang="en">Modeling, Predicting and Optimizing Redistribution between Clusters on Low Latency Networks</title>
<author role="aut">
<persName>
<forename type="first">Emmanuel</forename>
<surname>Jeannot</surname>
</persName>
<email></email>
<idno type="halauthor">100132</idno>
<orgName ref="#struct-300009"></orgName>
<affiliation ref="#struct-2346"></affiliation>
</author>
<author role="aut">
<persName>
<forename type="first">Frédéric</forename>
<surname>Wagner</surname>
</persName>
<email></email>
<idno type="halauthor">128551</idno>
<orgName ref="#struct-364465"></orgName>
<affiliation ref="#struct-100376"></affiliation>
</author>
<editor role="depositor">
<persName>
<forename>Emmanuel</forename>
<surname>Jeannot</surname>
</persName>
<email>emmanuel.jeannot@inria.fr</email>
</editor>
</titleStmt>
<editionStmt>
<edition n="v1" type="current">
<date type="whenSubmitted">2006-09-21 11:55:07</date>
<date type="whenModified">2016-05-18 08:58:05</date>
<date type="whenReleased">2006-09-21 11:55:07</date>
<date type="whenProduced">2006</date>
</edition>
<respStmt>
<resp>contributor</resp>
<name key="103195">
<persName>
<forename>Emmanuel</forename>
<surname>Jeannot</surname>
</persName>
<email>emmanuel.jeannot@inria.fr</email>
</name>
</respStmt>
</editionStmt>
<publicationStmt>
<distributor>CCSD</distributor>
<idno type="halId">inria-00097260</idno>
<idno type="halUri">https://hal.inria.fr/inria-00097260</idno>
<idno type="halBibtex">jeannot:inria-00097260</idno>
<idno type="halRefHtml">The First International Symposium on Frontiers in Networking with Applications - FINA 2006 (AINA 2006 additional workshop), 2006, Vienna, Austria. IEEE, pp.793-797, 2006, <10.1109/AINA.2006.232></idno>
<idno type="halRef">The First International Symposium on Frontiers in Networking with Applications - FINA 2006 (AINA 2006 additional workshop), 2006, Vienna, Austria. IEEE, pp.793-797, 2006, <10.1109/AINA.2006.232></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="UNIV-AVIGNON">Université d'Avignon</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="INRIA-NANCY-GRAND-EST">INRIA Nancy - Grand Est</idno>
<idno type="stamp" n="LORIA">LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications</idno>
<idno type="stamp" n="LORIA-NSS" p="LORIA">Réseaux, systèmes et services</idno>
<idno type="stamp" n="INRIA2">INRIA 2</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>
<idno type="stamp" n="UNIV-LORRAINE">Université de Lorraine</idno>
</seriesStmt>
<notesStmt>
<note type="audience" n="1">Not set</note>
<note type="invited" n="0">No</note>
<note type="popular" n="0">No</note>
<note type="peer" n="1">Yes</note>
<note type="proceedings" n="1">Yes</note>
</notesStmt>
<sourceDesc>
<biblStruct>
<analytic>
<title xml:lang="en">Modeling, Predicting and Optimizing Redistribution between Clusters on Low Latency Networks</title>
<author role="aut">
<persName>
<forename type="first">Emmanuel</forename>
<surname>Jeannot</surname>
</persName>
<idno type="halAuthorId">100132</idno>
<orgName ref="#struct-300009"></orgName>
<affiliation ref="#struct-2346"></affiliation>
</author>
<author role="aut">
<persName>
<forename type="first">Frédéric</forename>
<surname>Wagner</surname>
</persName>
<idno type="halAuthorId">128551</idno>
<orgName ref="#struct-364465"></orgName>
<affiliation ref="#struct-100376"></affiliation>
</author>
</analytic>
<monogr>
<meeting>
<title>The First International Symposium on Frontiers in Networking with Applications - FINA 2006 (AINA 2006 additional workshop)</title>
<date type="start">2006</date>
<settlement>Vienna</settlement>
<country key="AT">Austria</country>
</meeting>
<imprint>
<publisher>IEEE</publisher>
<biblScope unit="pp">793-797</biblScope>
<date type="datePub">2006</date>
</imprint>
</monogr>
<idno type="doi">10.1109/AINA.2006.232</idno>
</biblStruct>
</sourceDesc>
<profileDesc>
<langUsage>
<language ident="en">English</language>
</langUsage>
<textClass>
<keywords scheme="author">
<term xml:lang="en">Code-coupling</term>
<term xml:lang="en">cluster computing</term>
<term xml:lang="en">message scheduling</term>
<term xml:lang="en">modelization</term>
</keywords>
<classCode scheme="halDomain" n="info.info-dc">Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC]</classCode>
<classCode scheme="halTypology" n="COMM">Conference papers</classCode>
</textClass>
<abstract xml:lang="en">In this paper we study the problem of scheduling messages between two parallelmachines connected by a low latency network during a data redistribution. We compare two approaches. In the first approach no scheduling is performed. Since all the messages cannot be transmitted at the same time, the transport layer has to manage the congestion. In the second approach we use two higher-level scheduling algorithms proposed in our previous work [10] called GGP and OGGP. The contribution of this paper is the following: We show that the redistribution time with scheduling is always better than the brute-force approach (up to 30%). As this speedup depends on the input redistribution pattern, we propose a modelization of the behavior of both approaches and show that we are able to accurately predict the redistribution time with or without scheduling and thus able to choose for each pattern whether or not to schedule the communications.</abstract>
</profileDesc>
</hal>
</record>

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Hal/Curation
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 003309 | SxmlIndent | more

Ou

HfdSelect -h $EXPLOR_AREA/Data/Hal/Curation/biblio.hfd -nk 003309 | SxmlIndent | more

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

{{Explor lien
   |wiki=    Wicri/Lorraine
   |area=    InforLorV4
   |flux=    Hal
   |étape=   Curation
   |type=    RBID
   |clé=     Hal:inria-00097260
   |texte=   Modeling, Predicting and Optimizing Redistribution between Clusters on Low Latency Networks
}}

Wicri

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