Coarse Grained Parallel Selection

DOI10.1142/S0129626421500031zbMath1490.68294arXiv1712.00870OpenAlexW3132738721MaRDI QIDQ5087083

Laurence Boxer

Publication date: 8 July 2022

Published in: Parallel Processing Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1712.00870

zbMATH Keywords

selection problemuniform distributionChebyshev's inequalitycoarse-grained multicomputer

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Parallel algorithms in computer science (68W10)

Cites Work

• Unnamed Item
• Coarse grained gather and scatter operations with applications
• Time bounds for selection
• Architecture independent parallel selection with applications to parallel priority queues
• Scalable parallel algorithms for geometric pattern recognition
• An improved, randomized algorithm for parallel selection with an experimental study
• SCALABLE PARALLEL COMPUTATIONAL GEOMETRY FOR COARSE GRAINED MULTICOMPUTERS

This page was built for publication: Coarse Grained Parallel Selection