原书出处
Introduction to Algorithms, Fourth Edition
26 第26章 并行算法
n) = T (n) = Θ(ϕn) from equation (26.1). Figure 26.3 illustrates how to analyze the span.
If two traces are joined in series, their spans add to form the span of their composition, whereas if they are joined in parallel, the span of their composition is the maximum of the spans of the two traces. As it
turns out, the trace of any fork-join parallel computation can be built up from single st
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter026.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea