Synchronization of Processes in Parallel Discrete Event Simulation

Abstract

The method of parallel discrete event simulation (PDES) is one of promising methods for effective use of supercomputer systems. In this paper, the results of the analysis of synchronization models for processor elements are presented when calculations are performed by the PDES method. An analogy between the change in the local time profile of processor elements and the increase of the sample surface during molecular epitaxy is used for the classification of synchronization models. Two important classes of such models are the models of conservative PDES and optimistic PDES. The conservative model belongs to the universality class of the Kardar–Parisi–Zhang (KPZ) equation, and the optimistic model belongs to the universality class of directed percolation (DP) problems. We present the results of the analysis of synchronization models in the case when the graph of message exchange between processor elements belongs to the class of small-world networks.