Construct · 1 fields · 1 citations

Brent's theorem: a standalone construct

One name. One construct. A landmark on the map.

● anchor · a standalone construct Nearest construct by meaning·not indexed

A single standalone construct; nearby constructs are located against it in the Collider. Tap a field for its definition, unit, and measures.

Parallel computing

the bound that a computation with total work W and critical path length D runs in at most W/p plus D steps on p processors.

In parallel computing, Brent's theorem refers to the bound that a computation with total work W and critical path length D runs in at most W/p plus D steps on p processors. This meaning comes from Brent (1974) in Journal of the ACM.[1]

Unit
Recovery means
Measured by

Run it through the Collider, or take the citations with you.

See how Brent's theorem sits against neighbouring constructs in the Collider, or export every reference on this page in one click.

Open in Collider Export BibTeX Report this entry

Nearby constructs

parallel1 fields · 1 citationsanchor · a standalone construct parallelism3 fields · 3 citationsjingle · one word, three constructs path3 fields · 3 citationsjingle · one word, three constructs

References

Brent, R. P. (1974). The Parallel Evaluation of General Arithmetic Expressions. Journal of the ACM, 21(2), 201-206. https://doi.org/10.1145/321812.321815

Cited on this page?

Confirm your construct, or correct us.

If your work is cited behind one of these entries, you know better than we do whether we captured the meaning right. Confirm it, suggest an edit, or dispute it, and your name goes on the entry as an author who has checked it, linked to your ORCID.

Claim your construct