原书出处
Introduction to Algorithms, Fourth Edition
26 第26章 并行算法
duler bound (26.4) to work with expectations when TP, T1, and T∞are all random variables.
b. Consider a randomized parallel algorithm for which 1% of the time, T1 = 104 and T10,000 = 1, but for the remaining 99% of the time, T1 = T10,000 = 109. Argue that the speedup of a randomized parallel algorithm should be defined as E[T1]/E[TP], rather than E[T1/TP].
c. Argue that the parallelism of a randomized task-parallel algorithm should be defined a
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter026.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea