Experimental study of multi-criteria scheduling heuristics for GridRPC systems
Identifieur interne :
000629 ( PascalFrancis/Corpus );
précédent :
000628;
suivant :
000630
Experimental study of multi-criteria scheduling heuristics for GridRPC systems
Auteurs : Yves Caniou ;
Emmanuel JeannotSource :
-
Lecture notes in computer science [ 0302-9743 ] ; 2004.
RBID : Pascal:04-0507743
Descripteurs français
English descriptors
Abstract
We study in this paper several scheduling heuristics for GridRPC middlewares. When dealing with performance issue, the scheduling strategy is one of the most important feature. However, many heuristics implemented in available middlewares were not designed for this context (for instance MCT in NetSolve). Therefore, schedulers are not necessarily effective. We propose to use heuristics based on a non-intrusive module which is able to estimate the duration of all tasks in the system. Three criteria are examined among which the execution time of the application, e.g. the makespan. Experiments on a real platform show that the proposed heuristics outperform MCT for at least two of these three criteria.
Notice en format standard (ISO 2709)
Pour connaître la documentation sur le format Inist Standard.
| pA |
| A01 | 01 | 1 | | @0 0302-9743 |
|---|
| A05 | | | | @2 3149 |
|---|
| A08 | 01 | 1 | ENG | @1 Experimental study of multi-criteria scheduling heuristics for GridRPC systems |
|---|
| A09 | 01 | 1 | ENG | @1 Euro-Par 2004 parallel processing : Pisa, 31 August - 3 September 2004 |
|---|
| A11 | 01 | 1 | | @1 CANIOU (Yves) |
|---|
| A11 | 02 | 1 | | @1 JEANNOT (Emmanuel) |
|---|
| A12 | 01 | 1 | | @1 DANELUTTO (Marco) @9 ed. |
|---|
| A12 | 02 | 1 | | @1 LAFORENZA (Domenico) @9 ed. |
|---|
| A12 | 03 | 1 | | @1 VANNESCHI (Marco) @9 ed. |
|---|
| A14 | 01 | | | @1 LORIA, INRIA-Lorraine @3 FRA |
|---|
| A14 | 02 | | | @1 LORIA, Université Henri Poincaré @3 FRA |
|---|
| A20 | | | | @1 1048-1055 |
|---|
| A21 | | | | @1 2004 |
|---|
| A23 | 01 | | | @0 ENG |
|---|
| A26 | 01 | | | @0 3-540-22924-8 |
|---|
| A43 | 01 | | | @1 INIST @2 16343 @5 354000117914651220 |
|---|
| A44 | | | | @0 0000 @1 © 2004 INIST-CNRS. All rights reserved. |
|---|
| A45 | | | | @0 10 ref. |
|---|
| A47 | 01 | 1 | | @0 04-0507743 |
|---|
| A60 | | | | @1 P @2 C |
|---|
| A61 | | | | @0 A |
|---|
| A64 | 01 | 1 | | @0 Lecture notes in computer science |
|---|
| A66 | 01 | | | @0 DEU |
|---|
| C01 | 01 | | ENG | @0 We study in this paper several scheduling heuristics for GridRPC middlewares. When dealing with performance issue, the scheduling strategy is one of the most important feature. However, many heuristics implemented in available middlewares were not designed for this context (for instance MCT in NetSolve). Therefore, schedulers are not necessarily effective. We propose to use heuristics based on a non-intrusive module which is able to estimate the duration of all tasks in the system. Three criteria are examined among which the execution time of the application, e.g. the makespan. Experiments on a real platform show that the proposed heuristics outperform MCT for at least two of these three criteria. |
|---|
| C02 | 01 | X | | @0 001D02B04 |
|---|
| C03 | 01 | X | FRE | @0 Parallélisme @5 01 |
|---|
| C03 | 01 | X | ENG | @0 Parallelism @5 01 |
|---|
| C03 | 01 | X | SPA | @0 Paralelismo @5 01 |
|---|
| C03 | 02 | X | FRE | @0 Intergiciel @5 06 |
|---|
| C03 | 02 | X | ENG | @0 Middleware @5 06 |
|---|
| C03 | 02 | X | SPA | @0 Logicial personalizado @5 06 |
|---|
| C03 | 03 | X | FRE | @0 Temps exécution @5 07 |
|---|
| C03 | 03 | X | ENG | @0 Execution time @5 07 |
|---|
| C03 | 03 | X | SPA | @0 Tiempo ejecución @5 07 |
|---|
| C03 | 04 | X | FRE | @0 Durée @5 18 |
|---|
| C03 | 04 | X | ENG | @0 Duration @5 18 |
|---|
| C03 | 04 | X | SPA | @0 Duración @5 18 |
|---|
| C03 | 05 | X | FRE | @0 Temps total achèvement @5 19 |
|---|
| C03 | 05 | X | ENG | @0 Makespan @5 19 |
|---|
| C03 | 05 | X | SPA | @0 Tiempo total acabamiento @5 19 |
|---|
| C03 | 06 | X | FRE | @0 Analyse multicritère @5 23 |
|---|
| C03 | 06 | X | ENG | @0 Multicriteria analysis @5 23 |
|---|
| C03 | 06 | X | SPA | @0 Análisis multicriterio @5 23 |
|---|
| C03 | 07 | X | FRE | @0 Ordonnancement @5 24 |
|---|
| C03 | 07 | X | ENG | @0 Scheduling @5 24 |
|---|
| C03 | 07 | X | SPA | @0 Reglamento @5 24 |
|---|
| C03 | 08 | X | FRE | @0 Méthode heuristique @5 25 |
|---|
| C03 | 08 | X | ENG | @0 Heuristic method @5 25 |
|---|
| C03 | 08 | X | SPA | @0 Método heurístico @5 25 |
|---|
| N21 | | | | @1 285 |
|---|
| N44 | 01 | | | @1 OTO |
|---|
| N82 | | | | @1 OTO |
|---|
|
|---|
| pR |
| A30 | 01 | 1 | ENG | @1 International Euro-Par conference @2 10 @3 Pisa ITA @4 2004-08-31 |
|---|
|
|---|
Format Inist (serveur)
| NO : | PASCAL 04-0507743 INIST |
|---|
| ET : | Experimental study of multi-criteria scheduling heuristics for GridRPC systems |
|---|
| AU : | CANIOU (Yves); JEANNOT (Emmanuel); DANELUTTO (Marco); LAFORENZA (Domenico); VANNESCHI (Marco) |
|---|
| AF : | LORIA, INRIA-Lorraine/France; LORIA, Université Henri Poincaré/France |
|---|
| DT : | Publication en série; Congrès; Niveau analytique |
|---|
| SO : | Lecture notes in computer science; ISSN 0302-9743; Allemagne; Da. 2004; Vol. 3149; Pp. 1048-1055; Bibl. 10 ref. |
|---|
| LA : | Anglais |
|---|
| EA : | We study in this paper several scheduling heuristics for GridRPC middlewares. When dealing with performance issue, the scheduling strategy is one of the most important feature. However, many heuristics implemented in available middlewares were not designed for this context (for instance MCT in NetSolve). Therefore, schedulers are not necessarily effective. We propose to use heuristics based on a non-intrusive module which is able to estimate the duration of all tasks in the system. Three criteria are examined among which the execution time of the application, e.g. the makespan. Experiments on a real platform show that the proposed heuristics outperform MCT for at least two of these three criteria. |
|---|
| CC : | 001D02B04 |
|---|
| FD : | Parallélisme; Intergiciel; Temps exécution; Durée; Temps total achèvement; Analyse multicritère; Ordonnancement; Méthode heuristique |
|---|
| ED : | Parallelism; Middleware; Execution time; Duration; Makespan; Multicriteria analysis; Scheduling; Heuristic method |
|---|
| SD : | Paralelismo; Logicial personalizado; Tiempo ejecución; Duración; Tiempo total acabamiento; Análisis multicriterio; Reglamento; Método heurístico |
|---|
| LO : | INIST-16343.354000117914651220 |
|---|
| ID : | 04-0507743 |
|---|
Links to Exploration step
Pascal:04-0507743
Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">Experimental study of multi-criteria scheduling heuristics for GridRPC systems</title>
<author><name sortKey="Caniou, Yves" sort="Caniou, Yves" uniqKey="Caniou Y" first="Yves" last="Caniou">Yves Caniou</name>
<affiliation><inist:fA14 i1="01"><s1>LORIA, INRIA-Lorraine</s1>
<s3>FRA</s3>
</inist:fA14><affiliation><inist:fA14 i1="02"><s1>LORIA, Université Henri Poincaré</s1>
<s3>FRA</s3>
</inist:fA14><author><name sortKey="Jeannot, Emmanuel" sort="Jeannot, Emmanuel" uniqKey="Jeannot E" first="Emmanuel" last="Jeannot">Emmanuel Jeannot</name>
</author><publicationStmt><idno type="wicri:source">INIST</idno>
<idno type="inist">04-0507743</idno>
<date when="2004">2004</date>
<idno type="stanalyst">PASCAL 04-0507743 INIST</idno>
<idno type="RBID">Pascal:04-0507743</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">000629</idno>
</publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">Experimental study of multi-criteria scheduling heuristics for GridRPC systems</title>
<author><name sortKey="Caniou, Yves" sort="Caniou, Yves" uniqKey="Caniou Y" first="Yves" last="Caniou">Yves Caniou</name>
<affiliation><inist:fA14 i1="01"><s1>LORIA, INRIA-Lorraine</s1>
<s3>FRA</s3>
</inist:fA14><affiliation><inist:fA14 i1="02"><s1>LORIA, Université Henri Poincaré</s1>
<s3>FRA</s3>
</inist:fA14><author><name sortKey="Jeannot, Emmanuel" sort="Jeannot, Emmanuel" uniqKey="Jeannot E" first="Emmanuel" last="Jeannot">Emmanuel Jeannot</name>
</author><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><seriesStmt><title level="j" type="main">Lecture notes in computer science</title>
<idno type="ISSN">0302-9743</idno>
</seriesStmt><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Duration</term>
<term>Execution time</term>
<term>Heuristic method</term>
<term>Makespan</term>
<term>Middleware</term>
<term>Multicriteria analysis</term>
<term>Parallelism</term>
<term>Scheduling</term>
</keywords><keywords scheme="Pascal" xml:lang="fr"><term>Parallélisme</term>
<term>Intergiciel</term>
<term>Temps exécution</term>
<term>Durée</term>
<term>Temps total achèvement</term>
<term>Analyse multicritère</term>
<term>Ordonnancement</term>
<term>Méthode heuristique</term>
</keywords><front><div type="abstract" xml:lang="en">We study in this paper several scheduling heuristics for GridRPC middlewares. When dealing with performance issue, the scheduling strategy is one of the most important feature. However, many heuristics implemented in available middlewares were not designed for this context (for instance MCT in NetSolve). Therefore, schedulers are not necessarily effective. We propose to use heuristics based on a non-intrusive module which is able to estimate the duration of all tasks in the system. Three criteria are examined among which the execution time of the application, e.g. the makespan. Experiments on a real platform show that the proposed heuristics outperform MCT for at least two of these three criteria.</div>
</front><inist><standard h6="B"><pA><fA01 i1="01" i2="1"><s0>0302-9743</s0>
</fA01><fA05><s2>3149</s2>
</fA05><fA08 i1="01" i2="1" l="ENG"><s1>Experimental study of multi-criteria scheduling heuristics for GridRPC systems</s1>
</fA08><fA09 i1="01" i2="1" l="ENG"><s1>Euro-Par 2004 parallel processing : Pisa, 31 August - 3 September 2004</s1>
</fA09><fA11 i1="01" i2="1"><s1>CANIOU (Yves)</s1>
</fA11><fA11 i1="02" i2="1"><s1>JEANNOT (Emmanuel)</s1>
</fA11><fA12 i1="01" i2="1"><s1>DANELUTTO (Marco)</s1>
<s9>ed.</s9>
</fA12><fA12 i1="02" i2="1"><s1>LAFORENZA (Domenico)</s1>
<s9>ed.</s9>
</fA12><fA12 i1="03" i2="1"><s1>VANNESCHI (Marco)</s1>
<s9>ed.</s9>
</fA12><fA14 i1="01"><s1>LORIA, INRIA-Lorraine</s1>
<s3>FRA</s3>
</fA14><fA14 i1="02"><s1>LORIA, Université Henri Poincaré</s1>
<s3>FRA</s3>
</fA14><fA20><s1>1048-1055</s1>
</fA20><fA21><s1>2004</s1>
</fA21><fA23 i1="01"><s0>ENG</s0>
</fA23><fA26 i1="01"><s0>3-540-22924-8</s0>
</fA26><fA43 i1="01"><s1>INIST</s1>
<s2>16343</s2>
<s5>354000117914651220</s5>
</fA43><fA44><s0>0000</s0>
<s1>© 2004 INIST-CNRS. All rights reserved.</s1>
</fA44><fA45><s0>10 ref.</s0>
</fA45><fA47 i1="01" i2="1"><s0>04-0507743</s0>
</fA47><fA60><s1>P</s1>
<s2>C</s2>
</fA60><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>We study in this paper several scheduling heuristics for GridRPC middlewares. When dealing with performance issue, the scheduling strategy is one of the most important feature. However, many heuristics implemented in available middlewares were not designed for this context (for instance MCT in NetSolve). Therefore, schedulers are not necessarily effective. We propose to use heuristics based on a non-intrusive module which is able to estimate the duration of all tasks in the system. Three criteria are examined among which the execution time of the application, e.g. the makespan. Experiments on a real platform show that the proposed heuristics outperform MCT for at least two of these three criteria.</s0>
</fC01><fC02 i1="01" i2="X"><s0>001D02B04</s0>
</fC02><fC03 i1="01" i2="X" l="FRE"><s0>Parallélisme</s0>
<s5>01</s5>
</fC03><fC03 i1="01" i2="X" l="ENG"><s0>Parallelism</s0>
<s5>01</s5>
</fC03><fC03 i1="01" i2="X" l="SPA"><s0>Paralelismo</s0>
<s5>01</s5>
</fC03><fC03 i1="02" i2="X" l="FRE"><s0>Intergiciel</s0>
<s5>06</s5>
</fC03><fC03 i1="02" i2="X" l="ENG"><s0>Middleware</s0>
<s5>06</s5>
</fC03><fC03 i1="02" i2="X" l="SPA"><s0>Logicial personalizado</s0>
<s5>06</s5>
</fC03><fC03 i1="03" i2="X" l="FRE"><s0>Temps exécution</s0>
<s5>07</s5>
</fC03><fC03 i1="03" i2="X" l="ENG"><s0>Execution time</s0>
<s5>07</s5>
</fC03><fC03 i1="03" i2="X" l="SPA"><s0>Tiempo ejecución</s0>
<s5>07</s5>
</fC03><fC03 i1="04" i2="X" l="FRE"><s0>Durée</s0>
<s5>18</s5>
</fC03><fC03 i1="04" i2="X" l="ENG"><s0>Duration</s0>
<s5>18</s5>
</fC03><fC03 i1="04" i2="X" l="SPA"><s0>Duración</s0>
<s5>18</s5>
</fC03><fC03 i1="05" i2="X" l="FRE"><s0>Temps total achèvement</s0>
<s5>19</s5>
</fC03><fC03 i1="05" i2="X" l="ENG"><s0>Makespan</s0>
<s5>19</s5>
</fC03><fC03 i1="05" i2="X" l="SPA"><s0>Tiempo total acabamiento</s0>
<s5>19</s5>
</fC03><fC03 i1="06" i2="X" l="FRE"><s0>Analyse multicritère</s0>
<s5>23</s5>
</fC03><fC03 i1="06" i2="X" l="ENG"><s0>Multicriteria analysis</s0>
<s5>23</s5>
</fC03><fC03 i1="06" i2="X" l="SPA"><s0>Análisis multicriterio</s0>
<s5>23</s5>
</fC03><fC03 i1="07" i2="X" l="FRE"><s0>Ordonnancement</s0>
<s5>24</s5>
</fC03><fC03 i1="07" i2="X" l="ENG"><s0>Scheduling</s0>
<s5>24</s5>
</fC03><fC03 i1="07" i2="X" l="SPA"><s0>Reglamento</s0>
<s5>24</s5>
</fC03><fC03 i1="08" i2="X" l="FRE"><s0>Méthode heuristique</s0>
<s5>25</s5>
</fC03><fC03 i1="08" i2="X" l="ENG"><s0>Heuristic method</s0>
<s5>25</s5>
</fC03><fC03 i1="08" i2="X" l="SPA"><s0>Método heurístico</s0>
<s5>25</s5>
</fC03><fN21><s1>285</s1>
</fN21><fN44 i1="01"><s1>OTO</s1>
</fN44><fN82><s1>OTO</s1>
</fN82><pR><fA30 i1="01" i2="1" l="ENG"><s1>International Euro-Par conference</s1>
<s2>10</s2>
<s3>Pisa ITA</s3>
<s4>2004-08-31</s4>
</fA30><server><NO>PASCAL 04-0507743 INIST</NO>
<ET>Experimental study of multi-criteria scheduling heuristics for GridRPC systems</ET>
<AU>CANIOU (Yves); JEANNOT (Emmanuel); DANELUTTO (Marco); LAFORENZA (Domenico); VANNESCHI (Marco)</AU>
<AF>LORIA, INRIA-Lorraine/France; LORIA, Université Henri Poincaré/France</AF>
<DT>Publication en série; Congrès; Niveau analytique</DT>
<SO>Lecture notes in computer science; ISSN 0302-9743; Allemagne; Da. 2004; Vol. 3149; Pp. 1048-1055; Bibl. 10 ref.</SO>
<LA>Anglais</LA>
<EA>We study in this paper several scheduling heuristics for GridRPC middlewares. When dealing with performance issue, the scheduling strategy is one of the most important feature. However, many heuristics implemented in available middlewares were not designed for this context (for instance MCT in NetSolve). Therefore, schedulers are not necessarily effective. We propose to use heuristics based on a non-intrusive module which is able to estimate the duration of all tasks in the system. Three criteria are examined among which the execution time of the application, e.g. the makespan. Experiments on a real platform show that the proposed heuristics outperform MCT for at least two of these three criteria.</EA>
<CC>001D02B04</CC>
<FD>Parallélisme; Intergiciel; Temps exécution; Durée; Temps total achèvement; Analyse multicritère; Ordonnancement; Méthode heuristique</FD>
<ED>Parallelism; Middleware; Execution time; Duration; Makespan; Multicriteria analysis; Scheduling; Heuristic method</ED>
<SD>Paralelismo; Logicial personalizado; Tiempo ejecución; Duración; Tiempo total acabamiento; Análisis multicriterio; Reglamento; Método heurístico</SD>
<LO>INIST-16343.354000117914651220</LO>
<ID>04-0507743</ID>
</server>
Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/PascalFrancis/Corpus
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000629 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Corpus/biblio.hfd -nk 000629 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= PascalFrancis
|étape= Corpus
|type= RBID
|clé= Pascal:04-0507743
|texte= Experimental study of multi-criteria scheduling heuristics for GridRPC systems
}}
| 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 |  |
