Learn More
Priority queues are used in many applications including real-time systems, operating systems, and simulations. Their implementation may have a profound effect on the performance of such applications. In this article, we study the performance of well-known sequential priority queue implementations and the recently proposed parallel access priority queues.(More)
Creating simulation models via composition of predefined and reusable components is an efficient way of reducing costs and time associated with the simulation model development process. However, in order to successfully compose models one has to solve the issues of syntactic and semantic composability of components. HLA is the most widely used architecture(More)
A new priority queue implementation, the Lazy Queue, is presented in this paper. It is tailored to handle the pending event set encountered in discrete event simulation. The Lazy Queue is a multi-list variety where the sorting process is delayed until a point near the time where the elements are to be dequeued. The queue access time has been measured and(More)
Pervasive environments are characterized by a large number of embedded devices offering their services to the user. Which of the available services are of most interest to the user considerably depends on the user's current context. User context is often rich and very dynamic; making an explicit, user-driven discovery of services impractical. Users in such(More)
Many systems rely on the ability to rollback (or restore) parts of the system state to undo or recover from undesired or erroneous computations. Examples of such systems include fault tolerant systems with checkpointing, editors with undo capabilities, transaction and data base systems and optimistically synchronized parallel and distributed simulations. An(More)