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

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Proceedings / IEEE International Conference on Cluster Computing S. 428 - 437
Hauptverfasser:	Akhmetova, Dana, Kestor, Gokcen, Gioiosa, Roberto, Markidis, Stefano, Laure, Erwin
Format:	Tagungsbericht
Sprache:	Englisch
Veröffentlicht:	IEEE 01.09.2015
Schlagworte:	Aggregates Processor scheduling Programming Runtime Scalability Scheduling scheduling overhead Synchronization task granularity task-based programming models task-based schedulers
ISSN:	1552-5244
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!