原书出处
Introduction to Algorithms, Fourth Edition
26 第26章 并行算法
ood in that it achieves the sum of these two lower bounds as an upper bound. Theorem 26.1
On an ideal parallel computer with P processors, a greedy scheduler executes a task-parallel computation with work T1 and span T∞ in time
Proof Without loss of generality, assume that each strand takes unit time. (If necessary,
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter026.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea