原书出处
Introduction to Algorithms, Fourth Edition
26 第26章 并行算法
runtime instructions executed by processors under the direction of a parallel program—as
a directed acyclic graph G = (V, E), called a (parallel) trace.2 Conceptually, the vertices in V are executed instructions, and the edges in E represent dependencies between instructions, where (u, v) ∈ E means
that the parallel program required instruction u to execute before instruction v. It’s so
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter026.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea