liveBook · Manning

Compute-bound

As explained in Rust Servers, Services, and Apps

A CPU-bound program is a program whose progress rate is primarily limited by processor computation speed.

CPU-bound work progresses at a rate primarily limited by processor speed, as with complex number-crunching. It is generally a less natural fit for asynchronous task execution than I/O-bound work, though this is only a broad guideline. section 10.3

Square roots across cores

A program can compute each number’s square root sequentially, or distribute independent numbers across available processors or cores. This illustrates an opportunity for parallel processing in CPU-intensive work. section 10.1

How Rust Servers, Services, and Apps covers it

How deep it goes
Defines processor-limited progress, gives representative workloads, and sketches multicore computation without exploring implementation.
Examples
Names genome sequencing, video encoding, graphics processing, cryptographic proofs, and parallel square-root computation.
What you can do after
Evaluate whether progress depends on processor speed and identify independent computations that may be distributed across cores.
How it connects
Relates CPU-bound work to I/O-bound work, asynchronous programming, parallel processing, and multicore execution.

Also explained in

Compare how 5 books explain compute-bound →

Related concepts

This explainer was generated by Manning's knowledge graph from the text of Rust Servers, Services, and Apps. The section links point to the parts of the book it draws on.