Randomized priority queues for fast parallel access
From MaRDI portal
Publication:1130320
Recommendations
- Parallel priority queues
- Parallel algorithms for priority queue operations
- Parallel algorithms for priority queue operations
- Parallel priority queues based on binomial heaps
- Priority queues on parallel machines
- Priority queues on parallel machines
- Fast priority queues for cached memory
- Parallel heap: an optimal parallel priority queue
Cited in
(16)- Randomized range-maxima in nearly-constant parallel time
- Architecture independent parallel selection with applications to parallel priority queues
- CBPQ: high performance lock-free priority queue
- Fast and lock-free concurrent priority queues for multi-thread systems
- Concurrent access of priority queues
- Portable distributed priority queues with MPI
- On RAM Priority Queues
- scientific article; zbMATH DE number 1760034 (Why is no real title available?)
- scientific article; zbMATH DE number 2099204 (Why is no real title available?)
- scientific article; zbMATH DE number 1419218 (Why is no real title available?)
- Priority queues on parallel machines
- Parallel combining: benefits of explicit synchronization
- The power of choice in priority scheduling
- Parallel algorithms for priority queue operations
- An application of program unification to priority queue vectorization
- An efficient implementation of priority queues using fixed-sized systolic coprocessors
This page was built for publication: Randomized priority queues for fast parallel access
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1130320)
