Zobrazit v EDS

Scheduling Direct Acyclic Graphs on Massively Parallel 1K-core Processors

Uloženo v:
Podrobná bibliografie
Název: Scheduling Direct Acyclic Graphs on Massively Parallel 1K-core Processors
Autoři: Ke Yue, Ioan Raicu
Přispěvatelé: The Pennsylvania State University CiteSeerX Archives
Zdroj: http://datasys.cs.iit.edu/reports/2014_IIT-1K-cores.pdf.
Sbírka: CiteSeerX
Témata: KEY WORDS, NoC, Many Task Computing, Scheduling
Popis: The era of manycore computing will bring new fundamental challenges that the techniques designed for single core processors will have to be dramatically changed to support the coming wave of extreme-scale computing with thousands of cores on a single processor. Today’s programming languages (e.g. C/C++, Java) are unlikely to scale to manycore levels. One approach to address such concurrency problem is to look at many-task computing (MTC). Many MTC applications are structured as graphs of discrete tasks, with explicit input and output dependencies forming the directed edges. We designed both static and dynamic schedulers for such MTC applications, scalable to 1K-cores. The simulation study by using a cycle accurate NoC simulator shows that the proposed strategy result in 85 % shorter makespan and 90 % higher utilization in comparison to random mapping. In addition, our heuristic can tolerate variance of the tasks ’ execution times at runtime and deliver improved makespan and utilization.
Druh dokumentu: text
Popis souboru: application/pdf
Jazyk: English
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.646.975
Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.646.975
http://datasys.cs.iit.edu/reports/2014_IIT-1K-cores.pdf
Rights: Metadata may be used without restrictions as long as the oai identifier remains attached to it.
Přístupové číslo: edsbas.66201F4
Databáze: BASE
FullText Text:
  Availability: 0
CustomLinks:
  – Url: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.646.975#
    Name: EDS - BASE (s4221598)
    Category: fullText
    Text: View record from BASE
  – Url: https://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=EBSCO&SrcAuth=EBSCO&DestApp=WOS&ServiceName=TransferToWoS&DestLinkType=GeneralSearchSummary&Func=Links&author=Yue%20K
    Name: ISI
    Category: fullText
    Text: Nájsť tento článok vo Web of Science
    Icon: https://imagesrvr.epnet.com/ls/20docs.gif
    MouseOverText: Nájsť tento článok vo Web of Science
Header DbId: edsbas
DbLabel: BASE
An: edsbas.66201F4
RelevancyScore: 750
AccessLevel: 3
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 750
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Scheduling Direct Acyclic Graphs on Massively Parallel 1K-core Processors
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Ke+Yue%22">Ke Yue</searchLink><br /><searchLink fieldCode="AR" term="%22Ioan+Raicu%22">Ioan Raicu</searchLink>
– Name: Author
  Label: Contributors
  Group: Au
  Data: The Pennsylvania State University CiteSeerX Archives
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <i>http://datasys.cs.iit.edu/reports/2014_IIT-1K-cores.pdf</i>.
– Name: Subset
  Label: Collection
  Group: HoldingsInfo
  Data: CiteSeerX
– Name: Subject
  Label: Subject Terms
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22KEY+WORDS%22">KEY WORDS</searchLink><br /><searchLink fieldCode="DE" term="%22NoC%22">NoC</searchLink><br /><searchLink fieldCode="DE" term="%22Many+Task+Computing%22">Many Task Computing</searchLink><br /><searchLink fieldCode="DE" term="%22Scheduling%22">Scheduling</searchLink>
– Name: Abstract
  Label: Description
  Group: Ab
  Data: The era of manycore computing will bring new fundamental challenges that the techniques designed for single core processors will have to be dramatically changed to support the coming wave of extreme-scale computing with thousands of cores on a single processor. Today’s programming languages (e.g. C/C++, Java) are unlikely to scale to manycore levels. One approach to address such concurrency problem is to look at many-task computing (MTC). Many MTC applications are structured as graphs of discrete tasks, with explicit input and output dependencies forming the directed edges. We designed both static and dynamic schedulers for such MTC applications, scalable to 1K-cores. The simulation study by using a cycle accurate NoC simulator shows that the proposed strategy result in 85 % shorter makespan and 90 % higher utilization in comparison to random mapping. In addition, our heuristic can tolerate variance of the tasks ’ execution times at runtime and deliver improved makespan and utilization.
– Name: TypeDocument
  Label: Document Type
  Group: TypDoc
  Data: text
– Name: Format
  Label: File Description
  Group: SrcInfo
  Data: application/pdf
– Name: Language
  Label: Language
  Group: Lang
  Data: English
– Name: NoteTitleSource
  Label: Relation
  Group: SrcInfo
  Data: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.646.975
– Name: URL
  Label: Availability
  Group: URL
  Data: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.646.975<br />http://datasys.cs.iit.edu/reports/2014_IIT-1K-cores.pdf
– Name: Copyright
  Label: Rights
  Group: Cpyrght
  Data: Metadata may be used without restrictions as long as the oai identifier remains attached to it.
– Name: AN
  Label: Accession Number
  Group: ID
  Data: edsbas.66201F4
PLink https://erproxy.cvtisr.sk/sfx/access?url=https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=edsbas&AN=edsbas.66201F4
RecordInfo BibRecord:
  BibEntity:
    Languages:
      – Text: English
    Subjects:
      – SubjectFull: KEY WORDS
        Type: general
      – SubjectFull: NoC
        Type: general
      – SubjectFull: Many Task Computing
        Type: general
      – SubjectFull: Scheduling
        Type: general
    Titles:
      – TitleFull: Scheduling Direct Acyclic Graphs on Massively Parallel 1K-core Processors
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Ke Yue
      – PersonEntity:
          Name:
            NameFull: Ioan Raicu
      – PersonEntity:
          Name:
            NameFull: The Pennsylvania State University CiteSeerX Archives
    IsPartOfRelationships:
      – BibEntity:
          Identifiers:
            – Type: issn-locals
              Value: edsbas
            – Type: issn-locals
              Value: edsbas.oa
          Titles:
            – TitleFull: http://datasys.cs.iit.edu/reports/2014_IIT-1K-cores.pdf
              Type: main
ResultId 1