Equation 30 · The Network Is the Computer Again
What does this equation mean?
Read the formula alongside the article passage below. Each part has a deeper page with its role in the equation, the supporting passage and nearby citations.
This equation states an equality: the expressions on both sides have the same value under the article’s assumptions. Read the equation part by part below; each part has a contextual explanation and a link to its mathematical background.
Read it piece by piece
Symbol p
p is one of the signed contributions combined to compute the quantity on the left.
=
The expressions on both sides represent the same quantity under the stated assumptions.
See an illustrated explanation →subtraction
Subtract the following term or group from the preceding one. A leading minus marks a negative quantity.
subscript
The lower label selects a particular version, component, or indexed member of the quantity. For example, x₀ and xₜ can be values at different positions.
superscript
A raised number can be a power. When it is a label or bound, it selects a case or the upper limit of a sum; the formula’s structure distinguishes these uses.
See an illustrated explanation →How to interpret it
Read it with the definitions, units, and assumptions supplied by the article.
What the article says around this equation
The reason this matters more for collectives than for ordinary traffic is synchronisation. A collective is a barrier. Every participant waits for the operation to complete, so the operation completes when the last contribution arrives. Tail latency therefore stops being a tail statistic and becomes the mean cost of every step. Dean and Barroso’s analysis of latency variability in large fan-out services is the canonical statement of the mechanism: background activity, queueing at multiple layers including network switches, and shared-resource contention produce occasional slow responses, and a request that must wait on many servers is very likely to encounter one [ 18 ] . The arithmetic is…
Read the full surrounding passage
The reason this matters more for collectives than for ordinary traffic is synchronisation. A collective is a barrier. Every participant waits for the operation to complete, so the operation completes when the last contribution arrives. Tail latency therefore stops being a tail statistic and becomes the mean cost of every step. Dean and Barroso’s analysis of latency variability in large fan-out services is the canonical statement of the mechanism: background activity, queueing at multiple layers including network switches, and shared-resource contention produce occasional slow responses, and a request that must wait on many servers is very likely to encounter one [ 18 ] . The arithmetic is unforgiving. If each participant independently exceeds its budget with probability q , the probability that at least one of p participants does so is . so at a one-percent per-participant rate and 100 participants, roughly 63 percent of collectives are affected — and at 1,000 participants, essentially all of them. That is my own arithmetic on an independence assumption that real systems violate in both directions, but the direction of the effect is not in doubt.
Sources cited in the surrounding passage
These citations give research context. Read each source to check which claims it supports.
Return to The Network Is the Computer Again