延迟容限的任务图转换
Task Graph Transformations for Latency Tolerance
摘要:
并行算法的集成模型(IMP)从并行算法的更高层次描述中推导出任务图。在本说明中,我们将展示如何使用任务图转换来实现程序执行中的延迟容忍。我们给出了一个正式的推导图变换,并通过模拟显示如何延迟容忍算法可以比天真的执行更快,在一个强大的缩放场景。
英文摘要:
The Integrative Model for Parallelism (IMP) derives a task graph from a higher level description of parallel algorithms. In this note we show how task graph transformations can be used to achieve latency tolerance in the program execution. We give a formal derivation of the graph transformation, and show through simulation how latency tolerant algorithms can be faster than the naive execution in a strong scaling scenario.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。