advanced26 min studyLesson 230 in Engineering

Telemetry boundaries and realistic capacity tests

Reconcile counters, time windows, and collective completion before claiming fabric utilization or headroom.

On this page

What you’ll understand

  • Calculate a counter-delta rate with a valid epoch and interval.
  • Distinguish payload, interface, wire, and collective-normalized byte accounting.
  • Design capacity evidence that includes burst, tail, and degraded-workload behavior.

A dashboard percentage is the end of an accounting chain: some device counted some events over some interval, then a collector normalized them against a chosen denominator. Every link in that chain can differ from the application's useful work. Fabric validation combines precise telemetry with representative workload tests. The goal is to explain completion behavior and usable headroom, not to produce the largest plausible bandwidth number.

A rate needs a valid counter delta

Determine whether a counter covers a physical port, virtual interface, queue, priority, function, or entire adapter. Hardware and software statistics may count at different points, and offloads can change the relationship between packets observed by software and frames on the link. A counter named bytes may include headers, exclude some framing, or count only successful traffic. Use the driver or vendor definition instead of assuming every similarly named metric can be added or directly compared.

Compute differences only across a compatible measurement epoch. Device reset, process restart, counter wrap, or collector changes can break a simple subtraction. A negative delta is not negative traffic. Align clocks and intervals when correlating endpoints and switches, but remember that imperfect synchronization can shift a short event between samples. Preserve the raw totals, collection timestamps, definitions, and topology labels so a derived percentage can be audited after an incident.

Bcounted=C1−C0t1−t0,t1>t0B_{\rm counted}=\frac{C_1-C_0}{t_1-t_0},\qquad t_1>t_0
C values are cumulative bytes from one compatible counter epoch and times are seconds, giving bytes/s. The formula assumes no unhandled reset or wrap and says nothing about bytes excluded by that counter's definition.↔ Scroll wide equations horizontally.

Averages and normalized bandwidth hide different things

A one-second rate cannot reveal every microburst within that second. Queue watermarks, device-supported latency histograms, and carefully chosen higher-resolution signals can expose short congestion intervals, each with its own scope and sampling limits. A watermark gives a maximum since a defined reset, not the duration of congestion. Mark, drop, pause, and retry counters explain different mechanisms; a low value in one does not establish spare capacity in another resource.

Collective tests add another normalization layer. Algorithm bandwidth divides a defined input size by operation duration; normalized bus bandwidth applies an operation-specific factor. Neither is automatically a physical port's exact wire rate. Compare them only after mapping ranks, local links, NIC sharing, and actual algorithm behavior. A standalone point-to-point transfer can validate one path, but a realistic training step also contains synchronized communication, compute overlap, storage activity, and straggler effects.

Ucounted=8BcountedRnominalU_{\rm counted}=\frac{8B_{\rm counted}}{R_{\rm nominal}}
B_counted is bytes/s and R_nominal is bit/s, giving a dimensionless ratio. It is counted-byte load relative to nominal line rate, not necessarily exact physical utilization when framing, coding, retransmissions, or counter boundaries differ.↔ Scroll wide equations horizontally.

Test the acceptance criterion the job actually has

Build a workload matrix covering message sizes, fan-in, all-reduce, all-gather, and skewed all-to-all where relevant. Record correctness, mean and tail completion, rank spread, and per-boundary telemetry. Increase load gradually to identify where useful throughput flattens or tail latency changes sharply. Repeat under a removed or degraded path and representative background work. Keep configuration and placement reproducible so a regression can be separated from a different hash assignment or traffic distribution.

The Roofline lab provides a deliberately separate accounting check. Reset and set both I=4 FLOP/byte, B=80 GB/s, predict 320 GFLOP/s and ridge 12.5 FLOP/byte, then Step. Reset and re-set I=16, B=80, predicting the fixed 1,000 GFLOP/s ceiling. This is a hypothetical memory-boundary model, not fabric telemetry: playback traces a roof without measuring traffic. State exactly which measured bytes and work would justify a comparable bound before using any reported bandwidth as a substitute.

