Pages that link to "Item:Q3814801"
From MaRDI portal
The following pages link to Concurrent access of priority queues (Q3814801):
Displaying 22 items.
- Concurrent counting is harder than queuing (Q604464) (← links)
- Parallel algorithms for priority queue operations (Q672391) (← links)
- An application of program unification to priority queue vectorization (Q685093) (← links)
- A multiple-heaps algorithm for parallel simulation of collision systems (Q697736) (← links)
- Parallel state-space search for a first solution with consistent linear speedups (Q757044) (← links)
- Parallel heap: an optimal parallel priority queue (Q973413) (← links)
- A parallel priority queue with constant time operations (Q1130313) (← links)
- Parallel priority queues (Q1183429) (← links)
- An efficient algorithm for concurrent priority queue heaps (Q1350117) (← links)
- Amortization results for chromatic search trees, with an application to priority queues (Q1384535) (← links)
- Elimination trees and the construction of pools and stacks (Q1384697) (← links)
- Architecture independent parallel selection with applications to parallel priority queues (Q1399984) (← links)
- Fast and lock-free concurrent priority queues for multi-thread systems (Q1779732) (← links)
- Priority queuing in an operating system (Q1885938) (← links)
- Revisiting priority queues for image analysis (Q1957852) (← links)
- P-tree structures and event horizon: efficient event-set implementations (Q2508375) (← links)
- (Q2766861) (← links)
- AN EFFICIENT ALGORITHM FOR MANAGING A PARALLEL HEAP∗ (Q4820057) (← links)
- Parallel algorithms for priority queue operations (Q5056135) (← links)
- Amortization results for chromatic search trees, with an application to priority queues (Q5057441) (← links)
- Dealing with Priorities and Locks for Concurrent Programs (Q5096084) (← links)
- A Heap-Based Concurrent Priority Queue with Mutable Priorities for Faster Parallel Algorithms (Q5363806) (← links)
