Abstract

Systematic parallelization of sequential programs remains a major challenge in parallel computing. Traditional approaches using program schemes are somewhat narrow in scope, as the properties which enable parallelism are difficult to capture via ad-hoc schemes. We propose a more systematic approach to parallelization based on the notion of preserving the context of recursive sub-terms. This approach can be used to derive a class of divide-andconquer programs. To enhance the methodology further, we advocate the use of required constraints to widen the class of programs that could be handled. A unique feature of our approach is that it supports both reusability and efficiency. In particular, both general and specialised contraints are gathered to make this marriage possible.

Citations