Ändra sökning
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
On the application task granularity and the interplay with the scheduling overhead in many-core shared memory systems
KTH, Skolan för datavetenskap och kommunikation (CSC), Beräkningsvetenskap och beräkningsteknik (CST).ORCID-id: 0000-0003-0639-0639
Visa övriga samt affilieringar
2015 (Engelska)Ingår i: Proceedings - IEEE International Conference on Cluster Computing, ICCC, IEEE , 2015, s. 428-437Konferensbidrag, Publicerat paper (Refereegranskat)
Resurstyp
Text
Abstract [en]

Task-based programming models are considered one of the most promising programming model approaches for exascale supercomputers because of their ability to dynamically react to changing conditions and reassign work to processing elements. One question, however, remains unsolved: what should the task granularity of task-based applications be? Fine-grained tasks offer more opportunities to balance the system and generally result in higher system utilization. However, they also induce in large scheduling overhead. The impact of scheduling overhead on coarse-grained tasks is lower, but large systems may result imbalanced and underutilized. In this work we propose a methodology to analyze the interplay between application task granularity and scheduling overhead. Our methodology is based on three main points: 1) a novel task algorithm that analyzes an application directed acyclic graph (DAG) and aggregates tasks, 2) a fast and precise emulator to analyze the application behavior on systems with up to 1,024 cores, 3) a comprehensive sensitivity analysis of application performance and scheduling overhead breakdown. Our results show that there is an optimal task granularity between 1.2x10^4 and 10x10^4 cycles for the representative schedulers. Moreover, our analysis indicates that a suitable scheduler for exascale task-based applications should employ a best-effort local scheduler and a sophisticated remote scheduler to move tasks across worker threads.

Ort, förlag, år, upplaga, sidor
IEEE , 2015. s. 428-437
Nyckelord [en]
Scheduling overhead, Task granularity, Task-based programming models, Task-based schedulers, Cluster computing, Computer architecture, Directed graphs, Sensitivity analysis, Supercomputers, Application behaviors, Application performance, Directed acyclic graph (DAG), Processing elements, Programming models, Shared memory system, Task-based, Scheduling
Nationell ämneskategori
Datorsystem
Identifikatorer
URN: urn:nbn:se:kth:diva-186853DOI: 10.1109/CLUSTER.2015.65ISI: 000378648100054Scopus ID: 2-s2.0-84959297511ISBN: 9781467365987 (tryckt)OAI: oai:DiVA.org:kth-186853DiVA, id: diva2:927909
Konferens
IEEE International Conference on Cluster Computing, CLUSTER 2015, 8 September 2015 through 11 September 2015
Anmärkning

QC 20160513

Tillgänglig från: 2016-05-13 Skapad: 2016-05-13 Senast uppdaterad: 2016-07-26Bibliografiskt granskad

Open Access i DiVA

Fulltext saknas i DiVA

Övriga länkar

Förlagets fulltextScopus

Personposter BETA

Markidis, StefanoLaure, Erwin

Sök vidare i DiVA

Av författaren/redaktören
Markidis, StefanoLaure, Erwin
Av organisationen
Beräkningsvetenskap och beräkningsteknik (CST)
Datorsystem

Sök vidare utanför DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetricpoäng

doi
isbn
urn-nbn
Totalt: 275 träffar
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf