Extending the Roofline Model for Asynchronous Many-Task Runtimes

A common practice for application developers is to experimentally determine the granularity of a task after a code has been parallelized based on the observed overhead of a runtime. Instead, we propose a new methodology based on an extended Roofline model to provide practical upper bounds on the thr...

Full description

Saved in:
Bibliographic Details
Published in2016 IEEE International Conference on Cluster Computing (CLUSTER) pp. 493 - 496
Main Authors Suetterlein, Joshua D., Landwehr, Joshua, Marquez, Andres, Manzano, Joseph, Gao, Guang R.
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.09.2016
Subjects
Analytical models
Asynchronous Many Task Runtimes
Bandwidth
exascale
Extreme scale computing
Optical character recognition software
Resource management
Runtime
Throughput
Upper bound
Online AccessGet full text

Cover

More Information
Summary:A common practice for application developers is to experimentally determine the granularity of a task after a code has been parallelized based on the observed overhead of a runtime. Instead, we propose a new methodology based on an extended Roofline model to provide practical upper bounds on the throughput performance of an application. First, we extend the Roofline model to support not only latency hiding analysis, but also a multidimensional amortized analysis. By combining this new methodology with a serial application and an Asynchronous Many Task (AMT) runtime implementation, we can predict the worst case runtime overhead attribution of individual runtime features prior to the development of parallel code.
ISSN:2168-9253
DOI:10.1109/CLUSTER.2016.47