Efficient Program Transformations for Resilient Parallel Computation via Randomization

In this paper, we address the problem of automatically transforming arbitrary programs written for an ideal parallel machine to run on a completely asynchronous machine. We present a transformation which can be applied to an ideal program such that the resulting program 's execution on an asynchronous machine is work and space efficient, relative to the ideal program from which it is derived. Above all, the transformation will guarantee that the ideal program will execute in a continually progressive manner on the asynchronous machine: the computation itself will make progress without waiting for slow or failed processors to complete their work. We ensure the above properties by requiring that only read and write instructions be primitives in the asynchronous machine; these instructions are not universal. Furthermore, the individual processors can get delayed for arbitrary amounts of time while execut