Architecture independent parallel selection with applications to parallel priority queues
From MaRDI portal
Publication:1399984
DOI10.1016/S0304-3975(02)00572-8zbMath1022.68014OpenAlexW2013206009MaRDI QIDQ1399984
Constantinos J. Siniolakis, Alexandros V. Gerbessiotis
Publication date: 30 July 2003
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0304-3975(02)00572-8
Combinatorics in computer science (68R05) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (3)
A randomized sorting algorithm on the BSP model ⋮ Coarse Grained Parallel Selection ⋮ An architecture independent study of parallel segment trees
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Parallel heap: an optimal parallel priority queue
- Ordered \(h\)-level graphs on the BSP model
- Fast probabilistic algorithms for Hamiltonian circuits and matchings
- Parallel priority queues
- Finding the median
- Practical considerations of parallel simulations and architecture independent parallel algorithm design
- Time bounds for selection
- Priority queues on parallel machines
- Median Selection Requires $(2+\epsilon)n$ Comparisons
- Randomized parallel algorithms for backtrack search and branch-and-bound computation
- Probabilistic Parallel Algorithms for Sorting and Selection
- Concurrent access of priority queues
- Average case selection
- A Unified Lower Bound for Selection and Set Partitioning Problems
- Parallel permutation and sorting algorithms and a new generalized connection network
- Expected time bounds for selection
- Bounds for Selection
- Selecting the Median
- Architecture independent parallel algorithm design: theory vs practice
This page was built for publication: Architecture independent parallel selection with applications to parallel priority queues
