Dynamic entity distribution in parallel discrete event simulation

Event based simulations are an important scientific application in many fields. With the rise of cluster computing, distributed event simulation optimization becomes an essential research topic. This paper identifies cross-node event queues as a major source of slow down in practical parallel event simulations and proposes dynamically moving entities between nodes to minimize such remote event queues. The problem statement is formalized and an algorithm based on an approximation algorithm for the Capacitated Minimum K-Cut Problem is proposed. The algorithm is simulated and results are presented that show its effectiveness. For simulations with reasonably regular structural relationships between entities, reductions of remote entity queues from 80 to 90 % are demonstrated.

• Type: Conference
• Year: 2008
• Where: WSC
• Authors: Michael Slavik, Imad Mahgoub, Ahmed Badi
• Keywords: Event Queues, Event Simulations, Modeling And Simulation, Simulations, WSC 2008