Breaking down the parallel time into work, idleness, and overheads is crucial for assessing the performance of HPC applications, but difficult to measure in asynchronous dependent tasking runtime systems. No existing tools allow its measurement portably and accurately. This paper introduces POT: a tool-suite for dependent task-based applications performance measurement. We focus on its low-disturbance methodology consisting of task modeling, discrete-event tracing, and post-mortem simulation-based analysis. It supports the OMPT standard OpenMP specifications. The paper evaluates the precision of POT’s parallel time breakdown analysis on LLVM and MPC implementations and shows that measurement bias may be neglected above \(16\, \upmu \) s workload per task, portably across two architectures and OpenMP runtime systems

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Measuring and Interpreting Dependent Task-Based Applications Performances

  • Romain Pereira,
  • Thierry Gautier,
  • Adrien Roussel,
  • Patrick Carribault

摘要

Breaking down the parallel time into work, idleness, and overheads is crucial for assessing the performance of HPC applications, but difficult to measure in asynchronous dependent tasking runtime systems. No existing tools allow its measurement portably and accurately. This paper introduces POT: a tool-suite for dependent task-based applications performance measurement. We focus on its low-disturbance methodology consisting of task modeling, discrete-event tracing, and post-mortem simulation-based analysis. It supports the OMPT standard OpenMP specifications. The paper evaluates the precision of POT’s parallel time breakdown analysis on LLVM and MPC implementations and shows that measurement bias may be neglected above \(16\, \upmu \) s workload per task, portably across two architectures and OpenMP runtime systems