Expanding the synthesis of distributed memory implementations

Abstract

In this thesis, I expanded the programming model implemented by the Sketch language to supplement its distributed memory parallelism with shared memory parallelism that uses the popular fork-join model. The primary contribution of this thesis is the means by which the code is assured to be free of race conditions. Sketch uses constraint satisfaction analysis to ensure it synthesizes code the functions properly for all inputs, and I demonstrate how assertions can be generated and inserted into the analysis to guarantee freedom from race conditions. This expanded programming model is then evaluated using test cases to ensure correct operation and benchmarks to examine overall performance.