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

Podrobná bibliografie

Vydáno v:	Proceedings / IEEE International Conference on Cluster Computing s. 428 - 437
Hlavní autoři:	Akhmetova, Dana, Kestor, Gokcen, Gioiosa, Roberto, Markidis, Stefano, Laure, Erwin
Médium:	Konferenční příspěvek
Jazyk:	angličtina
Vydáno:	IEEE 01.09.2015
Témata:	Aggregates Processor scheduling Programming Runtime Scalability Scheduling scheduling overhead Synchronization task granularity task-based programming models task-based schedulers
ISSN:	1552-5244
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!