Transformations for the Optimistic Parallel Execution of Object-Oriented Programs

This paper discusses the use of optimistic execution as a mechanism for parallelizing sequential object-oriented programs. Most parallelizing compilers to date have used compile-time data-dependency analysis to determine independent sections of code. This reliance on static information presents an overly restrictive view of dependencies in a program. In this paper, a set of transformations is presented which allows the use of causality violation detection and roll-back. Selected objects are transformed into server objects, which are distributed across the nodes of a parallel computer. The asynchronous dispatch of server object methods introduces parallelism into the execution, in a way which preserves the semantics of the sequential code