An interface rate is not every utilization metric

One defined interface counter increases by 5,000,000,000 bytes during a compatible 0.5-second interval. The nominal link rate is 100 Gbit/s. Ignore reset and wrap, but do not assume the counter includes all physical overhead.

  1. Divide 5×10⁹bytes by 0.5 seconds to obtain 10×10⁹bytes/s, or 10 decimal GB/s for the counter's specified traffic scope.

  2. Multiply by eight to get 80 Gbit/s. Dividing by 100 Gbit/s yields 0.8, or 80% counted-byte load relative to nominal line rate.

  3. Do not call the remaining 20% guaranteed application headroom. Missing framing or coding, direction differences, microbursts, endpoint limits, and shared cuts can change usable capacity. Reconcile definitions and test representative job completion before increasing admission.

The result

The calculation establishes a defined counter rate. A broader fabric-capacity claim needs matching boundaries and workload evidence.

Explore the model

Interactive lab

Interactive lab · roofline

Audit the units before accepting the bound

Reset, set I=4 FLOP/byte and B=80 GB/s: predict 320 GFLOP/s and ridge 12.5. Reset and re-set I=16, B=80: predict 1,000 GFLOP/s. This synthetic memory-boundary roof is not a NIC counter, fabric benchmark, or collective traffic model.

Audit the units before accepting the boundSynthetic roofline ceiling min(1000, B·I), in GFLOP/s, with B in decimal GB/s and I in FLOP/byte. Playback traces the roof without changing the selected kernel. This upper-bound model is not a measured throughput prediction, hardware comparison or price model. Current readings: Attainable ceiling: 640 GFLOP/s; Ridge intensity: 12.5 FLOP/byte; Ceiling regime: Memory-bound ceiling. All parameters are adjustable with the labeled controls below.Hypothetical roofline upper bound: 640 GFLOP per second at operational intensity 8 FLOP per byte and bandwidth 80 gigabytes per second.0.1110641101001000Operational intensity · FLOP/byte · log scaleCeiling · GFLOP/s · log scalePeak: 1000
Attainable ceiling / kernelBandwidth roof / traceCompute ceiling
Attainable ceiling
640 GFLOP/s
Ridge intensity
12.5 FLOP/byte
Ceiling regime
Memory-bound ceiling
t = 0 s

Synthetic roofline ceiling min(1000, B·I), in GFLOP/s, with B in decimal GB/s and I in FLOP/byte. Playback traces the roof without changing the selected kernel. This upper-bound model is not a measured throughput prediction, hardware comparison or price model. Parameter changes pause playback and recompute the model at the current elapsed time. Reset restores both parameters and returns time to zero. Playback starts paused. Adjust either parameter, then choose Play or Step.

Look forUnit consistency is necessary, while matching counting boundaries and realistic workload behavior supplies the rest of the evidence.

Check your understanding

A link counter suggests 80% average load against nominal line rate. What conclusion is justified without more evidence?

Try it yourself

A 100 Gbit/s link sends at line rate for 100 microseconds and is idle for the rest of a one-second interval. Ignoring overhead and counting all transmitted bytes, find the average bit rate and explain why it cannot rule out a short queue spike.

Take a moment to make a prediction or work it out on paper. Open a hint when you need one.

Give me a hint

Multiply peak rate by the active fraction 100 microseconds/one second.

Compare with the solution

The active fraction is 0.0001, so average rate is 0.01 Gbit/s, or 10 Mbit/s. The burst transfers 1.25 million bytes in its short active interval. A downstream bottleneck or synchronized additional arrivals can still create a queue spike during that interval; the low one-second mean contains no guarantee about peak occupancy or tail delay.

Take it with you

  • Counter rates inherit their scope, epoch, and byte definitions.
  • Averages and collective-normalized metrics do not expose every physical bottleneck.
  • Capacity acceptance needs realistic, correct, and degraded workload completion evidence.

Read further

Original sources and deeper explanations to follow at your own pace.

Optional progress, saved in this browser when available. Revisit any lesson at any time.

Lesson not marked complete.