原书出处
Introduction to Algorithms, Fourth Edition
26 第26章 并行算法
other words, if we had an unlimited number of processors—and so we denote the span by T∞.
The work and span provide lower bounds on the running time TP of a task-parallel computation on P processors: In one step, an ideal parallel computer with P processors can do at most P units of work, and thus in TP
time, it can perform at most P TP work. Since the total work to do is T1, we have P TP ≥
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter026.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea