Imports

Chapter 26 — Parallel Algorithms

This is the canonical CLRS fourth-edition chapter guide during the migration period.

Current source

Sections 26.1--26.3 are native fourth-edition sections, imported directly from Section 26.1 (the fork-join basics: computation DAGs, ready execution, greedy accounting, the executable scheduler, and spawn trees/parallel loops) and Section 26.2--26.3 (parallel matrix multiplication, parallel merge and merge sort, and the parallel Strassen recurrences; the 2_4 suffix is a historical legacy artifact). Declarations retain the legacy CLRS.Chapter27 namespace during the compatibility period; the third-edition-numbered imports CLRSLean.Chapter_27 and CLRSLean.Chapter_27.Section_27_* forward to these sources.

Implementation details

The supporting implementation pages remain available outside the main sidebar:

Coverage boundary

The native sections supply the represented fourth-edition parallel sections (§26.1 fork-join basics, §26.2 parallel matrix multiplication, §26.3 parallel merge sort).

See docs/clrs-fourth-edition-map.csv for the section-level mapping and docs/migrations/clrs4.md for compatibility and deprecation policy.