Dynamic entity distribution in parallel discrete event simulation

Authors:
Michael Slavik;Imad Mahgoub;Ahmed Badi
Affiliations:
Florida Atlantic University, Boca Raton, Florida;Florida Atlantic University, Boca Raton, Florida;Florida Atlantic University, Boca Raton, Florida
Venue:
Proceedings of the 40th Conference on Winter Simulation
Year:
2008

Citing 7
Cited 0

Knapsack problems: algorithms and computer implementations

Knapsack problems: algorithms and computer implementations
Optimistic parallel simulation over a network of workstations

Proceedings of the 31st conference on Winter simulation: Simulation---a bridge to the future - Volume 2
Approximate Local Search in Combinatorial Optimization

SIAM Journal on Computing
Next generation modeling III - agents: Spades --- a distributed agent simulation environment with software-in-the-loop execution

Proceedings of the 35th conference on Winter simulation: driving innovation
DSIM: scaling time warp to 1,033 processors

WSC '05 Proceedings of the 37th conference on Winter simulation
An efficient approximation for the generalized assignment problem

Information Processing Letters
The capacitated max-k-cut problem

ICCSA'05 Proceedings of the 2005 international conference on Computational Science and Its Applications - Volume Part IV

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.