P = FS:并行就是快速串行
P = FS: Parallel is Just Fast Serial
摘要:
我们证明了同构处理器的并行处理在逻辑上等价于快速串行处理。反向命题也可以用来识别应用并行的模糊机会。据我们所知,该定理以前在排队论文献中还没有报道过。一个合理的解释是提供为什么这可能是。基本齐次定理也被扩展到优化异构并行阵列的延迟。
英文摘要:
We prove that parallel processing with homogeneous processors is logically equivalent to fast serial processing. The reverse proposition can also be used to identify obscure opportunities for applying parallelism. To our knowledge, this theorem has not been previously reported in the queueing theory literature. A plausible explanation is offered for why this might be. The basic homogeneous theorem is also extended to optimizing the latency of heterogenous parallel arrays.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。