原书出处
Introduction to Algorithms, Fourth Edition
26 第26章 并行算法
hat knows the global state of the computation at any moment. In particular, we’ll analyze
greedy schedulers, which assign as many strands to processors as possible in each time step, never leaving a processor idle if there is work that can be done. We’ll classify each step of a greedy scheduler as follows:
Complete step: At least P strands are ready to execute, meaning that all strands on which
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter026.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea