A concurrency preserving partitioning algorithm for parallelsimulation of hierarchical, modular discrete event models

摘要

The paper presents a concurrency preserving partitioning algorithmfor the optimistic parallel simulation of hierarchical, modular discreteevent models. The proposed algorithm pursues the following three goalsto achieve the overall objective of a minimum simulation time: (1)balance the computational loads of partitions; (2) maximize the parallelexecution of independent models; and (3) minimize inter-processorcommunication. To estimate the parallelism inherent in models, theproposed algorithm utilizes the inherent hierarchical structuralinformation of DEVS models. The paper describes how the proposedalgorithm works through an example partitioning process