Demystifying the Nvidia Ampere Architecture through Microbenchmarking and Instruction-level Analysis
Not on the map. Why?
Abstract (arXiv)
Graphics processing units (GPUs) are now considered the leading hardware to accelerate general-purpose workloads such as AI, data analytics, and HPC. Over the last decade, researchers have focused on demystifying and evaluating the microarchitecture features of various GPU architectures beyond what vendors reveal. This line of work is necessary to understand the hardware better and build more efficient workloads and applications. Many works have studied the recent Nvidia architectures, such as Volta and Turing, comparing them to their successor, Ampere. However, some microarchitecture features, such as the clock cycles for the different instructions, have not been extensively studied for the Ampere architecture. In this paper, we study the clock cycles per instructions with various data types found in the instruction-set architecture (ISA) of Nvidia GPUs. Using microbenchmarks, we measure the clock cycles for PTX ISA instructions and their SASS ISA instructions counterpart. we further calculate the clock cycle needed to access each memory unit. We also demystify the new version of the tensor core unit found in the Ampere architecture by using the WMMA API and measuring its clock cycles per instruction and throughput for the different data types and input shapes. The results found in this work should guide software developers and hardware architects. Furthermore, the clock cycles per instructions are widely used by performance modeling simulators and tools to model and predict the performance of the hardware.
Key facts. Cited by 9 papers in the map (data through 14 Oct 2026). First posted on arXiv 23 Aug 2022.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2024: 3; 2025: 2; 2026: 4.
9 papers.
- 2024Scaling Laws for Precisioncited by 95
- 2024MicroScopiQ: Accelerating Foundational Models through Outlier-Aware Microscaling Quantizationcited by 28
- 2025QuEST: Stable Training of LLMs with 1-Bit Weights and Activationscited by 22
- 2024MixLLM: LLM Quantization with Global Mixed-precision between Output-features and Highly-efficient System Designcited by 16
- 2026HybridGen: Efficient LLM Generative Inference via CPU-GPU Hybrid Computingcited by 2
- 2025APT-LLM: Exploiting Arbitrary-Precision Tensor Core Computing for LLM Accelerationcited by 1
- 2026Fast NF4 Dequantization Kernels for Large Language Model Inferencecited by 0
- 2026Incast-Free MoE Rate-Based Schedulingcited by 0
- 2026Scalable High-Fidelity Macromolecular Docking for GPU-Accelerated Supercomputerscited by 0
- 2026Scalable High-Fidelity Macromolecular Docking for GPU-Accelerated Supercomputers7 Aug 2026
- 2026Incast-Free MoE Rate-Based Scheduling28 Jul 2026
- 2026HybridGen: Efficient LLM Generative Inference via CPU-GPU Hybrid Computing20 Apr 2026
- 2026Fast NF4 Dequantization Kernels for Large Language Model Inference2 Apr 2026
- 2025APT-LLM: Exploiting Arbitrary-Precision Tensor Core Computing for LLM Acceleration26 Aug 2025
- 2025QuEST: Stable Training of LLMs with 1-Bit Weights and Activations7 Feb 2025
- 2024MixLLM: LLM Quantization with Global Mixed-precision between Output-features and Highly-efficient System Design19 Dec 2024
- 2024MicroScopiQ: Accelerating Foundational Models through Outlier-Aware Microscaling Quantization8 Nov 2024
- 2024Scaling Laws for Precision7 Nov 2024