关于并行算法加速比界的一个注记
A Note on Parallel Algorithmic Speedup Bounds
摘要：
并行程序可以表示为有向无环图。一个重要的性能界限是通过图执行关键路线的时间。我们展示了这个性能指标是如何与Amdahl加速比和平均并行度。这些界限正式排除超线性性能。
英文摘要：
A parallel program can be represented as a directed acyclic graph. An important performance bound is the time to execute the critical path through the graph. We show how this performance metric is related to Amdahl speedup and the degree of average parallelism. These bounds formally exclude superlinear performance.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
