Parallelization via context preservation
Parallelization via context preservation
复制标题
通过上下文保存实现并行化
DOI：
10.1109/iccl.1998.674166
复制
发表时间：
1998
期刊：
影响因子：
--
通讯作者：
Zhenjiang Hu
中科院分区：
文献类型：
--
作者：
W. Chin;Akihiko Takano;Zhenjiang Hu
抽象程序方案，例如扫描或同态，可以捕获广泛的数据并行程序。虽然用途广泛，但这些方案本身的实际用途有限。一个关键问题是，更自然的顺序规范可能没有这些方案所需的关联组合运算符。因此，它们常常无法立即被识别。为了解决这个问题，作者提出了一种从顺序定义系统地导出并行程序的方法。该方法的特殊之处在于它可以自动发明关联组合运算符所需的辅助函数。除了形式化之外，它们还提供了基于上下文保留概念的新定理，以保证一类精确的顺序程序的并行化。
Abstract program schemes, such as scan or homomorphism, can capture a wide range of data parallel programs. While versatile, these schemes are of limited practical use on their own. A key problem is that the more natural sequential specifications may not have associative combine operators required by these schemes. As a result, they often fail to be immediately identified. To resolve this problem, the authors propose a method to systematically derive parallel programs from sequential definitions. This method is special in that it can automatically invent auxiliary functions needed by associative combine operators. Apart from a formalisation, they also provide new theorems, based on the notion of context preservation, to guarantee parallelization for a precise class of sequential programs.