Automatic Throughput and Critical Path Analysis of x86 and ARM Assembly Kernels
Preprint
Abstract
Useful models of loop kernel runtimes on out-of-order architectures require an analysis of the in-core performance behavior of instructions and their dependencies. While an instruction throughput prediction sets a lower bound to the kernel runtime, the critical path defines an upper bound. Such predictions are an essential part of analytic (i.e., white-box) performance models like the Roofline and Execution-Cache-Memory (ECM) models. They enable a better understanding of the performance-relevant interactions between hardware architecture and loop code. The Open Source Architecture Code Analyzer (OSACA) is a static analysis tool for predicting the execution time of sequential loops. It previously supported only x86 (Intel and AMD) architectures and simple, optimistic full-throughput execution. We have heavily extended OSACA to support ARM instructions and critical path prediction including the detection of loop-carried dependencies, which turns it into a versatile cross-architecture modeling tool. We show runtime predictions for code on Intel Cascade Lake, AMD Zen, and Marvell ThunderX2 micro-architectures based on machine models from available documentation and semi-automatic benchmarking. The predictions are compared with actual measurements.Keywords
All Related Versions
- Version 1, 2019-10-01, ArXiv
- Version 2, 2019-10-21, ArXiv
- Published version: , 1.
This publication has 5 references indexed in Scilit:
- uops.info2019
- Quantifying Performance Bottlenecks of Stencil Computations Using the Execution-Cache-Memory Model2015
- CQA: A code quality analyzer tool at binary level2014
- ZSim2013
- The gem5 simulatorACM SIGARCH Computer Architecture News, 2011