← 返回卡片

原书出处

Introduction to Algorithms, Fourth Edition

26 第26章 并行算法

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

ed path from strand u to strand v, we say that the two strands are (logically) in series.

If there is no path in G either from u to v or from v to u, the strands are (logically) in parallel. A fork-join parallel trace can be pictured as a dag of strands embedded in an invocation tree of procedure

instances. For example, Figure 26.1 shows the invocation tree for FIB(6), which also serv

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

原书定位详情

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

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

EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea