A parallelism analyzer algorithm for a conservative super-step simulation protocol

Given an existing complex sequential simulation program, it is useful to have a parallelism analysis algorithm to quickly predict the corresponding parallel simulation program\´s performance. Wong et al. have described such an algorithm for the asynchronous Chandy-Misra-Bryant simulation protocol. This paper describes a parallelism analysis algorithm for a synchronous "super-step" protocol. We also discuss the assumptions needed an order for the prediction to be meaningful (i.e. it should reflect at least one of the possible parallel runs), and the analyzer algorithm\´s correctness. Finally, we briefly discuss the algorithm modifications needed if we are to remove one of the assumptions.