Journal ArticleDOI
An empirical comparison of priority-queue and event-set implementations
Reads0
Chats0
TLDR
Execution times for a variety of priority-queue implementations are compared under the hold model, showing many to be faster than implicit heaps.Abstract:
Execution times for a variety of priority-queue implementations are compared under the hold model, showing many to be faster than implicit heaps.read more
Citations
More filters
Book
Purely functional data structures
TL;DR: This work describes several techniques for designing functional data structures, and numerous original data structures based on these techniques, including multiple variations of lists, queues, double-ended queues, and heaps, many supporting more exotic features such as random access or efficient catenation.
Journal ArticleDOI
Calendar queues: a fast 0(1) priority queue implementation for the simulation event set problem
TL;DR: A new priority queue implementation for the future event set problem is described and shown experimentally to be O(1) in queue size for the priority increment distributions recently considered by Jones in his review article.
Journal ArticleDOI
The cost of conservative synchronization in parallel discrete event simulations
TL;DR: It is shown that on large problems—those for which parallel processing is ideally suited— there is often enough parallel workload so that processors are not usually idle, and the method is within a constant factor of optimal.
Book ChapterDOI
Incremental Collection of Mature Objects
TL;DR: A garbage collection algorithm that extends generational scavenging to collect large older generations (mature objects) non-disruptively and naturally supports compaction and reclustering is presented.
Proceedings ArticleDOI
Parallel discrete-event simulation of FCFS stochastic queueing networks
TL;DR: This paper shows how lookahead can be computed for FCFS queueing network simulations, gives performance data that demonstrates the method's effectiveness under moderate to heavy loads, and discusses performance trade-offs between the quality of lookahead, and the cost of computing lookahead.
References
More filters
Book
The Art of Computer Programming
TL;DR: The arrangement of this invention provides a strong vibration free hold-down mechanism while avoiding a large pressure drop to the flow of coolant fluid.
Book
The Design and Analysis of Computer Algorithms
Alfred V. Aho,John E. Hopcroft +1 more
TL;DR: This text introduces the basic data structures and programming techniques often used in efficient algorithms, and covers use of lists, push-down stacks, queues, trees, and graphs.
Journal ArticleDOI
Self-adjusting binary search trees
TL;DR: The splay tree, a self-adjusting form of binary search tree, is developed and analyzed and is found to be as efficient as balanced trees when total running time is the measure of interest.
Journal ArticleDOI
A data structure for manipulating priority queues
TL;DR: A data structure is described which can be used for representing a collection of priority queues and the primitive operations are insertion, deletion, union, update, and search for an item of earliest priority.