Full-day tutorial at the workshop “Quantum Dynamics: From Algorithms to Applications”
Node-Level Performance Engineering
Slides: QDyn16_NLPE-update.pdf (final version)
Code: STREAM benchmark (C version) stream.c
Link to Lecture and exercises of “Programming Techniques for Supercomputers“: http://moodle.rrze.uni-erlangen.de/course/view.php?id=346
Authors/Presenters
Georg Hager1, Jan Eitzinger1 (not presenting), and Gerhard Wellein2
1 Erlangen Regional Computing Center
2 Department of Computer Science
University of Erlangen-Nuremberg
Germany
{georg.hager,jan.eitzinger,gerhard.wellein}@fau.de
Abstract
The advent of multi- and manycore chips has led to a further opening of the gap between peak and application performance for many scientific codes. This trend is accelerating as we move from petascale to exascale. Paradoxically, bad node-level performance helps to “efficiently” scale to massive parallelism, but at the price of increased overall time to solution. If the user cares about time to solution on any scale, optimal performance on the node level is often the key factor. We convey the architectural features of current processor chips, multiprocessor nodes, and accelerators, as far as they are relevant for the practitioner. Peculiarities like SIMD vectorization, shared vs. separate caches, bandwidth bottlenecks, and ccNUMA characteristics are introduced, and the influence of system topology and affinity on the performance of typical parallel programming constructs is demonstrated. Performance engineering and performance patterns are suggested as powerful tools that help the user understand the bottlenecks at hand and to assess the impact of possible code optimizations. A cornerstone of these concepts is the Roofline model, which is described in detail, including useful case studies, limits of its applicability, and possible refinements.