原书出处
Introduction to Algorithms, Fourth Edition
26 第26章 并行算法
ds. If each strand takes unit time, the work is just the number of vertices in the trace.
The span is the fastest possible time to execute the computation on an unlimited number of processors, which corresponds to the sum of the times taken by the strands along a longest path in the trace, where “longest”
means that each strand is weighted by its execution time. Such a longest path is called t
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter026.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea