A New Priority Queue for Simulation of Many Objects

by Ricardo Baeza-yates , Mauricio Marín

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	A New Priority Queue for Simulation of Many Objects	user correction - Legacy Corrections
AUTHOR NAME	Ricardo Baeza-yates	user correction - Legacy Corrections
AUTHOR AFFIL	Universidad de Chile	user correction - Legacy Corrections
AUTHOR ADDR	Casilla 2777; Santiago, Chile	user correction - Legacy Corrections
AUTHOR NAME	Mauricio Marín	user correction - Legacy Corrections
ABSTRACT	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...	user correction - Legacy Corrections
CITATIONS	26 found	ParsCit 1.0