← Mathematical compendium

Published equation contexts

Rattainable=min⁡(Rpeak,B⋅I)R_{\mathrm{attainable}} = \min(R_{\mathrm{peak}}, B \cdot I)

Why this formula appears here

The general form of the argument is old and well posed. Williams, Waterman and Patterson built the roofline model on the premise that “for the recent past and foreseeable future, off-chip memory bandwidth will often be the constraining resource”, and defined operational intensity as operations per byte of DRAM traffic [ 1 ] . Their bound is one line, and it is the single most useful line in this whole subject: Rattainable=min⁡(Rpeak,B⋅I)R_{\mathrm{attainable}} = \min(R_{\mathrm{peak}}, B \cdot I). with RpeakR_{\mathrm{peak}} the peak arithmetic rate, B the achievable memory bandwidth and I the operational intensity of the kernel. If I is small, the second term wins and the accelerator’s headline throughput is irrelevant.

Read the full article-specific guide →

Read the representative guide

RattainableR_{\mathrm{attainable}}

Symbol R_attainable

RaR_attainable is the quantity selected or evaluated by the optimization written on the right.

Read this term in its guide →

How to interpret it

Read it with the definitions, units, and assumptions supplied by the article.

Research cited beside this formula

Published contexts (1)

A symbol can carry a different meaning in another article. Each occurrence keeps its own guide and term definitions.

Rattainable=min⁡(Rpeak,B⋅I)R_{\mathrm{attainable}} = \min(R_{\mathrm{peak}}, B \cdot I)

Equation 1 · Small & Edge Models

The Deployment Envelope: Small Models Where the Power Is Not

This equation states an equality: the expressions on both sides have the same value under the article’s assumptions.

The general form of the argument is old and well posed. Williams, Waterman and Patterson built the roofline model on the premise that “for the recent past and foreseeable future, off-chip memory bandwidth will often be the constraining resource”, and defined operational intensity as operations per byte of DRAM traffic [ 1 ] . Their bound is one line, and it is the single most useful line in this whole subject: Rattainable=min⁡(Rpeak,B⋅I)R_{\mathrm{attainable}} = \min(R_{\mathrm{peak}}, B \cdot I). with RpeakR_{\mathrm{peak}} the peak arithmetic rate, B the achievable memory bandwidth and I the operational intensity of the kernel. If I is small, the second term wins and the accelerator’s headline throughput is irrelevant.

Meanings in this article

  • RpeakR_{\mathrm{peak}}: the peak arithmetic rate.
  • BB: the achievable memory bandwidth and I the operational intensity of the kernel.
  • II: the operational intensity of the kernel.
Equation guide → · Article →