Scheduling Tasks and Communications on a Hierarchical System with Message Contention
Identifieur interne : 000898 ( Istex/Corpus ); précédent : 000897; suivant : 000899Scheduling Tasks and Communications on a Hierarchical System with Message Contention
Auteurs : Jean-Yves Colin ; Moustafa NakechbandiSource :
- Lecture Notes in Computer Science [ 0302-9743 ] ; 2011.
Abstract
Abstract: A Directed Acyclic Graph (DAG) of tasks with small communication delays has to be scheduled on the identical parallel processors of clusters connected by a hierarchical network. The number or processors and of clusters is not limited. Message contention has to be avoided. Task duplication is allowed. In this paper, we present a new polynomial algorithm that computes the earliest start dates of all tasks and spreads these tasks to use few processors per cluster, for a DAG with small communication delays. It also avoids message contention, and always delivers messages on time.
Url:
DOI: 10.1007/978-3-642-24669-2_9
Links to Exploration step
ISTEX:A600F07245737974DAEF70E06078363BBFC68B93Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Scheduling Tasks and Communications on a Hierarchical System with Message Contention</title><author><name sortKey="Colin, Jean Yves" sort="Colin, Jean Yves" uniqKey="Colin J" first="Jean-Yves" last="Colin">Jean-Yves Colin</name><affiliation><mods:affiliation>LITIS, Université du Havre, IUT, 76610, Le Havre, France</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: jean-yves.colin@univ-lehavre.fr</mods:affiliation></affiliation></author><author><name sortKey="Nakechbandi, Moustafa" sort="Nakechbandi, Moustafa" uniqKey="Nakechbandi M" first="Moustafa" last="Nakechbandi">Moustafa Nakechbandi</name><affiliation><mods:affiliation>LITIS, Université du Havre, IUT, 76610, Le Havre, France</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: moustafa.nakechbandi@univ-lehavre.fr</mods:affiliation></affiliation></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:A600F07245737974DAEF70E06078363BBFC68B93</idno><date when="2011" year="2011">2011</date><idno type="doi">10.1007/978-3-642-24669-2_9</idno><idno type="url">https://api.istex.fr/document/A600F07245737974DAEF70E06078363BBFC68B93/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">000898</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Scheduling Tasks and Communications on a Hierarchical System with Message Contention</title><author><name sortKey="Colin, Jean Yves" sort="Colin, Jean Yves" uniqKey="Colin J" first="Jean-Yves" last="Colin">Jean-Yves Colin</name><affiliation><mods:affiliation>LITIS, Université du Havre, IUT, 76610, Le Havre, France</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: jean-yves.colin@univ-lehavre.fr</mods:affiliation></affiliation></author><author><name sortKey="Nakechbandi, Moustafa" sort="Nakechbandi, Moustafa" uniqKey="Nakechbandi M" first="Moustafa" last="Nakechbandi">Moustafa Nakechbandi</name><affiliation><mods:affiliation>LITIS, Université du Havre, IUT, 76610, Le Havre, France</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: moustafa.nakechbandi@univ-lehavre.fr</mods:affiliation></affiliation></author></analytic><monogr></monogr><series><title level="s">Lecture Notes in Computer Science</title><imprint><date>2011</date></imprint><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series><idno type="istex">A600F07245737974DAEF70E06078363BBFC68B93</idno><idno type="DOI">10.1007/978-3-642-24669-2_9</idno><idno type="ChapterID">9</idno><idno type="ChapterID">Chap9</idno></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: A Directed Acyclic Graph (DAG) of tasks with small communication delays has to be scheduled on the identical parallel processors of clusters connected by a hierarchical network. The number or processors and of clusters is not limited. Message contention has to be avoided. Task duplication is allowed. In this paper, we present a new polynomial algorithm that computes the earliest start dates of all tasks and spreads these tasks to use few processors per cluster, for a DAG with small communication delays. It also avoids message contention, and always delivers messages on time.</div></front></TEI><istex><corpusName>springer</corpusName><author><json:item><name>Jean-Yves Colin</name><affiliations><json:string>LITIS, Université du Havre, IUT, 76610, Le Havre, France</json:string><json:string>E-mail: jean-yves.colin@univ-lehavre.fr</json:string></affiliations></json:item><json:item><name>Moustafa Nakechbandi</name><affiliations><json:string>LITIS, Université du Havre, IUT, 76610, Le Havre, France</json:string><json:string>E-mail: moustafa.nakechbandi@univ-lehavre.fr</json:string></affiliations></json:item></author><language><json:string>eng</json:string></language><originalGenre><json:string>OriginalPaper</json:string></originalGenre><abstract>Abstract: A Directed Acyclic Graph (DAG) of tasks with small communication delays has to be scheduled on the identical parallel processors of clusters connected by a hierarchical network. The number or processors and of clusters is not limited. Message contention has to be avoided. Task duplication is allowed. In this paper, we present a new polynomial algorithm that computes the earliest start dates of all tasks and spreads these tasks to use few processors per cluster, for a DAG with small communication delays. It also avoids message contention, and always delivers messages on time.</abstract><qualityIndicators><score>6.368</score><pdfVersion>1.6</pdfVersion><pdfPageSize>429.442 x 659.895 pts</pdfPageSize><refBibsNative>false</refBibsNative><keywordCount>0</keywordCount><abstractCharCount>591</abstractCharCount><pdfWordCount>3740</pdfWordCount><pdfCharCount>19219</pdfCharCount><pdfPageCount>10</pdfPageCount><abstractWordCount>94</abstractWordCount></qualityIndicators><title>Scheduling Tasks and Communications on a Hierarchical System with Message Contention</title><chapterId><json:string>9</json:string><json:string>Chap9</json:string></chapterId><genre><json:string>conference</json:string></genre><serie><editor><json:item><name>David Hutchison</name><affiliations><json:string>Lancaster University, Lancaster, UK</json:string></affiliations></json:item><json:item><name>Takeo Kanade</name><affiliations><json:string>Carnegie Mellon University, Pittsburgh, PA, USA</json:string></affiliations></json:item><json:item><name>Josef Kittler</name><affiliations><json:string>University of Surrey, Guildford, UK</json:string></affiliations></json:item><json:item><name>Jon M. Kleinberg</name><affiliations><json:string>Cornell University, Ithaca, NY, USA</json:string></affiliations></json:item><json:item><name>Friedemann Mattern</name><affiliations><json:string>ETH Zurich, Zurich, Switzerland</json:string></affiliations></json:item><json:item><name>John C. Mitchell</name><affiliations><json:string>Stanford University, Stanford, CA, USA</json:string></affiliations></json:item><json:item><name>Moni Naor</name><affiliations><json:string>Weizmann Institute of Science, Rehovot, Israel</json:string></affiliations></json:item><json:item><name>Oscar Nierstrasz</name><affiliations><json:string>University of Bern, Bern, Switzerland</json:string></affiliations></json:item><json:item><name>C. Pandu Rangan</name><affiliations><json:string>Indian Institute of Technology, Madras, India</json:string></affiliations></json:item><json:item><name>Bernhard Steffen</name><affiliations><json:string>University of Dortmund, Dortmund, Germany</json:string></affiliations></json:item><json:item><name>Madhu Sudan</name><affiliations><json:string>Massachusetts Institute of Technology, MA, USA</json:string></affiliations></json:item><json:item><name>Demetri Terzopoulos</name><affiliations><json:string>University of California, Los Angeles, CA, USA</json:string></affiliations></json:item><json:item><name>Doug Tygar</name><affiliations><json:string>University of California, Berkeley, CA, USA</json:string></affiliations></json:item><json:item><name>Moshe Y. Vardi</name><affiliations><json:string>Rice University, Houston, TX, USA</json:string></affiliations></json:item><json:item><name>Gerhard Weikum</name><affiliations><json:string>Max-Planck Institute of Computer Science, Saarbrücken, Germany</json:string></affiliations></json:item></editor><issn><json:string>0302-9743</json:string></issn><language><json:string>unknown</json:string></language><eissn><json:string>1611-3349</json:string></eissn><title>Lecture Notes in Computer Science</title><copyrightDate>2011</copyrightDate></serie><host><editor><json:item><name>Yang Xiang</name><affiliations><json:string>School of Information Technology, Deakin University, Melbourne Burwood Campus, 221 Burwood Highway, 3125, Burwood, VIC, Australia</json:string><json:string>E-mail: yang@deakin.edu.au</json:string></affiliations></json:item><json:item><name>Alfredo Cuzzocrea</name><affiliations><json:string>ICAR-CNR and University of Calabria, Via P. Bucci 41 C, 87036, Rende, CS, Italy</json:string><json:string>E-mail: cuzzocrea@si.deis.unical.it</json:string></affiliations></json:item><json:item><name>Michael Hobbs</name><affiliations><json:string>School of Information Technology, Deakin University, Geelong Waurn Ponds Campus, Pigdons Road, 3217, Geelong, VIC, Australia</json:string><json:string>E-mail: mick@deakin.edu.au</json:string></affiliations></json:item><json:item><name>Wanlei Zhou</name><affiliations><json:string>School of Information Technology, Deakin University, Melbourne Burwood Campus, 221 Burwood Highway, 3125, Burwood, VIC, Australia</json:string><json:string>E-mail: wanlei@deakin.edu.au</json:string></affiliations></json:item></editor><subject><json:item><value>Computer Science</value></json:item><json:item><value>Computer Science</value></json:item><json:item><value>Algorithm Analysis and Problem Complexity</value></json:item><json:item><value>Artificial Intelligence (incl. Robotics)</value></json:item><json:item><value>Software Engineering</value></json:item><json:item><value>Information Systems Applications (incl. Internet)</value></json:item><json:item><value>Computer Communication Networks</value></json:item><json:item><value>Management of Computing and Information Systems</value></json:item></subject><isbn><json:string>978-3-642-24668-5</json:string></isbn><language><json:string>unknown</json:string></language><eissn><json:string>1611-3349</json:string></eissn><title>Algorithms and Architectures for Parallel Processing</title><bookId><json:string>978-3-642-24669-2</json:string></bookId><volume>7017</volume><pages><last>98</last><first>89</first></pages><issn><json:string>0302-9743</json:string></issn><genre><json:string>book-series</json:string></genre><eisbn><json:string>978-3-642-24669-2</json:string></eisbn><copyrightDate>2011</copyrightDate><doi><json:string>10.1007/978-3-642-24669-2</json:string></doi></host><publicationDate>2011</publicationDate><copyrightDate>2011</copyrightDate><doi><json:string>10.1007/978-3-642-24669-2_9</json:string></doi><id>A600F07245737974DAEF70E06078363BBFC68B93</id><score>0.265607</score><fulltext><json:item><original>true</original><mimetype>application/pdf</mimetype><extension>pdf</extension><uri>https://api.istex.fr/document/A600F07245737974DAEF70E06078363BBFC68B93/fulltext/pdf</uri></json:item><json:item><original>false</original><mimetype>application/zip</mimetype><extension>zip</extension><uri>https://api.istex.fr/document/A600F07245737974DAEF70E06078363BBFC68B93/fulltext/zip</uri></json:item><istex:fulltextTEI uri="https://api.istex.fr/document/A600F07245737974DAEF70E06078363BBFC68B93/fulltext/tei"><teiHeader><fileDesc><titleStmt><title level="a" type="main" xml:lang="en">Scheduling Tasks and Communications on a Hierarchical System with Message Contention</title><respStmt><resp>Références bibliographiques récupérées via GROBID</resp><name resp="ISTEX-API">ISTEX-API (INIST-CNRS)</name></respStmt></titleStmt><publicationStmt><authority>ISTEX</authority><publisher>Springer Berlin Heidelberg</publisher><pubPlace>Berlin, Heidelberg</pubPlace><availability><p>Springer-Verlag GmbH Berlin Heidelberg, 2011</p></availability><date>2011</date></publicationStmt><sourceDesc><biblStruct type="inbook"><analytic><title level="a" type="main" xml:lang="en">Scheduling Tasks and Communications on a Hierarchical System with Message Contention</title><author xml:id="author-1"><persName><forename type="first">Jean-Yves</forename><surname>Colin</surname></persName><email>jean-yves.colin@univ-lehavre.fr</email><affiliation>LITIS, Université du Havre, IUT, 76610, Le Havre, France</affiliation></author><author xml:id="author-2"><persName><forename type="first">Moustafa</forename><surname>Nakechbandi</surname></persName><email>moustafa.nakechbandi@univ-lehavre.fr</email><affiliation>LITIS, Université du Havre, IUT, 76610, Le Havre, France</affiliation></author></analytic><monogr><title level="m">Algorithms and Architectures for Parallel Processing</title><title level="m" type="sub">11th International Conference, ICA300 2011, Melbourne, Australia, October 24-26, 2011, Proceedings, Part II</title><idno type="pISBN">978-3-642-24668-5</idno><idno type="eISBN">978-3-642-24669-2</idno><idno type="pISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="DOI">10.1007/978-3-642-24669-2</idno><idno type="book-ID">978-3-642-24669-2</idno><idno type="book-title-ID">273716</idno><idno type="book-sequence-number">7017</idno><idno type="book-volume-number">7017</idno><idno type="book-chapter-count">38</idno><editor><persName><forename type="first">Yang</forename><surname>Xiang</surname></persName><email>yang@deakin.edu.au</email><affiliation>School of Information Technology, Deakin University, Melbourne Burwood Campus, 221 Burwood Highway, 3125, Burwood, VIC, Australia</affiliation></editor><editor><persName><forename type="first">Alfredo</forename><surname>Cuzzocrea</surname></persName><email>cuzzocrea@si.deis.unical.it</email><affiliation>ICAR-CNR and University of Calabria, Via P. Bucci 41 C, 87036, Rende, CS, Italy</affiliation></editor><editor><persName><forename type="first">Michael</forename><surname>Hobbs</surname></persName><email>mick@deakin.edu.au</email><affiliation>School of Information Technology, Deakin University, Geelong Waurn Ponds Campus, Pigdons Road, 3217, Geelong, VIC, Australia</affiliation></editor><editor><persName><forename type="first">Wanlei</forename><surname>Zhou</surname></persName><email>wanlei@deakin.edu.au</email><affiliation>School of Information Technology, Deakin University, Melbourne Burwood Campus, 221 Burwood Highway, 3125, Burwood, VIC, Australia</affiliation></editor><imprint><publisher>Springer Berlin Heidelberg</publisher><pubPlace>Berlin, Heidelberg</pubPlace><date type="published" when="2011"></date><biblScope unit="volume">7017</biblScope><biblScope unit="page" from="89">89</biblScope><biblScope unit="page" to="98">98</biblScope></imprint></monogr><series><title level="s">Lecture Notes in Computer Science</title><editor><persName><forename type="first">David</forename><surname>Hutchison</surname></persName><affiliation>Lancaster University, Lancaster, UK</affiliation></editor><editor><persName><forename type="first">Takeo</forename><surname>Kanade</surname></persName><affiliation>Carnegie Mellon University, Pittsburgh, PA, USA</affiliation></editor><editor><persName><forename type="first">Josef</forename><surname>Kittler</surname></persName><affiliation>University of Surrey, Guildford, UK</affiliation></editor><editor><persName><forename type="first">Jon</forename><forename type="first">M.</forename><surname>Kleinberg</surname></persName><affiliation>Cornell University, Ithaca, NY, USA</affiliation></editor><editor><persName><forename type="first">Friedemann</forename><surname>Mattern</surname></persName><affiliation>ETH Zurich, Zurich, Switzerland</affiliation></editor><editor><persName><forename type="first">John</forename><forename type="first">C.</forename><surname>Mitchell</surname></persName><affiliation>Stanford University, Stanford, CA, USA</affiliation></editor><editor><persName><forename type="first">Moni</forename><surname>Naor</surname></persName><affiliation>Weizmann Institute of Science, Rehovot, Israel</affiliation></editor><editor><persName><forename type="first">Oscar</forename><surname>Nierstrasz</surname></persName><affiliation>University of Bern, Bern, Switzerland</affiliation></editor><editor><persName><forename type="first">C.</forename><surname>Pandu Rangan</surname></persName><affiliation>Indian Institute of Technology, Madras, India</affiliation></editor><editor><persName><forename type="first">Bernhard</forename><surname>Steffen</surname></persName><affiliation>University of Dortmund, Dortmund, Germany</affiliation></editor><editor><persName><forename type="first">Madhu</forename><surname>Sudan</surname></persName><affiliation>Massachusetts Institute of Technology, MA, USA</affiliation></editor><editor><persName><forename type="first">Demetri</forename><surname>Terzopoulos</surname></persName><affiliation>University of California, Los Angeles, CA, USA</affiliation></editor><editor><persName><forename type="first">Doug</forename><surname>Tygar</surname></persName><affiliation>University of California, Berkeley, CA, USA</affiliation></editor><editor><persName><forename type="first">Moshe</forename><forename type="first">Y.</forename><surname>Vardi</surname></persName><affiliation>Rice University, Houston, TX, USA</affiliation></editor><editor><persName><forename type="first">Gerhard</forename><surname>Weikum</surname></persName><affiliation>Max-Planck Institute of Computer Science, Saarbrücken, Germany</affiliation></editor><biblScope><date>2011</date></biblScope><idno type="pISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="series-Id">558</idno></series><idno type="istex">A600F07245737974DAEF70E06078363BBFC68B93</idno><idno type="DOI">10.1007/978-3-642-24669-2_9</idno><idno type="ChapterID">9</idno><idno type="ChapterID">Chap9</idno></biblStruct></sourceDesc></fileDesc><profileDesc><creation><date>2011</date></creation><langUsage><language ident="en">en</language></langUsage><abstract xml:lang="en"><p>Abstract: A Directed Acyclic Graph (DAG) of tasks with small communication delays has to be scheduled on the identical parallel processors of clusters connected by a hierarchical network. The number or processors and of clusters is not limited. Message contention has to be avoided. Task duplication is allowed. In this paper, we present a new polynomial algorithm that computes the earliest start dates of all tasks and spreads these tasks to use few processors per cluster, for a DAG with small communication delays. It also avoids message contention, and always delivers messages on time.</p></abstract><textClass><keywords scheme="Book-Subject-Collection"><list><label>SUCO11645</label><item><term>Computer Science</term></item></list></keywords></textClass><textClass><keywords scheme="Book-Subject-Group"><list><label>I</label><label>I16021</label><label>I21017</label><label>I14029</label><label>I18040</label><label>I13022</label><label>I24067</label><item><term>Computer Science</term></item><item><term>Algorithm Analysis and Problem Complexity</term></item><item><term>Artificial Intelligence (incl. Robotics)</term></item><item><term>Software Engineering</term></item><item><term>Information Systems Applications (incl. Internet)</term></item><item><term>Computer Communication Networks</term></item><item><term>Management of Computing and Information Systems</term></item></list></keywords></textClass></profileDesc><revisionDesc><change when="2011">Published</change><change xml:id="refBibs-istex" who="#ISTEX-API" when="2016-09-22">References added</change></revisionDesc></teiHeader></istex:fulltextTEI><json:item><original>false</original><mimetype>text/plain</mimetype><extension>txt</extension><uri>https://api.istex.fr/document/A600F07245737974DAEF70E06078363BBFC68B93/fulltext/txt</uri></json:item></fulltext><metadata><istex:metadataXml wicri:clean="Springer, Publisher found" wicri:toSee="no header"><istex:xmlDeclaration>version="1.0" encoding="UTF-8"</istex:xmlDeclaration><istex:docType PUBLIC="-//Springer-Verlag//DTD A++ V2.4//EN" URI="http://devel.springer.de/A++/V2.4/DTD/A++V2.4.dtd" name="istex:docType"></istex:docType><istex:document><Publisher><PublisherInfo><PublisherName>Springer Berlin Heidelberg</PublisherName><PublisherLocation>Berlin, Heidelberg</PublisherLocation></PublisherInfo><Series><SeriesInfo SeriesType="Series" TocLevels="0"><SeriesID>558</SeriesID><SeriesPrintISSN>0302-9743</SeriesPrintISSN><SeriesElectronicISSN>1611-3349</SeriesElectronicISSN><SeriesTitle Language="En">Lecture Notes in Computer Science</SeriesTitle></SeriesInfo><SeriesHeader><EditorGroup><Editor AffiliationIDS="Aff1"><EditorName DisplayOrder="Western"><GivenName>David</GivenName><FamilyName>Hutchison</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff2"><EditorName DisplayOrder="Western"><GivenName>Takeo</GivenName><FamilyName>Kanade</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff3"><EditorName DisplayOrder="Western"><GivenName>Josef</GivenName><FamilyName>Kittler</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff4"><EditorName DisplayOrder="Western"><GivenName>Jon</GivenName><GivenName>M.</GivenName><FamilyName>Kleinberg</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff5"><EditorName DisplayOrder="Western"><GivenName>Friedemann</GivenName><FamilyName>Mattern</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff6"><EditorName DisplayOrder="Western"><GivenName>John</GivenName><GivenName>C.</GivenName><FamilyName>Mitchell</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff7"><EditorName DisplayOrder="Western"><GivenName>Moni</GivenName><FamilyName>Naor</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff8"><EditorName DisplayOrder="Western"><GivenName>Oscar</GivenName><FamilyName>Nierstrasz</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff9"><EditorName DisplayOrder="Western"><GivenName>C.</GivenName><FamilyName>Pandu Rangan</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff10"><EditorName DisplayOrder="Western"><GivenName>Bernhard</GivenName><FamilyName>Steffen</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff11"><EditorName DisplayOrder="Western"><GivenName>Madhu</GivenName><FamilyName>Sudan</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff12"><EditorName DisplayOrder="Western"><GivenName>Demetri</GivenName><FamilyName>Terzopoulos</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff13"><EditorName DisplayOrder="Western"><GivenName>Doug</GivenName><FamilyName>Tygar</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff14"><EditorName DisplayOrder="Western"><GivenName>Moshe</GivenName><GivenName>Y.</GivenName><FamilyName>Vardi</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff15"><EditorName DisplayOrder="Western"><GivenName>Gerhard</GivenName><FamilyName>Weikum</FamilyName></EditorName></Editor><Affiliation ID="Aff1"><OrgName>Lancaster University</OrgName><OrgAddress><City>Lancaster</City><Country>UK</Country></OrgAddress></Affiliation><Affiliation ID="Aff2"><OrgName>Carnegie Mellon University</OrgName><OrgAddress><City>Pittsburgh</City><State>PA</State><Country>USA</Country></OrgAddress></Affiliation><Affiliation ID="Aff3"><OrgName>University of Surrey</OrgName><OrgAddress><City>Guildford</City><Country>UK</Country></OrgAddress></Affiliation><Affiliation ID="Aff4"><OrgName>Cornell University</OrgName><OrgAddress><City>Ithaca</City><State>NY</State><Country>USA</Country></OrgAddress></Affiliation><Affiliation ID="Aff5"><OrgName>ETH Zurich</OrgName><OrgAddress><City>Zurich</City><Country>Switzerland</Country></OrgAddress></Affiliation><Affiliation ID="Aff6"><OrgName>Stanford University</OrgName><OrgAddress><City>Stanford</City><State>CA</State><Country>USA</Country></OrgAddress></Affiliation><Affiliation ID="Aff7"><OrgName>Weizmann Institute of Science</OrgName><OrgAddress><City>Rehovot</City><Country>Israel</Country></OrgAddress></Affiliation><Affiliation ID="Aff8"><OrgName>University of Bern</OrgName><OrgAddress><City>Bern</City><Country>Switzerland</Country></OrgAddress></Affiliation><Affiliation ID="Aff9"><OrgName>Indian Institute of Technology</OrgName><OrgAddress><City>Madras</City><Country>India</Country></OrgAddress></Affiliation><Affiliation ID="Aff10"><OrgName>University of Dortmund</OrgName><OrgAddress><City>Dortmund</City><Country>Germany</Country></OrgAddress></Affiliation><Affiliation ID="Aff11"><OrgName>Massachusetts Institute of Technology</OrgName><OrgAddress><State>MA</State><Country>USA</Country></OrgAddress></Affiliation><Affiliation ID="Aff12"><OrgName>University of California</OrgName><OrgAddress><City>Los Angeles</City><State>CA</State><Country>USA</Country></OrgAddress></Affiliation><Affiliation ID="Aff13"><OrgName>University of California</OrgName><OrgAddress><City>Berkeley</City><State>CA</State><Country>USA</Country></OrgAddress></Affiliation><Affiliation ID="Aff14"><OrgName>Rice University</OrgName><OrgAddress><City>Houston</City><State>TX</State><Country>USA</Country></OrgAddress></Affiliation><Affiliation ID="Aff15"><OrgName>Max-Planck Institute of Computer Science</OrgName><OrgAddress><City>Saarbrücken</City><Country>Germany</Country></OrgAddress></Affiliation></EditorGroup></SeriesHeader><Book Language="En"><BookInfo BookProductType="Proceedings" ContainsESM="No" Language="En" MediaType="eBook" NumberingDepth="2" NumberingStyle="ContentOnly" OutputMedium="All" TocLevels="0"><BookID>978-3-642-24669-2</BookID><BookTitle>Algorithms and Architectures for Parallel Processing</BookTitle><BookSubTitle>11th International Conference, ICA300 2011, Melbourne, Australia, October 24-26, 2011, Proceedings, Part II</BookSubTitle><BookVolumeNumber>7017</BookVolumeNumber><BookSequenceNumber>7017</BookSequenceNumber><BookDOI>10.1007/978-3-642-24669-2</BookDOI><BookTitleID>273716</BookTitleID><BookPrintISBN>978-3-642-24668-5</BookPrintISBN><BookElectronicISBN>978-3-642-24669-2</BookElectronicISBN><BookChapterCount>38</BookChapterCount><BookCopyright><CopyrightHolderName>Springer-Verlag GmbH Berlin Heidelberg</CopyrightHolderName><CopyrightYear>2011</CopyrightYear></BookCopyright><BookSubjectGroup><BookSubject Code="I" Type="Primary">Computer Science</BookSubject><BookSubject Code="I16021" Priority="1" Type="Secondary">Algorithm Analysis and Problem Complexity</BookSubject><BookSubject Code="I21017" Priority="2" Type="Secondary">Artificial Intelligence (incl. Robotics)</BookSubject><BookSubject Code="I14029" Priority="3" Type="Secondary">Software Engineering</BookSubject><BookSubject Code="I18040" Priority="4" Type="Secondary">Information Systems Applications (incl. Internet)</BookSubject><BookSubject Code="I13022" Priority="5" Type="Secondary">Computer Communication Networks</BookSubject><BookSubject Code="I24067" Priority="6" Type="Secondary">Management of Computing and Information Systems</BookSubject><SubjectCollection Code="SUCO11645">Computer Science</SubjectCollection></BookSubjectGroup><BookContext><SeriesID>558</SeriesID></BookContext></BookInfo><BookHeader><EditorGroup><Editor AffiliationIDS="Aff16"><EditorName DisplayOrder="Western"><GivenName>Yang</GivenName><FamilyName>Xiang</FamilyName></EditorName><Contact><Email>yang@deakin.edu.au</Email></Contact></Editor><Editor AffiliationIDS="Aff17"><EditorName DisplayOrder="Western"><GivenName>Alfredo</GivenName><FamilyName>Cuzzocrea</FamilyName></EditorName><Contact><Email>cuzzocrea@si.deis.unical.it</Email></Contact></Editor><Editor AffiliationIDS="Aff18"><EditorName DisplayOrder="Western"><GivenName>Michael</GivenName><FamilyName>Hobbs</FamilyName></EditorName><Contact><Email>mick@deakin.edu.au</Email></Contact></Editor><Editor AffiliationIDS="Aff16"><EditorName DisplayOrder="Western"><GivenName>Wanlei</GivenName><FamilyName>Zhou</FamilyName></EditorName><Contact><Email>wanlei@deakin.edu.au</Email></Contact></Editor><Affiliation ID="Aff16"><OrgDivision>School of Information Technology</OrgDivision><OrgName>Deakin University, Melbourne Burwood Campus</OrgName><OrgAddress><Street>221 Burwood Highway</Street><Postcode>3125</Postcode><City>Burwood</City><State>VIC</State><Country>Australia</Country></OrgAddress></Affiliation><Affiliation ID="Aff17"><OrgName>ICAR-CNR and University of Calabria</OrgName><OrgAddress><Street>Via P. Bucci 41 C</Street><Postcode>87036</Postcode><City>Rende</City><State>CS</State><Country>Italy</Country></OrgAddress></Affiliation><Affiliation ID="Aff18"><OrgDivision>School of Information Technology</OrgDivision><OrgName>Deakin University, Geelong Waurn Ponds Campus</OrgName><OrgAddress><Street>Pigdons Road</Street><Postcode>3217</Postcode><City>Geelong</City><State>VIC</State><Country>Australia</Country></OrgAddress></Affiliation></EditorGroup></BookHeader><Part ID="Part1"><PartInfo TocLevels="0"><PartID>1</PartID><PartSequenceNumber>1</PartSequenceNumber><PartTitle>ADCN 2011 Papers</PartTitle><PartChapterCount>16</PartChapterCount><PartContext><SeriesID>558</SeriesID><BookTitle>Algorithms and Architectures for Parallel Processing</BookTitle></PartContext></PartInfo><Chapter ID="Chap9" Language="En"><ChapterInfo ChapterType="OriginalPaper" ContainsESM="No" NumberingDepth="2" NumberingStyle="ContentOnly" TocLevels="0"><ChapterID>9</ChapterID><ChapterDOI>10.1007/978-3-642-24669-2_9</ChapterDOI><ChapterSequenceNumber>9</ChapterSequenceNumber><ChapterTitle Language="En">Scheduling Tasks and Communications on a Hierarchical System with Message Contention</ChapterTitle><ChapterFirstPage>89</ChapterFirstPage><ChapterLastPage>98</ChapterLastPage><ChapterCopyright><CopyrightHolderName>Springer-Verlag Berlin Heidelberg</CopyrightHolderName><CopyrightYear>2011</CopyrightYear></ChapterCopyright><ChapterGrants Type="Regular"><MetadataGrant Grant="OpenAccess"></MetadataGrant><AbstractGrant Grant="OpenAccess"></AbstractGrant><BodyPDFGrant Grant="Restricted"></BodyPDFGrant><BodyHTMLGrant Grant="Restricted"></BodyHTMLGrant><BibliographyGrant Grant="Restricted"></BibliographyGrant><ESMGrant Grant="Restricted"></ESMGrant></ChapterGrants><ChapterContext><SeriesID>558</SeriesID><PartID>1</PartID><BookID>978-3-642-24669-2</BookID><BookTitle>Algorithms and Architectures for Parallel Processing</BookTitle></ChapterContext></ChapterInfo><ChapterHeader><AuthorGroup><Author AffiliationIDS="Aff19"><AuthorName DisplayOrder="Western"><GivenName>Jean-Yves</GivenName><FamilyName>Colin</FamilyName></AuthorName><Contact><Email>jean-yves.colin@univ-lehavre.fr</Email></Contact></Author><Author AffiliationIDS="Aff19"><AuthorName DisplayOrder="Western"><GivenName>Moustafa</GivenName><FamilyName>Nakechbandi</FamilyName></AuthorName><Contact><Email>moustafa.nakechbandi@univ-lehavre.fr</Email></Contact></Author><Affiliation ID="Aff19"><OrgDivision>LITIS</OrgDivision><OrgName>Université du Havre, IUT</OrgName><OrgAddress><Postcode>76610</Postcode><City>Le Havre</City><Country>France</Country></OrgAddress></Affiliation></AuthorGroup><Abstract ID="Abs1" Language="En"><Heading>Abstract</Heading><Para>A Directed Acyclic Graph (DAG) of tasks with small communication delays has to be scheduled on the identical parallel processors of clusters connected by a hierarchical network. The number or processors and of clusters is not limited. Message contention has to be avoided. Task duplication is allowed. In this paper, we present a new polynomial algorithm that computes the earliest start dates of all tasks and spreads these tasks to use few processors per cluster, for a DAG with small communication delays. It also avoids message contention, and always delivers messages on time.</Para></Abstract><KeywordGroup Language="En"><Heading>Keywords</Heading><Keyword>Scheduling</Keyword><Keyword>DAG</Keyword><Keyword>Hierarchical Communications</Keyword><Keyword>Message contention</Keyword><Keyword>Task Duplication</Keyword><Keyword>CPM/PERT</Keyword></KeywordGroup><ArticleNote Type="Misc"><SimplePara>This work is partially funded by the GRR ”Transport Logistique et Technologie de l’Information” of the Université du Havre, France.</SimplePara></ArticleNote></ChapterHeader><NoBody></NoBody></Chapter></Part></Book></Series></Publisher></istex:document></istex:metadataXml><mods version="3.6"><titleInfo lang="en"><title>Scheduling Tasks and Communications on a Hierarchical System with Message Contention</title></titleInfo><titleInfo type="alternative" contentType="CDATA" lang="en"><title>Scheduling Tasks and Communications on a Hierarchical System with Message Contention</title></titleInfo><name type="personal"><namePart type="given">Jean-Yves</namePart><namePart type="family">Colin</namePart><affiliation>LITIS, Université du Havre, IUT, 76610, Le Havre, France</affiliation><affiliation>E-mail: jean-yves.colin@univ-lehavre.fr</affiliation><role><roleTerm type="text">author</roleTerm></role></name><name type="personal"><namePart type="given">Moustafa</namePart><namePart type="family">Nakechbandi</namePart><affiliation>LITIS, Université du Havre, IUT, 76610, Le Havre, France</affiliation><affiliation>E-mail: moustafa.nakechbandi@univ-lehavre.fr</affiliation><role><roleTerm type="text">author</roleTerm></role></name><typeOfResource>text</typeOfResource><genre type="conference" displayLabel="OriginalPaper"></genre><originInfo><publisher>Springer Berlin Heidelberg</publisher><place><placeTerm type="text">Berlin, Heidelberg</placeTerm></place><dateIssued encoding="w3cdtf">2011</dateIssued><copyrightDate encoding="w3cdtf">2011</copyrightDate></originInfo><language><languageTerm type="code" authority="rfc3066">en</languageTerm><languageTerm type="code" authority="iso639-2b">eng</languageTerm></language><physicalDescription><internetMediaType>text/html</internetMediaType></physicalDescription><abstract lang="en">Abstract: A Directed Acyclic Graph (DAG) of tasks with small communication delays has to be scheduled on the identical parallel processors of clusters connected by a hierarchical network. The number or processors and of clusters is not limited. Message contention has to be avoided. Task duplication is allowed. In this paper, we present a new polynomial algorithm that computes the earliest start dates of all tasks and spreads these tasks to use few processors per cluster, for a DAG with small communication delays. It also avoids message contention, and always delivers messages on time.</abstract><relatedItem type="host"><titleInfo><title>Algorithms and Architectures for Parallel Processing</title><subTitle>11th International Conference, ICA300 2011, Melbourne, Australia, October 24-26, 2011, Proceedings, Part II</subTitle></titleInfo><name type="personal"><namePart type="given">Yang</namePart><namePart type="family">Xiang</namePart><affiliation>School of Information Technology, Deakin University, Melbourne Burwood Campus, 221 Burwood Highway, 3125, Burwood, VIC, Australia</affiliation><affiliation>E-mail: yang@deakin.edu.au</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Alfredo</namePart><namePart type="family">Cuzzocrea</namePart><affiliation>ICAR-CNR and University of Calabria, Via P. Bucci 41 C, 87036, Rende, CS, Italy</affiliation><affiliation>E-mail: cuzzocrea@si.deis.unical.it</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Michael</namePart><namePart type="family">Hobbs</namePart><affiliation>School of Information Technology, Deakin University, Geelong Waurn Ponds Campus, Pigdons Road, 3217, Geelong, VIC, Australia</affiliation><affiliation>E-mail: mick@deakin.edu.au</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Wanlei</namePart><namePart type="family">Zhou</namePart><affiliation>School of Information Technology, Deakin University, Melbourne Burwood Campus, 221 Burwood Highway, 3125, Burwood, VIC, Australia</affiliation><affiliation>E-mail: wanlei@deakin.edu.au</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><genre type="book-series" displayLabel="Proceedings"></genre><originInfo><copyrightDate encoding="w3cdtf">2011</copyrightDate><issuance>monographic</issuance></originInfo><subject><genre>Book-Subject-Collection</genre><topic authority="SpringerSubjectCodes" authorityURI="SUCO11645">Computer Science</topic></subject><subject><genre>Book-Subject-Group</genre><topic authority="SpringerSubjectCodes" authorityURI="I">Computer Science</topic><topic authority="SpringerSubjectCodes" authorityURI="I16021">Algorithm Analysis and Problem Complexity</topic><topic authority="SpringerSubjectCodes" authorityURI="I21017">Artificial Intelligence (incl. Robotics)</topic><topic authority="SpringerSubjectCodes" authorityURI="I14029">Software Engineering</topic><topic authority="SpringerSubjectCodes" authorityURI="I18040">Information Systems Applications (incl. Internet)</topic><topic authority="SpringerSubjectCodes" authorityURI="I13022">Computer Communication Networks</topic><topic authority="SpringerSubjectCodes" authorityURI="I24067">Management of Computing and Information Systems</topic></subject><identifier type="DOI">10.1007/978-3-642-24669-2</identifier><identifier type="ISBN">978-3-642-24668-5</identifier><identifier type="eISBN">978-3-642-24669-2</identifier><identifier type="ISSN">0302-9743</identifier><identifier type="eISSN">1611-3349</identifier><identifier type="BookTitleID">273716</identifier><identifier type="BookID">978-3-642-24669-2</identifier><identifier type="BookChapterCount">38</identifier><identifier type="BookVolumeNumber">7017</identifier><identifier type="BookSequenceNumber">7017</identifier><identifier type="PartChapterCount">16</identifier><part><date>2011</date><detail type="part"><title>ADCN 2011 Papers</title></detail><detail type="volume"><number>7017</number><caption>vol.</caption></detail><extent unit="pages"><start>89</start><end>98</end></extent></part><recordInfo><recordOrigin>Springer-Verlag GmbH Berlin Heidelberg, 2011</recordOrigin></recordInfo></relatedItem><relatedItem type="series"><titleInfo><title>Lecture Notes in Computer Science</title></titleInfo><name type="personal"><namePart type="given">David</namePart><namePart type="family">Hutchison</namePart><affiliation>Lancaster University, Lancaster, UK</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Takeo</namePart><namePart type="family">Kanade</namePart><affiliation>Carnegie Mellon University, Pittsburgh, PA, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Josef</namePart><namePart type="family">Kittler</namePart><affiliation>University of Surrey, Guildford, UK</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Jon</namePart><namePart type="given">M.</namePart><namePart type="family">Kleinberg</namePart><affiliation>Cornell University, Ithaca, NY, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Friedemann</namePart><namePart type="family">Mattern</namePart><affiliation>ETH Zurich, Zurich, Switzerland</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">John</namePart><namePart type="given">C.</namePart><namePart type="family">Mitchell</namePart><affiliation>Stanford University, Stanford, CA, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Moni</namePart><namePart type="family">Naor</namePart><affiliation>Weizmann Institute of Science, Rehovot, Israel</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Oscar</namePart><namePart type="family">Nierstrasz</namePart><affiliation>University of Bern, Bern, Switzerland</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">C.</namePart><namePart type="family">Pandu Rangan</namePart><affiliation>Indian Institute of Technology, Madras, India</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Bernhard</namePart><namePart type="family">Steffen</namePart><affiliation>University of Dortmund, Dortmund, Germany</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Madhu</namePart><namePart type="family">Sudan</namePart><affiliation>Massachusetts Institute of Technology, MA, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Demetri</namePart><namePart type="family">Terzopoulos</namePart><affiliation>University of California, Los Angeles, CA, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Doug</namePart><namePart type="family">Tygar</namePart><affiliation>University of California, Berkeley, CA, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Moshe</namePart><namePart type="given">Y.</namePart><namePart type="family">Vardi</namePart><affiliation>Rice University, Houston, TX, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Gerhard</namePart><namePart type="family">Weikum</namePart><affiliation>Max-Planck Institute of Computer Science, Saarbrücken, Germany</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><originInfo><copyrightDate encoding="w3cdtf">2011</copyrightDate><issuance>serial</issuance></originInfo><identifier type="ISSN">0302-9743</identifier><identifier type="eISSN">1611-3349</identifier><identifier type="SeriesID">558</identifier><recordInfo><recordOrigin>Springer-Verlag GmbH Berlin Heidelberg, 2011</recordOrigin></recordInfo></relatedItem><identifier type="istex">A600F07245737974DAEF70E06078363BBFC68B93</identifier><identifier type="DOI">10.1007/978-3-642-24669-2_9</identifier><identifier type="ChapterID">9</identifier><identifier type="ChapterID">Chap9</identifier><accessCondition type="use and reproduction" contentType="copyright">Springer-Verlag GmbH Berlin Heidelberg, 2011</accessCondition><recordInfo><recordContentSource>SPRINGER</recordContentSource><recordOrigin>Springer-Verlag Berlin Heidelberg, 2011</recordOrigin></recordInfo></mods></metadata><enrichments><json:item><type>multicat</type><uri>https://api.istex.fr/document/A600F07245737974DAEF70E06078363BBFC68B93/enrichments/multicat</uri></json:item><istex:refBibTEI uri="https://api.istex.fr/document/A600F07245737974DAEF70E06078363BBFC68B93/enrichments/refBib"><teiHeader></teiHeader><text><front></front><body></body><back><listBibl><biblStruct xml:id="b0"><analytic><title level="a" type="main">Using Duplication for Multiprocessor Scheduling Problem with Hierarchical Communications</title><author><persName><forename type="first">E</forename><surname>Bampis</surname></persName></author><author><persName><forename type="first">R</forename><surname>Giroudeau</surname></persName></author><author><persName><forename type="first">J.-C</forename><surname>König</surname></persName></author></analytic><monogr><title level="j">Parallel Processing Letters</title><imprint><biblScope unit="volume">10</biblScope><biblScope unit="issue">1</biblScope><biblScope unit="page" from="133" to="140"></biblScope><date type="published" when="2000"></date></imprint></monogr></biblStruct><biblStruct xml:id="b1"><analytic><title level="a" type="main">A Realistic Model and an Efficient Heuristic for Scheduling with Heterogeneous Processors</title><author><persName><forename type="first">O</forename><surname>Beaumont</surname></persName></author><author><persName><forename type="first">V</forename><surname>Boudet</surname></persName></author><author><persName><forename type="first">Y</forename><surname>Robert</surname></persName></author></analytic><monogr><title level="m">11th Heterogeneous Computing Workshop</title><meeting><address><addrLine>Los Alamitos</addrLine></address></meeting><imprint><publisher>IEEE Computer Society Press</publisher><date type="published" when="2002"></date></imprint></monogr></biblStruct><biblStruct xml:id="b2"><analytic><title level="a" type="main">DAG Scheduling Using a Lookahead Variant of the Heterogeneous Earliest Finish Time Algorithm</title><author><persName><forename type="first">L</forename><forename type="middle">F</forename><surname>Bittencourt</surname></persName></author><author><persName><forename type="first">R</forename><surname>Sakellariou</surname></persName></author><author><persName><forename type="first">E</forename><forename type="middle">R M</forename><surname>Madeira</surname></persName></author></analytic><monogr><title level="m">18th Euromicro International Conference on Parallel, Distributed and Network-Based Computing</title><meeting><address><addrLine>Pisa, Italy</addrLine></address></meeting><imprint><date type="published" when="2010"></date></imprint></monogr></biblStruct><biblStruct xml:id="b3"><analytic><title level="a" type="main">Compaction of Schedules and a Two Stage Approach for Duplication-Based DAG Scheduling</title><author><persName><forename type="first">D</forename><surname>Bozdag</surname></persName></author><author><persName><forename type="first">F</forename><surname>Ozguner</surname></persName></author><author><persName><forename type="first">U</forename><forename type="middle">V</forename><surname>Catalyurek</surname></persName></author></analytic><monogr><title level="j">IEEE Transactions on Parallel and Distributed Systems</title><imprint><biblScope unit="volume">20</biblScope><biblScope unit="issue">6</biblScope><biblScope unit="page" from="857" to="871"></biblScope><date type="published" when="2009"></date></imprint></monogr></biblStruct><biblStruct xml:id="b4"><analytic><title level="a" type="main">Scheduling with Small Communication Delays and Task Duplication</title><author><persName><forename type="first">J.-Y</forename><surname>Colin</surname></persName></author><author><persName><forename type="first">P</forename><surname>Chrétienne</surname></persName></author></analytic><monogr><title level="j">Operations Research</title><imprint><biblScope unit="volume">39</biblScope><biblScope unit="issue">4</biblScope><biblScope unit="page" from="680" to="684"></biblScope><date type="published" when="1991"></date></imprint></monogr></biblStruct><biblStruct xml:id="b5"><analytic><title level="a" type="main">Scheduling Tasks and Communications on a Virtual Distributed System</title><author><persName><forename type="first">J.-Y</forename><surname>Colin</surname></persName></author><author><persName><forename type="first">P</forename><surname>Colin</surname></persName></author></analytic><monogr><title level="j">European Journal of Operational Research</title><imprint><biblScope unit="volume">94</biblScope><biblScope unit="issue">2</biblScope><date type="published" when="1996"></date></imprint></monogr></biblStruct><biblStruct xml:id="b6"><analytic><title level="a" type="main">Scheduling Tasks with Communication Delays on 2Levels Virtual Distributed Systems</title><author><persName><forename type="first">J.-Y</forename><surname>Colin</surname></persName></author><author><persName><forename type="first">M</forename><surname>Nakechbandi</surname></persName></author></analytic><monogr><title level="m">Proceedings of the 7th Euromicro Workshop on Parallel and Distributed Processing</title><meeting>the 7th Euromicro Workshop on Parallel and Distributed Processing<address><addrLine>Funchal, Portugal</addrLine></address></meeting><imprint><date type="published" when="1999"></date></imprint></monogr></biblStruct><biblStruct xml:id="b7"><monogr><title level="m" type="main">Computers and Intractability, a Guide to the Theory of NP-Completeness</title><author><persName><forename type="first">M</forename><surname>Garey</surname></persName></author><author><persName><forename type="first">D</forename><surname>Johnson</surname></persName></author><imprint><date type="published" when="1979"></date><publisher>Freeman</publisher><pubPlace>New York</pubPlace></imprint></monogr></biblStruct><biblStruct xml:id="b8"><analytic><title level="a" type="main">Scheduling with Communication Delay</title><author><persName><forename type="first">R</forename><surname>Giroudeau</surname></persName></author><author><persName><forename type="first">J.-C</forename><surname>König</surname></persName></author></analytic><monogr><title level="m">Multiprocessor Scheduling: Theory and Applications</title><imprint><publisher>ARS Publishing</publisher><date type="published" when="2007"></date><biblScope unit="page" from="1" to="26"></biblScope></imprint></monogr></biblStruct><biblStruct xml:id="b9"><analytic><title level="a" type="main">Efficient Algorithms for Graph Manipulation</title><author><persName><forename type="first">J</forename><surname>Hopcroft</surname></persName></author><author><persName><forename type="first">R</forename><surname>Tarjan</surname></persName></author></analytic><monogr><title level="j">Communications of the ACM</title><imprint><biblScope unit="volume">16</biblScope><biblScope unit="page" from="372" to="378"></biblScope><date type="published" when="1973"></date></imprint></monogr></biblStruct><biblStruct xml:id="b10"><analytic><title level="a" type="main">List Scheduling of General Task Graphs under LogP</title><author><persName><forename type="first">T</forename><surname>Kalinowski</surname></persName></author><author><persName><forename type="first">I</forename><surname>Kort</surname></persName></author><author><persName><forename type="first">D</forename><surname>Trystram</surname></persName></author></analytic><monogr><title level="j">Parallel Computing</title><imprint><biblScope unit="volume">26</biblScope><biblScope unit="page" from="1109" to="1128"></biblScope><date type="published" when="2000"></date></imprint></monogr></biblStruct><biblStruct xml:id="b11"><analytic><title level="a" type="main">Grain Size Determination for Parallel Processing</title><author><persName><forename type="first">B</forename><surname>Kruatrachue</surname></persName></author><author><persName><forename type="first">T</forename><forename type="middle">G</forename><surname>Lewis</surname></persName></author></analytic><monogr><title level="j">IEEE Software</title><imprint><biblScope unit="volume">5</biblScope><biblScope unit="issue">1</biblScope><biblScope unit="page" from="23" to="32"></biblScope><date type="published" when="1988"></date></imprint></monogr></biblStruct><biblStruct xml:id="b12"><analytic><title level="a" type="main">Static Scheduling Algorithms for Allocating Directed Task Graphs to Multi-Processors</title><author><persName><forename type="first">Y.-K</forename><surname>Kwok</surname></persName></author><author><persName><forename type="first">I</forename><surname>Ahmad</surname></persName></author></analytic><monogr><title level="j">ACM Computing Surveys (CSUR)</title><imprint><biblScope unit="volume">31</biblScope><biblScope unit="issue">4</biblScope><biblScope unit="page" from="406" to="471"></biblScope><date type="published" when="1999"></date></imprint></monogr></biblStruct><biblStruct xml:id="b13"><analytic><title level="a" type="main">Scheduling Algorithms for Data Redistribution and Load-Balancing on Master-Slave Platforms</title><author><persName><forename type="first">L</forename><surname>Marchal</surname></persName></author><author><persName><forename type="first">V</forename><surname>Rehn</surname></persName></author><author><persName><forename type="first">Y</forename><surname>Robert</surname></persName></author><author><persName><forename type="first">F</forename><surname>Vivien</surname></persName></author></analytic><monogr><title level="j">Parallel Processing Letters</title><imprint><biblScope unit="volume">17</biblScope><biblScope unit="issue">1</biblScope><biblScope unit="page" from="61" to="77"></biblScope><date type="published" when="2007"></date></imprint></monogr></biblStruct><biblStruct xml:id="b14"><analytic><title level="a" type="main">On the Complexity of Scheduling with Communication Delay and Contention</title><author><persName><forename type="first">M</forename><forename type="middle">G</forename><surname>Norman</surname></persName></author><author><persName><forename type="first">S</forename><surname>Pelagatti</surname></persName></author><author><persName><forename type="first">P</forename><surname>Thanisch</surname></persName></author></analytic><monogr><title level="j">Parallel Processing Letters</title><imprint><biblScope unit="volume">5</biblScope><biblScope unit="issue">3</biblScope><biblScope unit="page" from="331" to="341"></biblScope><date type="published" when="1995"></date></imprint></monogr></biblStruct><biblStruct xml:id="b15"><analytic><title level="a" type="main">Toward an Architecture Independent Analysis of Parallel Algorithms</title><author><persName><forename type="first">C</forename><forename type="middle">B</forename><surname>Papadimitriou</surname></persName></author><author><persName><forename type="first">M</forename><surname>Yannakakis</surname></persName></author></analytic><monogr><title level="m">Proceedings of the 20th Annual ACM Symposium Theory of Computing</title><meeting>the 20th Annual ACM Symposium Theory of Computing<address><addrLine>Santa Clara, California, USA</addrLine></address></meeting><imprint><date type="published" when="1988"></date></imprint></monogr></biblStruct><biblStruct xml:id="b16"><monogr><title level="m" type="main">Scheduling with Unit Interprocessor Communication Delays . Discrete Math</title><author><persName><forename type="first">V</forename><forename type="middle">J</forename><surname>Rayward-Smith</surname></persName></author><imprint><date type="published" when="1987"></date><biblScope unit="page" from="55" to="71"></biblScope></imprint></monogr></biblStruct><biblStruct xml:id="b17"><monogr><title level="m" type="main">Partitioning and Scheduling Parallel Programs for Execution on Multiprocessors</title><author><persName><forename type="first">V</forename><surname>Sarkar</surname></persName></author><imprint><date type="published" when="1989"></date><publisher>MIT Press</publisher><pubPlace>Cambridge</pubPlace></imprint></monogr></biblStruct><biblStruct xml:id="b18"><analytic><title level="a" type="main">Communication Contention in Task Scheduling</title><author><persName><forename type="first">O</forename><surname>Sinnen</surname></persName></author><author><persName><forename type="first">L</forename><surname>Sousa</surname></persName></author></analytic><monogr><title level="j">IEEE Transactions on Parallel and Distributed Systems</title><imprint><biblScope unit="volume">16</biblScope><biblScope unit="issue">6</biblScope><biblScope unit="page" from="503" to="515"></biblScope><date type="published" when="2005"></date></imprint></monogr></biblStruct><biblStruct xml:id="b19"><analytic><title level="a" type="main">Contention-Aware Scheduling with Task Duplication</title><author><persName><forename type="first">O</forename><surname>Sinnen</surname></persName></author><author><persName><forename type="first">A</forename><surname>To</surname></persName></author><author><persName><forename type="first">M</forename><surname>Kaur</surname></persName></author></analytic><monogr><title level="j">Journal of Parallel and Distributed Computing</title><imprint><biblScope unit="volume">71</biblScope><biblScope unit="issue">1</biblScope><biblScope unit="page" from="77" to="86"></biblScope><date type="published" when="2011"></date></imprint></monogr></biblStruct><biblStruct xml:id="b20"><analytic><title level="a" type="main">Contention-Aware Communication Schedule for High Speed Communication</title><author><persName><forename type="first">A</forename><surname>Tam</surname></persName></author><author><persName><forename type="first">C</forename><forename type="middle">L</forename><surname>Wang</surname></persName></author></analytic><monogr><title level="j">Cluster Computing</title><imprint><biblScope unit="volume">6</biblScope><biblScope unit="issue">4</biblScope><biblScope unit="page" from="339" to="353"></biblScope><date type="published" when="2003"></date></imprint></monogr></biblStruct></listBibl></back></text></istex:refBibTEI><json:item><type>refBibs</type><uri>https://api.istex.fr/document/A600F07245737974DAEF70E06078363BBFC68B93/enrichments/refBibs</uri></json:item></enrichments></istex></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/France/explor/LeHavreV1/Data/Istex/Corpus
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000898 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Istex/Corpus/biblio.hfd -nk 000898 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/France
|area= LeHavreV1
|flux= Istex
|étape= Corpus
|type= RBID
|clé= ISTEX:A600F07245737974DAEF70E06078363BBFC68B93
|texte= Scheduling Tasks and Communications on a Hierarchical System with Message Contention
}}
| This area was generated with Dilib version V0.6.25. |  |