原书出处
Introduction to Algorithms, Fourth Edition
26 第26章 并行算法
o that the span of P-FIB (n − 1) must be at least as large as the span of P-FIB (n − 2).)
The parallelism of P-FIB (n) is T1(n)/T∞(n) = Θ(ϕn/n), which grows dramatically as n gets large. Thus, Corollary 26.3 tells us that on even the largest parallel computers, a modest value for n suffices
to achieve near perfect linear speedup for P-FIB (n), because this procedure exhibits con
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter026.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea