ACM Computing Surveys (CSUR)
An empirical comparison of priority-queue and event-set implementations
Communications of the ACM
Analysis of tree algorithms for the simulation event list
Acta Informatica
SIAM Journal on Computing
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Concurrent simulation: an alternative to distributed simulation
WSC '86 Proceedings of the 18th conference on Winter simulation
Efficient locking for concurrent operations on B-trees
ACM Transactions on Database Systems (TODS)
A data structure for manipulating priority queues
Communications of the ACM
Principles of Concurrent Programming
Principles of Concurrent Programming
Concurrency control mechanisms and the serializability of concurrent tree algorithms
PODS '84 Proceedings of the 3rd ACM SIGACT-SIGMOD symposium on Principles of database systems
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Multi-model parallel programming in psyche
PPOPP '90 Proceedings of the second ACM SIGPLAN symposium on Principles & practice of parallel programming
A methodology for implementing highly concurrent data structures
PPOPP '90 Proceedings of the second ACM SIGPLAN symposium on Principles & practice of parallel programming
Efficient implementation of event sets in Time Warp
PADS '93 Proceedings of the seventh workshop on Parallel and distributed simulation
A methodology for implementing highly concurrent data objects
ACM Transactions on Programming Languages and Systems (TOPLAS)
Adaptive checkpointing in Time Warp
PADS '94 Proceedings of the eighth workshop on Parallel and distributed simulation
Service oriented scheduling in Time Warp
WSC '94 Proceedings of the 26th conference on Winter simulation
A comparative study of parallel and sequential priority queue algorithms
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Performance of a multiple-entry-node concurrent skew heap on shared-memory multiprocessor
ACM-SE 36 Proceedings of the 36th annual Southeast regional conference
Priority Queues and Sorting Methods for Parallel Simulation
IEEE Transactions on Software Engineering
Characterizing the Performance of Algorithms for Lock-Free Objects
IEEE Transactions on Computers
Optimal Parallel Initialization Algorithms for a Class of Priority Queues
IEEE Transactions on Parallel and Distributed Systems
Architecture independent parallel selection with applications to parallel priority queues
Theoretical Computer Science
Proceedings of the 35th conference on Winter simulation: driving innovation
Twol-amalgamated priority queues
Journal of Experimental Algorithmics (JEA)
Fast and lock-free concurrent priority queues for multi-thread systems
Journal of Parallel and Distributed Computing
Simulation of dynamic priority calculation for multilevel priority queue
CompSysTech '07 Proceedings of the 2007 international conference on Computer systems and technologies
Information Processing Letters
| Hi-index | 48.22 |
Among the fastest priority queue implementations, skew heaps have properties that make them particularly suited to concurrent manipulation of shared queues. A concurrent version of the top down implementation of skew heaps can be produced from previously published sequential versions using almost mechanical transformations. This implementation requires O(log n) time to enqueue or dequeue an item, but it allows new operations to begin after only O(1) time on a MIMD machine. Thus, there is potential for significant concurrency when multiple processes share a queue. Applications to problems in graph theory and simulation are discussed in this article.