Partitioning and mapping a class of parallel simulation models

This paper proposes and evaluates an approach for partitioning and mapping a class of parallel discrete event simulation models. The class of models is a subset of Petri Nets known as marked graphs. Six commercial simulation models based on the marked graph modeling paradigm are examined to evaluate the available parallelism typically found in real models. The parallelism that can be exploited is very dependent upon effective partitioning and mapping algorithms to ensure a useful distribution of concurrently executable events. A partitioning and mapping algorithm is proposed in this paper, and its performance is evaluated