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

Full description

Bibliographic Details

Published in:	Proceedings / IEEE International Conference on Cluster Computing pp. 428 - 437
Main Authors:	Akhmetova, Dana, Kestor, Gokcen, Gioiosa, Roberto, Markidis, Stefano, Laure, Erwin
Format:	Conference Proceeding
Language:	English
Published:	IEEE 01.09.2015
Subjects:	Aggregates Processor scheduling Programming Runtime Scalability Scheduling scheduling overhead Synchronization task granularity task-based programming models task-based schedulers
ISSN:	1552-5244
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!