← 返回卡片

原书出处

Introduction to Algorithms, Fourth Edition

26 第26章 并行算法

Fourth edition · 核验版本的摘录快照 · 导入于 2026-10-23T08:18:08.745Z

Consider a parallel loop with n iterations in which the ith iteration has span iter∞(i).

Since the depth of recursion is logarithmic in the number of iterations, the parallel loop’s span is T∞(n) = Θ(lg n) + max {iter∞(i) : 1 ≤ i ≤ n}. For example, let’s compute the span of the doubly nested

loops in lines 1–3 of P-MAT-VEC. The span for the parallel for loop control is Θ(lg n). F

此预览只包含定位所需的摘录和上下文。

原书定位详情

来源:a19c7933-4eda-4176-aebd-30fe7e1ad292

正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter026.xhtml

EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea