原书出处
Introduction to Algorithms, Fourth Edition
26 第26章 并行算法
its work, span, and parallelism. 26-4 Parallel reductions and scan (prefix) computations
A ⊗-reduction of an array x[1 : n], where ⊗ is an associative operator, is the value y = x[1] ⊗ x[2] ⊗ ⋯ ⊗ x[n]. The REDUCE procedure computes the ⊗-reduction of a subarray x[i : j] serially. REDUCE (x, i, j) 1 y = x[i]
2 for k = i + 1 to j 3 y = y ⊗ x[k] 4 return y a. Design and analyze a parallel algorithm
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter026.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea