P-Tree Structures and Event Horizon: Efficient Event-Set Implementations

This paper describes efficient data structures, namely the Indexed P-tree, Block P-tree, and Indexed-Block P-tree (or IP-tree, BP-tree, and IBP-tree, respectively, for short), for maintaining future events in a general purpose discrete event simulation system, and studies the performance of their event set algorithms under the event horizon principle. For comparison reasons, some well-known event set algorithms have been selected and studied, that is, the Dynamic-heap and the P-tree algorithms. To gain insight into the performance of the proposed event set algorithms and allow comparisons with the other selected algorithms, they are tested under a wide variety of conditions in an experimental way. The time needed for the execution of the Hold operation is taken as the measure for estimating the average time complexity of the algorithms. The experimental results show that the BP-tree algorithm and the IBP-tree algorithm behave very well with the event set of all the sizes and their performance is almost independent of the stochastic distributions.

[1]  Jeffrey S. Steinman.  Discrete-event simulation and the event horizon part 2: event list management , 1996, Workshop on Parallel and Distributed Simulation.

[2]  Hwang Hsien-Kuei,et al.  On the Number of Heaps and the Cost of Heap Construction , 2002 .

[3]  C. M. Reeves.  Complexity Analyses of Event Set Algorithms , 1984, Comput. J..

[4]  George S. Fishman,et al.  Solution of Large Networks by Matrix Methods , 1976, IEEE Transactions on Systems, Man, and Cybernetics.

[5]  Ian Li-Jin Thng,et al.  SNOOPy Calendar Queue , 2000, 2000 Winter Simulation Conference Proceedings (Cat. No.00CH37165).

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

[7]  Kurt Maly,et al.  An efficient data structure for the simulation event set , 1977, CACM.

[8]  Haim Kaplan,et al.  Meldable heaps and boolean union-find , 2002, STOC '02.

[9]  Isi Mitrani.  Simulation techniques for discrete event systems , 1982, Cambridge computer science texts.

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

[11]  Jeff S. Steinman.  Discrete-event simulation and the event horizon , 1994, PADS '94.

[12]  Averill M. Law,et al.  Simulation Modeling and Analysis , 1982 .

[13]  Ole-Johan Dahl,et al.  Analysis of an algorithm for priority queue administration , 1975 .

[14]  Vipin Kumar,et al.  Concurrent Access of Priority Queues , 1988, IEEE Trans. Computers.

[15]  Kurt Maly,et al.  A comparison of heaps and the TL structure for the simulation event set , 1978, CACM.

[16]  Jeff S. Steinman,et al.  SPEEDES - A multiple-synchronization environment for parallel discrete-event simulation , 1992 .

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