A Parallelism Analyzer Algorithm for a Conservative Super-Step Simulation Protocol

Abstract

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. [12] 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 [8] which we evolved from [7, 2]. We also discuss the assumptions needed in 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 will briefly discuss the algorithm modifications needed if we are to remove one of the assumptions. 1 Introduction The work in this paper is from an ongoing project to study how parallel simulation techniques can be applied in a virtual factory simulation [6]. A virtual factory model includes manufacturing, business processes and communications network, to all..