Advanced -> Parallel Algorithms¶

Theory-breadth parallel coverage taught first through work/span reasoning and a Blelloch exclusive-scan simulator over an explicit array.

Microtopics¶

Source	Type
Blelloch, Prefix Sums and Their Applications	`Course`
MIT 6.854 parallel algorithms notes	`Course`
CMU 15-210 overview	`Course`

Source	Type
Sebastian Wild Unit 7: Parallel Algorithms	`Course`

Material	Type
Parallel Algorithms hot sheet	`quick reference`
Parallel Prefix Sum Benchmark	`flagship note`
Prefix Sums tutorial	`compare point`
Template Library exact starter route	`starter route`

Problem	Source	Difficulty	Context	Style	Prerequisites	Tags	Why it fits
Parallel Prefix Sum Benchmark	`CMU / Blelloch`	`Theory`	Scan	Theory Benchmark; Simulator	Associativity; Prefix Sums; Tree Reduction	Prefix Sum; Blelloch Scan; Work Span; Pram	The canonical first parallel benchmark for this repo because scan makes the work-vs-span lens concrete without pretending the repo already provides a full multicore runtime.

Problem	Source	Difficulty	Context	Style	Prerequisites	Tags	Why it fits
Parallel algorithms notes: Brent and work-efficient scan	`MIT 6.854`	`Theory`	Further Theory	Lecture Notes; Theory Breadth	Prefix Sum; Work Span	Brent's Theorem; Work Efficient; Pram; Parallel Prefix	A strong follow-up once the scan route clicks and you want the first serious work-efficient simulation lens instead of only the tree mechanics.

Code	Title	Fit	Difficulty	Pattern	Note	Solution
`PARALLELPREFIXSUM`	Parallel Prefix Sum Benchmark	`primary`	`medium`	-	Note	Code

python3 scripts/generate_problem_catalog.py