On the Application Task Granularity and the Interplay with the Scheduling Overhead in Many-Core Shared Memory Systems

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...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Proceedings / IEEE International Conference on Cluster Computing s. 428 - 437
Hlavní autori:	Akhmetova, Dana, Kestor, Gokcen, Gioiosa, Roberto, Markidis, Stefano, Laure, Erwin
Médium:	Konferenčný príspevok..
Jazyk:	English
Vydavateľské údaje:	IEEE 01.09.2015
Predmet:	Aggregates Processor scheduling Programming Runtime Scalability Scheduling scheduling overhead Synchronization task granularity task-based programming models task-based schedulers
ISSN:	1552-5244
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!