Scheduling tasks and communications on a virtual distributed system
Identifieur interne : 001E63 ( Main/Exploration ); précédent : 001E62; suivant : 001E64Scheduling tasks and communications on a virtual distributed system
Auteurs : J.-Y. Colin [France] ; P. Colin [France]Source :
- European Journal of Operational Research [ 0377-2217 ] ; 1996.
Abstract
A set of tasks has to be scheduled on identical parallel processors subject to precedence constraints and small communication delays. A polynomial algorithm is known to exist if task duplication is allowed and the number of available processors is not limited. However the problem of communications scheduling is not taken into account. In this paper, we prove that this algorithm also never saturates communication channels and always delivers messages on time, if slightly stronger constraints are imposed on the tasks.
Url:
DOI: 10.1016/0377-2217(96)00128-2
Affiliations:
- France
- Haute-Normandie, Région Normandie, Île-de-France
- Le Havre, Paris
- Université Pierre-et-Marie-Curie, Université du Havre
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 000920
- to stream Istex, to step Curation: 000920
- to stream Istex, to step Checkpoint: 000D76
- to stream Main, to step Merge: 001F18
- to stream Main, to step Curation: 001E63
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title>Scheduling tasks and communications on a virtual distributed system</title><author><name sortKey="Colin, J Y" sort="Colin, J Y" uniqKey="Colin J" first="J.-Y." last="Colin">J.-Y. Colin</name></author><author><name sortKey="Colin, P" sort="Colin, P" uniqKey="Colin P" first="P." last="Colin">P. Colin</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:CFA47357AD5957AD7CA120F165E5F874F2D8F594</idno><date when="1996" year="1996">1996</date><idno type="doi">10.1016/0377-2217(96)00128-2</idno><idno type="url">https://api.istex.fr/document/CFA47357AD5957AD7CA120F165E5F874F2D8F594/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">000920</idno><idno type="wicri:Area/Istex/Curation">000920</idno><idno type="wicri:Area/Istex/Checkpoint">000D76</idno><idno type="wicri:doubleKey">0377-2217:1996:Colin J:scheduling:tasks:and</idno><idno type="wicri:Area/Main/Merge">001F18</idno><idno type="wicri:Area/Main/Curation">001E63</idno><idno type="wicri:Area/Main/Exploration">001E63</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a">Scheduling tasks and communications on a virtual distributed system</title><author><name sortKey="Colin, J Y" sort="Colin, J Y" uniqKey="Colin J" first="J.-Y." last="Colin">J.-Y. Colin</name><affiliation wicri:level="1"><country wicri:rule="url">France</country></affiliation><affiliation wicri:level="4"><country xml:lang="fr">France</country><wicri:regionArea>LITP, Université Pierre et Marie Curie, 4 Place Jussieu, 75 252 Paris</wicri:regionArea><orgName type="university">Université Pierre-et-Marie-Curie</orgName><placeName><settlement type="city">Paris</settlement><region type="region" nuts="2">Île-de-France</region></placeName></affiliation></author><author><name sortKey="Colin, P" sort="Colin, P" uniqKey="Colin P" first="P." last="Colin">P. Colin</name><affiliation wicri:level="4"><country xml:lang="fr">France</country><wicri:regionArea>LIH, Université du Havre, Place Robert-Schuman, 76 610 Le Havre</wicri:regionArea><orgName type="university">Université du Havre</orgName><placeName><settlement type="city">Le Havre</settlement><region type="region" nuts="2">Région Normandie</region><region type="old region" nuts="2">Haute-Normandie</region></placeName></affiliation></author></analytic><monogr></monogr><series><title level="j">European Journal of Operational Research</title><title level="j" type="abbrev">EOR</title><idno type="ISSN">0377-2217</idno><imprint><publisher>ELSEVIER</publisher><date type="published" when="1996">1996</date><biblScope unit="volume">94</biblScope><biblScope unit="issue">2</biblScope><biblScope unit="page" from="271">271</biblScope><biblScope unit="page" to="276">276</biblScope></imprint><idno type="ISSN">0377-2217</idno></series><idno type="istex">CFA47357AD5957AD7CA120F165E5F874F2D8F594</idno><idno type="DOI">10.1016/0377-2217(96)00128-2</idno><idno type="PII">0377-2217(96)00128-2</idno></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0377-2217</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">A set of tasks has to be scheduled on identical parallel processors subject to precedence constraints and small communication delays. A polynomial algorithm is known to exist if task duplication is allowed and the number of available processors is not limited. However the problem of communications scheduling is not taken into account. In this paper, we prove that this algorithm also never saturates communication channels and always delivers messages on time, if slightly stronger constraints are imposed on the tasks.</div></front></TEI><affiliations><list><country><li>France</li></country><region><li>Haute-Normandie</li><li>Région Normandie</li><li>Île-de-France</li></region><settlement><li>Le Havre</li><li>Paris</li></settlement><orgName><li>Université Pierre-et-Marie-Curie</li><li>Université du Havre</li></orgName></list><tree><country name="France"><noRegion><name sortKey="Colin, J Y" sort="Colin, J Y" uniqKey="Colin J" first="J.-Y." last="Colin">J.-Y. Colin</name></noRegion><name sortKey="Colin, J Y" sort="Colin, J Y" uniqKey="Colin J" first="J.-Y." last="Colin">J.-Y. Colin</name><name sortKey="Colin, P" sort="Colin, P" uniqKey="Colin P" first="P." last="Colin">P. Colin</name></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/France/explor/LeHavreV1/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 001E63 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 001E63 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/France
|area= LeHavreV1
|flux= Main
|étape= Exploration
|type= RBID
|clé= ISTEX:CFA47357AD5957AD7CA120F165E5F874F2D8F594
|texte= Scheduling tasks and communications on a virtual distributed system
}}
| This area was generated with Dilib version V0.6.25. |  |