ACM Computing Surveys (CSUR)
Designing efficient algorithms for parallel computers
Designing efficient algorithms for parallel computers
Concurrency control in a dynamic search structure
ACM Transactions on Database Systems (TODS)
Area-Efficient VLSI Computation
Area-Efficient VLSI Computation
A VLSI Architecture for Concurrent Data Structures
A VLSI Architecture for Concurrent Data Structures
Fundamentals of Computer Alori
Fundamentals of Computer Alori
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
An efficient VLSI dictionary machine
ISCA '84 Proceedings of the 11th annual international symposium on Computer architecture
Parallel Heuristic Search on a Shared Memory Multiprocessor
Parallel Heuristic Search on a Shared Memory Multiprocessor
Parallel Heuristic Search of State-Space Graphs: A Summary of Results
Parallel Heuristic Search of State-Space Graphs: A Summary of Results
Concurrent Access of Priority Queues
Concurrent Access of Priority Queues
Efficient implementation of event sets in Time Warp
PADS '93 Proceedings of the seventh workshop on Parallel and distributed 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
Lock bypassing: an efficient algorithm for concurrently accessing priority heaps
Journal of Experimental Algorithmics (JEA)
Scalable concurrent priority queue algorithms
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
An efficient and scalable parallel algorithm for discrete-event simulation
WSC '91 Proceedings of the 23rd conference on Winter simulation
PADS '00 Proceedings of the fourteenth workshop on Parallel and distributed simulation
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
State of the Art in Parallel Search Techniques for Discrete Optimization Problems
IEEE Transactions on Knowledge and Data Engineering
Optimal Parallel Initialization Algorithms for a Class of Priority Queues
IEEE Transactions on Parallel and Distributed Systems
Optimal and Load Balanced Mapping of Parallel Priority Queues in Hypercubes
IEEE Transactions on Parallel and Distributed Systems
Simulation Data Structures for Parallel Resource Management
IEEE Transactions on Software Engineering
A multiple-heaps algorithm for parallel simulation of collision systems
Journal of Computational Physics
Architecture independent parallel selection with applications to parallel priority queues
Theoretical Computer Science
Proceedings of the 35th conference on Winter simulation: driving innovation
P-tree structures and event horizon: efficient event-set implementations
WSC '05 Proceedings of the 37th conference on Winter simulation
A hardware architecture for surface splatting
ACM SIGGRAPH 2007 papers
Parallel iterative A* search: an admissible distributed heuristic search algorithm
IJCAI'89 Proceedings of the 11th international joint conference on Artificial intelligence - Volume 1
Information Processing Letters
P2P document tree management in a real-time collaborative editing system
HiPC'07 Proceedings of the 14th international conference on High performance computing
Concurrent heap-based network sort engine—Toward enabling massive and high speed per-flow queuing
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Fast GPU-based locality sensitive hashing for k-nearest neighbor computation
Proceedings of the 19th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
| Hi-index | 14.99 |
Contention for the shared heap limits the obtainable speedup in parallel algorithms using this data structure as a priority queue. An approach that allows concurrent insertions and deletions on the heap in a shared-memory multiprocessor is presented. The scheme retains the strict priority ordering of the serial-access heap algorithms, i.e. a delete operation returns the best key of all keys that have been inserted or are being inserted at the time delete is started. Experimental results on the BBN Butterfly parallel processor demonstrate that the use of concurrent-heap algorithms in parallel branch-and-bound improves its performance substantially.