A comparative study of pending event set implementations for PDEVS simulation

The choice of a particular event-list implementation can dramatically improve or reduce performance of a discrete event simulation (DES). For more than 40 years, several data structures had been proposed to address this problem. We present new empirical results using the parallel discrete event system specification (PDEVS) formalism and a DEVStone benchmark. Similar analyzes were previously conducted, the last one being published in 2007. This paper includes most recent proposals, particularly the LadderQueue [19], evaluated using the DEVS-Ruby simulator.

[1]  David R. C. Hill,et al.  DEVS-ruby: a domain specific language for DEVS modeling and simulation (WIP) , 2014, SpringSim.

[2]  Stavros D. Nikolopoulos,et al.  P-tree structures and event horizon: efficient event-set implementations , 2005 .

[3]  Gabriel A. Wainer,et al.  Studying performance of DEVS modeling and simulation environments using the DEVStone benchmark , 2011, Simul..

[4]  Bernard P. Zeigler,et al.  Theory of modeling and simulation , 1976 .

[5]  Fernando J. Barros.  Dynamic structure discrete event system specification: a new formalism for dynamic structure modeling and simulation , 1995, WSC '95.

[6]  Robert Rönngren,et al.  Lazy Queue: an efficient implementation of the pending-event set , 1991 .

[7]  Philip A. Wilsey,et al.  Event pool structures for PDES on many-core Beowulf clusters , 2013, SIGSIM PADS '13.

[8]  Jean G. Vaucher,et al.  A comparison of simulation event list algorithms , 1975, Commun. ACM.

[9]  JongSuk Ahn,et al.  Dynamic calendar queue , 1999, Proceedings 32nd Annual Simulation Symposium.

[10]  Stavros D. Nikolopoulos,et al.  An experimental analysis of event set algorithms for discrete event simulation , 1993, Microprocess. Microprogramming.

[11]  Robert Rönngren,et al.  A comparative study of parallel and sequential priority queue algorithms , 1997, TOMC.

[12]  Douglas W. Jones,et al.  An empirical comparison of priority-queue and event-set implementations , 1986, CACM.

[13]  Philip A. Wilsey,et al.  Event List Management in Distributed Simulation , 2001, Euro-Par.

[14]  Francesco Quaglia,et al.  A low-overhead constant-time LTF scheduler for optimistic simulation systems , 2010, The IEEE symposium on Computers and Communications.

[15]  Robert E. Tarjan,et al.  Self-adjusting binary search trees , 1985, JACM.

[16]  WAI TENG TANG,et al.  Ladder queue: An O(1) priority queue structure for large-scale discrete event simulation , 2005, TOMC.

[17]  Philip A. Wilsey,et al.  Lock-free pending event set management in time warp , 2014, SIGSIM PADS '14.

[18]  Randy Brown,et al.  Calendar queues: a fast 0(1) priority queue implementation for the simulation event set problem , 1988, CACM.

[19]  Don T. Phillips,et al.  A two-list synchronization procedure for discrete event simulation , 1981, CACM.

[20]  Adelinde M. Uhrmacher,et al.  The event queue problem and PDevs , 2007, SpringSim '07.

[21]  William M. McCormack,et al.  Analysis of future event set algorithms for discrete event simulation , 1981, CACM.