Parallel discrete event processing of sequential computations

Previous proposals for the application of discrete Event methods to parallelization of sequential software have been based on the optimistic execution strategy. In this paper we present a new method which avoids optimistic execution. This is motivated by the observation that the control structure of a sequential program constitutes a temporal co-ordinate system which is exogenous to the program execution. The method employs a logical time mechanism and provides adaptive synchronisation for the distributed execution. Hence Data dependent and/or conditional parallelism is released without the risk of coherency violation. The paper begins with a brief introduction to parallel discrete event simulation paradigm. Efficient coarse grain mapping of conventional programs onto this paradigm is then discussed.