Composing Multiple StarPU Applications over Heterogeneous Machines: A Supervised Approach

• Published in: 2013 IEEE International Symposium on Parallel & Distributed Processing, Workshops and Phd Forum pp. 1050 - 1059
• Main Authors: Hugo, Andra-Ecaterina, Guermouche, Abdou, Wacrenier, Pierre-Andre, Namyst, Raymond
• Format: Conference Proceeding
• Language: English
• Published: IEEE 01-05-2013
• Subjects: Composability; Context; Dynamic scheduling; Kernel; Libraries; Runtime; StarPU; Virtual machine monitors
• DOI: 10.1109/IPDPSW.2013.217

Enabling HPC applications to perform efficiently when invoking multiple parallel libraries simultaneously is a great challenge. Even if a single runtime system is used underneath, scheduling tasks or threads coming from different libraries over the same set of hardware resources introduces many issues, such as resource oversubscription, undesirable cache flushes or memory bus contention. This paper presents an extension of StarPU, a runtime system specifically designed for heterogeneous architectures, that allows multiple parallel codes to run concurrently with minimal interference. Such parallel codes run within scheduling contexts that provide confined execution environments which can be used to partition computing resources. Scheduling contexts can be dynamically resized to optimize the allocation of computing resources among concurrently running libraries. We introduce a hypervisor that automatically expands or shrinks contexts using feedback from the runtime system (e.g. resource utilization). We demonstrate the relevance of our approach using benchmarks invoking multiple high performance linear algebra kernels simultaneously on top of heterogeneous multicore machines. We show that our mechanism can dramatically improve the overall application run time (-34%), most notably by reducing the average cache miss ratio (-50%).