In the last three decades a considerable amount of research has been pursued in the efficient implementation of the pending event set (PES) associated with discrete-event simulation. The reason is simple: a fast event management has a very crucial impact in the total running time of both sequential and parallel simulations. This report focuses on this problem by studying the empirical performance of a number of solutions to the PES implementation in which we include a complete binary tree described in [26], 1 Introduction The PES is defined as the set of all the events generated during a discrete-event simulation and whose occurrence have not been simulated yet. In order to determine the next event to take place, it is necessary to extract the event with the least time from the PES. We call this operation extract-min. On the other hand, the occurrence of any event during the simulation can produce the insertion of new pending or future events in the PES; insert operation. These two b...

this paper we study the performance of the very first tournament based complete binary tree. We focus on discrete-event simulation and our results show that this unknown predecessor of heaps can be a more efficient alternative to the fastest pending event set implementations reported in the literature. We also extend the idea of binary tournaments to a (2; L)-tournament structure which exhibits the property of delaying the processing of events with larger timestamps whilst it keeps similar theoretical performance bounds to the native (2; 1)-structure or CBT. This property can be certainly useful in systems where many pending events are expected to be deleted or rescheduled during the simulation. 2 Tournament trees

The bulk-synchronous parallel (BSP) model of computing has been proposed to enable the development of portable software which achieves scalable performance across diverse parallel architectures. A number of applications of computing science have been demonstrated to be efficiently supported by the BSP model in practice.

During the discrete event simulation of complex systems based on many active/passive objects, the efficiency of the algorithm and data structure used to manage the events of the process is crucial. Both runtime and space used are relevant for the study of large systems. A main issue in the simulation of these systems are the interactions between pairs of objects. These interactions are treated as events that take place at discrete instants. The event management is performed by using a priority queue in which sequences of events are inserted/deleted in an efficient manner. In this paper we introduce and analyze a new priority queue -- called Local Minima -- which resembles a hybrid structure between the classical heap and linked lists. We also present empirical results showing that our priority queue is more efficient and stable than other alternatives in the simulation of molecular fluids. Systems with many moving objects -- such as molecular fluids -- are an important class of applica...

Abstract not found