原书出处
Introduction to Algorithms, Fourth Edition
26 第26章 并行算法
r larger input sizes, however, we’ll see that P-FIB (n) exhibits substantial parallelism.
We define the (parallel) slackness of a task-parallel computation executed on an ideal parallel computer with P processors to be the ratio (T1/T∞)/P = T1/(P T∞), which is the factor by which the parallelism
of the computation exceeds the number of processors in the machine. Restating the bounds
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter026.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea