← 返回卡片

原书出处

Introduction to Algorithms, Fourth Edition

26 第26章 并行算法

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

hms, allowing performance to be reasoned about mathematically using “work/span analysis.”

Fork-join parallelism Although the functionality of task-parallel environments is still evolving and increasing, almost all support fork-join parallelism, which is typically embodied in two linguistic features:

spawning and parallel loops. Spawning allows a subroutine to be “forked”: executed like a

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

原书定位详情

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

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

EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea