GPU Design · All levels
Vertex, Tessellation & Geometry Stages
Graphics Pipeline Architecture: Programmable and fixed-function front-end stages transform and amplify geometry before rasterization, shaping downstream workload density.
What this topic teaches
Vertex, Tessellation & Geometry Stages converts GPU architecture concepts into review-ready engineering decisions. Programmable and fixed-function front-end stages transform and amplify geometry before rasterization, shaping downstream workload density. The practical goal is to tie counters and traces to a specific mechanism, owner, and closure action.
The senior-engineer question
When primitive amplification ratio, stage occupancy, and setup throughput shifts, can you prove whether the root cause is SIMT control flow, SM scheduling, memory traffic, interconnect pressure, or graphics stage imbalance?
SIMT EXECUTION — Vertex, Tessellation & Geometry Stages
warp 0 lanes: 0 1 2 3 4 5 6 7 ... 31
active mask : 1 1 1 1 0 0 1 1 ... 1
instruction : IF branch taken on active lanes
cycle 10: issue warp 0
cycle 11: issue warp 3
cycle 12: warp 0 reconverges
Focus: anchor discussion in lane masks and warp progress
Metric tracked: primitive amplification ratio, stage occupancy, and setup throughputPicture the architecture
Begin with an architecture sketch before touching tuning knobs. These diagrams are for design reviews, interview whiteboards, and closure discussions.
Front-end graphics stage pipeline
GRAPHICS FRONT-END
vertex fetch -> vertex shader -> tessellation -> geometry shader -> primitive setup
| | | |
cache pressure ALU load amplification primitive rate
Key check: amplification spikes can flood downstream raster queues.Stage ownership and handoff
GPU OWNERSHIP LAYERS — Vertex, Tessellation & Geometry Stages
artifact area owner
---------------- ----------------------------
architecture graphics architect
RTL/microarch front-end RTL owner
software/tools driver team
Rule: each metric needs a named owner before signoff.SM and datapath context
SM BLOCK DIAGRAM — Vertex, Tessellation & Geometry Stages
+---------------------------+
| Warp Schedulers / Dispatch|
+------------+--------------+
|
+---------------+----------------+
| Register File / Operand Cross |
+--------+---------------+-------+
| |
[ALU/FPU] [LD/ST]
| |
+-------+-------+
|
L1 / Shared Mem
Focus: front-end to execute dataflowMemory hierarchy context
GPU MEMORY HIERARCHY — Vertex, Tessellation & Geometry Stages
[ Registers ]
latency: 1-2 cycles
|
[ Shared/L1 ]
latency: 20-40 cycles
|
[ L2 ]
latency: 150-250 cycles
|
[ HBM/GDDR VRAM ]
latency: 300ns+ effective
Optimization lens: capacity vs latencyScheduler context
WARP SCHEDULER VIEW — Vertex, Tessellation & Geometry Stages
cycle -> 0 1 2 3 4
eligible [W1,W2,W5] [W2] [W2,W7] [W7] [W3,W7]
issued W1 W2 W7 W7 W3
stall reason - dep wait - mem wait -
Scheduler objective: keep issue slots non-empty.
Focus: eligible warp qualityOwnership layers
GPU OWNERSHIP LAYERS — Vertex, Tessellation & Geometry Stages
artifact area owner
---------------- ----------------------------
architecture graphics architect
RTL/microarch front-end RTL owner
software/tools driver team
Rule: each metric needs a named owner before signoff.Evidence to collect
Primary metric: primitive amplification ratio, stage occupancy, and setup throughput.
Primary artifact: graphics stage timeline, primitive count waterfall, and bottleneck attribution.
Owners to include: graphics architect, front-end RTL owner, driver team.
One reproducible failing workload and one stable comparator workload.
One counter capture that separates compute issue from memory/interconnect pressure.
Roofline lens
BANDWIDTH ROOFLINE — Vertex, Tessellation & Geometry Stages
performance
^
| compute ceiling
| /
| /
|-------------/------------------ memory ceiling
+------------------------------------------> operational intensity
memory-bound compute-bound
Interpretation: identify compute vs memory boundCoalescing lens
COALESCING PATTERN — Vertex, Tessellation & Geometry Stages
WARP ADDRESSES
lane: 0 1 2 3 4 5 6 7
addr: 0 4 8 C 10 14 18 1C -> contiguous -> 1 transaction segment
lane: 0 1 2 3 4 5 6 7
addr: 0 40 8 48 10 50 18 58 -> strided/scatter -> many segments
Effect: fewer coalesced segments => better bandwidth efficiency.
Focus: transaction inflation from scatterSubpages in this topic
Each topic includes mechanism, inputs/outputs, reports, debug, worked example, pitfalls, interview, checklist, theory deep dive, design space, case study, walkthrough, matrix, software view, and silicon impact.
Key takeaways
Always connect warp behavior to measured counters before proposing fixes.
Treat memory transaction quality as equal priority to compute utilization.
Close decisions with explicit owners and reproducible benchmark evidence.
Common pitfalls
Copying tuning patterns from unrelated workloads or scenes.
Using occupancy as a success metric without stall classification.
Declaring closure without end-to-end frame or kernel validation.
GPU deep dive
Frame-time stability depends on balancing fixed-function stages with programmable shader pressure.
Concept diagram
GRAPHICS PIPELINE
vertex -> tessellation -> raster -> fragment -> ROP/blendMetric graph
FRAME-TIME PRESSURE
fragment shading load ████████
raster backpressure █████
ROP/blend stalls ████Reports and artifacts
stage occupancy timeline
early-Z efficiency report
ROP queue depth
overdraw heatmap
Mini case study
Async compute overlapped with heavy fragment scenes and triggered ROP queue buildup, causing p99 frame spikes.
Debug branches
Correlate frame spikes with stage-level queues
Validate early-Z effectiveness under real content
Isolate graphics-compute arbitration conflicts
Senior review question
Ask: which metric and benchmark pairing proves this topic is truly closed in production context?
Key takeaways
Always pair micro-kernel metrics with end-to-end workload impact.
Lock toolchain, driver, and launch metadata before comparing performance results.
Common pitfalls
Optimizing occupancy without checking memory-system saturation.
Comparing profiler captures from different driver or compiler builds.
Declaring wins without reproducible accuracy and performance gates.