Abstract
The frenetic development of the current architectures places a strain on the current state-of-the-art programming environments. Harnessing the full potential of such architectures is a tremendous task for the whole scientific computing community. We present DAGuE a generic framework for architecture aware scheduling and management of micro-tasks on distributed many-core heterogeneous architectures. Applications we consider can be expressed as a Direct Acyclic Graph of tasks with labeled edges designating data dependencies. DAGs are represented in a compact, problem-size independent format that can be queried on-demand to discover data dependencies, in a totally distributed fashion. DAGuE assigns computation threads to the cores, overlaps communications and computations and uses a dynamic, fully-distributed scheduler based on cache awareness, data-locality and task priority. We demonstrate the efficiency of our approach, using several micro-benchmarks to analyze the performance of different components of the framework, and a linear algebra factorization as a use case. © 2011 Elsevier B.V. All rights reserved.
Author supplied keywords
Cite
CITATION STYLE
Bosilca, G., Bouteiller, A., Danalis, A., Herault, T., Lemarinier, P., & Dongarra, J. (2012). DAGuE: A generic distributed DAG engine for High Performance Computing. Parallel Computing, 38(1–2), 37–51. https://doi.org/10.1016/j.parco.2011.10.003
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.