Pith. sign in

REVIEW 2 cited by

Demystifying the Nvidia Ampere Architecture through Microbenchmarking and Instruction-level Analysis

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2208.11174 v1 pith:ZK6SOFX7 submitted 2022-08-23 cs.AR

Demystifying the Nvidia Ampere Architecture through Microbenchmarking and Instruction-level Analysis

classification cs.AR
keywords clockcyclesinstructionsamperearchitecturehardwaredatafound
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

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.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Dead on Arrival: Characterizing and Protecting Against Dead-Entry TLB Misses in GPU Microarchitectures

    cs.AR 2026-05 unverdicted novelty 6.0

    Dead-entry L2 TLB misses in GPUs, which can reach 99% of misses, are addressed by DEPOT, a 1 KB Bloom filter that prevents immediate re-eviction and improves IPC up to 72% on affected workloads.

  2. Incast-Free MoE Rate-Based Scheduling

    cs.NI 2026-07 conditional novelty 5.0

    Round-robin scheduling in MoE dispatch causes the arrival rate at the hottest receiver to grow exponentially, and a demand-normalized rate allocation prevents this by construction.