融合与整数线性规划的融合
Fusing Gathers with Integer Linear Programming
AI总结:
本文提出一种基于整数线性规划的方法,为组合子并行程序寻找最优融合策略,支持 gather 操作,超越传统生产者-消费者融合,可参数化且适合即时编译。
摘要:
我们提出了一种基于整数线性规划的方法,用于寻找组合子并行程序的最优融合策略。虽然基于组合子的语言或库为并行硬件编程提供了便捷的接口,但将组合子融合为更复杂的操作对于实现期望的性能至关重要。我们的方法不仅适用于具有常见 map、fold、scan、indexing 和 scatter 操作的语言,还适用于 gather 操作(这些操作以任意顺序访问数组),因此超越了传统的生产者-消费者融合。该方法可以通过适当的代价函数进行参数化,并且速度足够快,适合即时编译。
英文摘要:
We present an Integer Linear Programming based approach to finding the optimal fusion strategy for combinator-based parallel programs. While combinator-based languages or libraries provide a convenient interface for programming parallel hardware, fusing combinators to more complex operations is essential to achieve the desired performance. Our approach is not only suitable for languages with the usual map, fold, scan, indexing and scatter operations, but also gather operations, which access arrays in arbitrary order, and therefore goes beyond the traditional producer-consumer fusion. It can be parametrised with appropriate cost functions, and is fast enough to be suitable for just-in-time compilation.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。