ARM SVE Unleashed: Performance and Insights Across HPC Applications on Nvidia Grace
Ruimin Shi, Gabin Schieffer, Maya Gokhale, Pei-Hung Lin, Hiren Patel, Ivy Peng
TL;DR
The paper addresses the readiness of ARM SVE for HPC by profiling 13 diverse workloads on Nvidia Grace and applying an adapted roofline model to quantify vectorization impact. It introduces metrics such as the vectorization bound $VB = \frac{VLEN}{ELEN}$ and the instruction-reduction ratio $R_{ins\_reduction}$, plus a roofline-based diagnostic with inflection points $AI_{IRR}$ and $AI_{IRV}$ to distinguish compute- from memory-bound kernels. A 26-case classification via a decision tree reveals that 15 cases achieve speedup without porting, while others are memory-bound or non-vectorizable, with SpMV showcasing SVE's strength for irregular loops. The findings suggest single-precision workloads benefit most from SVE on Grace, whereas double-precision HPC tasks face challenges due to shorter vector lengths and memory bandwidth, guiding future design of memory systems, compilers, and HPC software for vector-length agnostic architectures.
Abstract
Vector architectures are essential for boosting computing throughput. ARM provides SVE as the next-generation length-agnostic vector extension beyond traditional fixed-length SIMD. This work provides a first study of the maturity and readiness of exploiting ARM and SVE in HPC. Using selected performance hardware events on the ARM Grace processor and analytical models, we derive new metrics to quantify the effectiveness of exploiting SVE vectorization to reduce executed instructions and improve performance speedup. We further propose an adapted roofline model that combines vector length and data elements to identify potential performance bottlenecks. Finally, we propose a decision tree for classifying the SVE-boosted performance in applications.
