← All parts of this equation

Equation 24 · Part 4 · The Network Is the Computer Again

Symbol α

Trd(n,p)=⌈log⁡2p⌉ α+⌈log⁡2p⌉ n (β+γ),T_{\mathrm{rd}}(n,p) = \lceil \log_2 p \rceil \,\alpha + \lceil \log_2 p \rceil \, n\,(\beta + \gamma),
α\alpha

What this part means

the writing.

Its job in the formula

α is one of the signed contributions combined to compute the quantity on the left.

Where the article explains it

Writing α\alpha for latency per message, β\beta for transfer time per byte and γ\gamma for reduction time per byte, the cost of a collective over p participants on n bytes takes the shape T(n,p) = α\alpha\,L(p) + β\beta\,W(n,p) + γ\gamma\,C(n,p), where L counts message steps, W counts bytes crossing each link and C counts arithmetic.

The passage around this formula

But look at the latency term: 2(p-1)α\alpha grows linearly in the number of participants. A recursive-doubling or tree scheme instead completes in ⌈\lceil log⁡2\log_2 p ⌉\rceil rounds: Trd(n,p)=⌈log⁡2p⌉ α+⌈log⁡2p⌉ n (β+γ)T_{\mathrm{rd}}(n,p) = \lceil \log_2 p \rceil \,\alpha + \lceil \log_2 p \rceil \, n\,(\beta + \gamma). paying a logarithmic latency term but sending the full message in every round, so its bandwidth cost grows with log⁡\log p rather than staying flat.

Read this part in the article →

Learn the underlying idea

A variable is a named place for a value. Its letter is a local label: x can mean position in one formula and a data point in another.

Open the illustrated variables: a letter stands for a value guide →

See this notation across published equations →

Sources cited in the article section

These citations provide research context; check each source for the exact claim it supports.