原书出处
Introduction to Algorithms, Fourth Edition
26 第26章 并行算法
em follows. ▪ The following corollary shows that a greedy scheduler always performs well.
Corollary 26.2 The running time TP of any task-parallel computation scheduled by a greedy scheduler on a P-processor ideal parallel computer is within a factor of 2 of optimal. Proof Let T*P be the running time
produced by an optimal scheduler on a machine with P processors, and let T1 and T∞ be the
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter026.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea