Messages scheduling for data redistribution between clusters
Identifieur interne : 000592 ( PascalFrancis/Checkpoint ); précédent : 000591; suivant : 000593Messages scheduling for data redistribution between clusters
Auteurs : Johanne Cohen [France] ; Emmanuel Jeannot [France] ; Nicolas Padoy [France]Source :
- Lecture notes in computer science [ 0302-9743 ] ; 2004.
Descripteurs français
- Pascal (Inist)
English descriptors
- KwdEn :
Abstract
In this paper we study the general problem of parallel data redistribution over a network. Given a set of communications between two parallel machines interconnected by a backbone, we wish to minimize the total time required for the completion of all communications assuming that communications can be preempted and that preemption comes with an extra cost. Our problem, called k-Preemptive bipartite scheduling (KPBS) is proven to be NP-Complete. Moreover we prove that approximating KPBS problem within a ratio number smaller that 3/4 is impossible unless P = NP. In spite of this negative result, we study a lower bound on the cost of KPBS problem in terms of its parameters, and we propose an approximation algorithm with ratio 2 and fast heuristics.
Affiliations:
Links toward previous steps (curation, corpus...)
Links to Exploration step
Pascal:04-0280482Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">Messages scheduling for data redistribution between clusters</title><author><name sortKey="Cohen, Johanne" sort="Cohen, Johanne" uniqKey="Cohen J" first="Johanne" last="Cohen">Johanne Cohen</name><affiliation wicri:level="3"><inist:fA14 i1="01"><s1>CNRS LORIA</s1><s2>Vandoeuvre les Nancy</s2><s3>FRA</s3><sZ>1 aut.</sZ></inist:fA14><country>France</country><placeName><region type="region" nuts="2">Grand Est</region><region type="old region" nuts="2">Lorraine (région)</region><settlement type="city">Vandœuvre-lès-Nancy</settlement><settlement type="city" wicri:auto="agglo">Nancy</settlement></placeName></affiliation></author><author><name sortKey="Jeannot, Emmanuel" sort="Jeannot, Emmanuel" uniqKey="Jeannot E" first="Emmanuel" last="Jeannot">Emmanuel Jeannot</name><affiliation wicri:level="3"><inist:fA14 i1="02"><s1>LORIA, Université H. Poincaré</s1><s2>Vandoeuvre les Nancy</s2><s3>FRA</s3><sZ>2 aut.</sZ></inist:fA14><country>France</country><placeName><region type="region" nuts="2">Grand Est</region><region type="old region" nuts="2">Lorraine (région)</region><settlement type="city">Vandœuvre-lès-Nancy</settlement><settlement type="city" wicri:auto="agglo">Nancy</settlement></placeName></affiliation></author><author><name sortKey="Padoy, Nicolas" sort="Padoy, Nicolas" uniqKey="Padoy N" first="Nicolas" last="Padoy">Nicolas Padoy</name><affiliation wicri:level="1"><inist:fA14 i1="03"><s1>Ecole Normale Supérieure de Lyon</s1><s3>FRA</s3><sZ>3 aut.</sZ></inist:fA14><country>France</country><wicri:noRegion>Ecole Normale Supérieure de Lyon</wicri:noRegion><wicri:noRegion>Ecole Normale Supérieure de Lyon</wicri:noRegion></affiliation></author></titleStmt><publicationStmt><idno type="wicri:source">INIST</idno><idno type="inist">04-0280482</idno><date when="2004">2004</date><idno type="stanalyst">PASCAL 04-0280482 INIST</idno><idno type="RBID">Pascal:04-0280482</idno><idno type="wicri:Area/PascalFrancis/Corpus">000676</idno><idno type="wicri:Area/PascalFrancis/Curation">000365</idno><idno type="wicri:Area/PascalFrancis/Checkpoint">000592</idno><idno type="wicri:explorRef" wicri:stream="PascalFrancis" wicri:step="Checkpoint">000592</idno></publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">Messages scheduling for data redistribution between clusters</title><author><name sortKey="Cohen, Johanne" sort="Cohen, Johanne" uniqKey="Cohen J" first="Johanne" last="Cohen">Johanne Cohen</name><affiliation wicri:level="3"><inist:fA14 i1="01"><s1>CNRS LORIA</s1><s2>Vandoeuvre les Nancy</s2><s3>FRA</s3><sZ>1 aut.</sZ></inist:fA14><country>France</country><placeName><region type="region" nuts="2">Grand Est</region><region type="old region" nuts="2">Lorraine (région)</region><settlement type="city">Vandœuvre-lès-Nancy</settlement><settlement type="city" wicri:auto="agglo">Nancy</settlement></placeName></affiliation></author><author><name sortKey="Jeannot, Emmanuel" sort="Jeannot, Emmanuel" uniqKey="Jeannot E" first="Emmanuel" last="Jeannot">Emmanuel Jeannot</name><affiliation wicri:level="3"><inist:fA14 i1="02"><s1>LORIA, Université H. Poincaré</s1><s2>Vandoeuvre les Nancy</s2><s3>FRA</s3><sZ>2 aut.</sZ></inist:fA14><country>France</country><placeName><region type="region" nuts="2">Grand Est</region><region type="old region" nuts="2">Lorraine (région)</region><settlement type="city">Vandœuvre-lès-Nancy</settlement><settlement type="city" wicri:auto="agglo">Nancy</settlement></placeName></affiliation></author><author><name sortKey="Padoy, Nicolas" sort="Padoy, Nicolas" uniqKey="Padoy N" first="Nicolas" last="Padoy">Nicolas Padoy</name><affiliation wicri:level="1"><inist:fA14 i1="03"><s1>Ecole Normale Supérieure de Lyon</s1><s3>FRA</s3><sZ>3 aut.</sZ></inist:fA14><country>France</country><wicri:noRegion>Ecole Normale Supérieure de Lyon</wicri:noRegion><wicri:noRegion>Ecole Normale Supérieure de Lyon</wicri:noRegion></affiliation></author></analytic><series><title level="j" type="main">Lecture notes in computer science</title><idno type="ISSN">0302-9743</idno><imprint><date when="2004">2004</date></imprint></series></biblStruct></sourceDesc><seriesStmt><title level="j" type="main">Lecture notes in computer science</title><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Approximation algorithm</term><term>Backbone</term><term>Completeness</term><term>Distributed memory</term><term>Distributed system</term><term>Heuristic method</term><term>Lower bound</term><term>Parallel machines</term><term>Preemption</term><term>Scheduling</term></keywords><keywords scheme="Pascal" xml:lang="fr"><term>Système réparti</term><term>Mémoire répartie</term><term>Machine parallèle</term><term>Réseau fédérateur</term><term>Ordonnancement</term><term>Complétude</term><term>Borne inférieure</term><term>Algorithme approximation</term><term>Méthode heuristique</term><term>Préemption</term></keywords></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">In this paper we study the general problem of parallel data redistribution over a network. Given a set of communications between two parallel machines interconnected by a backbone, we wish to minimize the total time required for the completion of all communications assuming that communications can be preempted and that preemption comes with an extra cost. Our problem, called k-Preemptive bipartite scheduling (KPBS) is proven to be NP-Complete. Moreover we prove that approximating KPBS problem within a ratio number smaller that 3/4 is impossible unless P = NP. In spite of this negative result, we study a lower bound on the cost of KPBS problem in terms of its parameters, and we propose an approximation algorithm with ratio 2 and fast heuristics.</div></front></TEI><inist><standard h6="B"><pA><fA01 i1="01" i2="1"><s0>0302-9743</s0></fA01><fA05><s2>3019</s2></fA05><fA08 i1="01" i2="1" l="ENG"><s1>Messages scheduling for data redistribution between clusters</s1></fA08><fA09 i1="01" i2="1" l="ENG"><s1>PPAM 2003 : parallel processing and applied mathematics : Czestochowa, 7-10 September 2003, revised papers</s1></fA09><fA11 i1="01" i2="1"><s1>COHEN (Johanne)</s1></fA11><fA11 i1="02" i2="1"><s1>JEANNOT (Emmanuel)</s1></fA11><fA11 i1="03" i2="1"><s1>PADOY (Nicolas)</s1></fA11><fA12 i1="01" i2="1"><s1>WYRZYKOWSKI (Roman)</s1><s9>ed.</s9></fA12><fA12 i1="02" i2="1"><s1>DONGARRA (Jack)</s1><s9>ed.</s9></fA12><fA12 i1="03" i2="1"><s1>PAPRZYCKI (Marcin)</s1><s9>ed.</s9></fA12><fA12 i1="04" i2="1"><s1>WASNIEWSKI (Jerzy)</s1><s9>ed.</s9></fA12><fA14 i1="01"><s1>CNRS LORIA</s1><s2>Vandoeuvre les Nancy</s2><s3>FRA</s3><sZ>1 aut.</sZ></fA14><fA14 i1="02"><s1>LORIA, Université H. Poincaré</s1><s2>Vandoeuvre les Nancy</s2><s3>FRA</s3><sZ>2 aut.</sZ></fA14><fA14 i1="03"><s1>Ecole Normale Supérieure de Lyon</s1><s3>FRA</s3><sZ>3 aut.</sZ></fA14><fA20><s1>896-906</s1></fA20><fA21><s1>2004</s1></fA21><fA23 i1="01"><s0>ENG</s0></fA23><fA26 i1="01"><s0>3-540-21946-3</s0></fA26><fA43 i1="01"><s1>INIST</s1><s2>16343</s2><s5>354000117869031160</s5></fA43><fA44><s0>0000</s0><s1>© 2004 INIST-CNRS. All rights reserved.</s1></fA44><fA45><s0>18 ref.</s0></fA45><fA47 i1="01" i2="1"><s0>04-0280482</s0></fA47><fA60><s1>P</s1><s2>C</s2></fA60><fA61><s0>A</s0></fA61><fA64 i1="01" i2="1"><s0>Lecture notes in computer science</s0></fA64><fA66 i1="01"><s0>DEU</s0></fA66><fC01 i1="01" l="ENG"><s0>In this paper we study the general problem of parallel data redistribution over a network. Given a set of communications between two parallel machines interconnected by a backbone, we wish to minimize the total time required for the completion of all communications assuming that communications can be preempted and that preemption comes with an extra cost. Our problem, called k-Preemptive bipartite scheduling (KPBS) is proven to be NP-Complete. Moreover we prove that approximating KPBS problem within a ratio number smaller that 3/4 is impossible unless P = NP. In spite of this negative result, we study a lower bound on the cost of KPBS problem in terms of its parameters, and we propose an approximation algorithm with ratio 2 and fast heuristics.</s0></fC01><fC02 i1="01" i2="X"><s0>001D02B04</s0></fC02><fC03 i1="01" i2="X" l="FRE"><s0>Système réparti</s0><s5>01</s5></fC03><fC03 i1="01" i2="X" l="ENG"><s0>Distributed system</s0><s5>01</s5></fC03><fC03 i1="01" i2="X" l="SPA"><s0>Sistema repartido</s0><s5>01</s5></fC03><fC03 i1="02" i2="X" l="FRE"><s0>Mémoire répartie</s0><s5>09</s5></fC03><fC03 i1="02" i2="X" l="ENG"><s0>Distributed memory</s0><s5>09</s5></fC03><fC03 i1="02" i2="X" l="SPA"><s0>Memoria compartida</s0><s5>09</s5></fC03><fC03 i1="03" i2="3" l="FRE"><s0>Machine parallèle</s0><s5>18</s5></fC03><fC03 i1="03" i2="3" l="ENG"><s0>Parallel machines</s0><s5>18</s5></fC03><fC03 i1="04" i2="X" l="FRE"><s0>Réseau fédérateur</s0><s5>19</s5></fC03><fC03 i1="04" i2="X" l="ENG"><s0>Backbone</s0><s5>19</s5></fC03><fC03 i1="04" i2="X" l="SPA"><s0>Eje troncal</s0><s5>19</s5></fC03><fC03 i1="05" i2="X" l="FRE"><s0>Ordonnancement</s0><s5>23</s5></fC03><fC03 i1="05" i2="X" l="ENG"><s0>Scheduling</s0><s5>23</s5></fC03><fC03 i1="05" i2="X" l="SPA"><s0>Reglamento</s0><s5>23</s5></fC03><fC03 i1="06" i2="X" l="FRE"><s0>Complétude</s0><s5>24</s5></fC03><fC03 i1="06" i2="X" l="ENG"><s0>Completeness</s0><s5>24</s5></fC03><fC03 i1="06" i2="X" l="SPA"><s0>Completitud</s0><s5>24</s5></fC03><fC03 i1="07" i2="X" l="FRE"><s0>Borne inférieure</s0><s5>25</s5></fC03><fC03 i1="07" i2="X" l="ENG"><s0>Lower bound</s0><s5>25</s5></fC03><fC03 i1="07" i2="X" l="SPA"><s0>Cota inferior</s0><s5>25</s5></fC03><fC03 i1="08" i2="X" l="FRE"><s0>Algorithme approximation</s0><s5>26</s5></fC03><fC03 i1="08" i2="X" l="ENG"><s0>Approximation algorithm</s0><s5>26</s5></fC03><fC03 i1="08" i2="X" l="SPA"><s0>Algoritmo aproximación</s0><s5>26</s5></fC03><fC03 i1="09" i2="X" l="FRE"><s0>Méthode heuristique</s0><s5>27</s5></fC03><fC03 i1="09" i2="X" l="ENG"><s0>Heuristic method</s0><s5>27</s5></fC03><fC03 i1="09" i2="X" l="SPA"><s0>Método heurístico</s0><s5>27</s5></fC03><fC03 i1="10" i2="X" l="FRE"><s0>Préemption</s0><s4>CD</s4><s5>96</s5></fC03><fC03 i1="10" i2="X" l="ENG"><s0>Preemption</s0><s4>CD</s4><s5>96</s5></fC03><fC03 i1="10" i2="X" l="SPA"><s0>Preempción</s0><s4>CD</s4><s5>96</s5></fC03><fN21><s1>173</s1></fN21><fN44 i1="01"><s1>OTO</s1></fN44><fN82><s1>OTO</s1></fN82></pA><pR><fA30 i1="01" i2="1" l="ENG"><s1>Parallel processing and applied mathematics. International conference</s1><s3>Czestochowa POL</s3><s4>2003-09-07</s4></fA30></pR></standard></inist><affiliations><list><country><li>France</li></country><region><li>Grand Est</li><li>Lorraine (région)</li></region><settlement><li>Nancy</li><li>Vandœuvre-lès-Nancy</li></settlement></list><tree><country name="France"><region name="Grand Est"><name sortKey="Cohen, Johanne" sort="Cohen, Johanne" uniqKey="Cohen J" first="Johanne" last="Cohen">Johanne Cohen</name></region><name sortKey="Jeannot, Emmanuel" sort="Jeannot, Emmanuel" uniqKey="Jeannot E" first="Emmanuel" last="Jeannot">Emmanuel Jeannot</name><name sortKey="Padoy, Nicolas" sort="Padoy, Nicolas" uniqKey="Padoy N" first="Nicolas" last="Padoy">Nicolas Padoy</name></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/PascalFrancis/Checkpoint
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000592 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Checkpoint/biblio.hfd -nk 000592 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= PascalFrancis
|étape= Checkpoint
|type= RBID
|clé= Pascal:04-0280482
|texte= Messages scheduling for data redistribution between clusters
}}
| This area was generated with Dilib version V0.6.33. |  |