Adaptive Bitonic Sorting: An Optimal Parallel Algorithm for Shared-Memory Machines
From MaRDI portal
Publication:3833633
DOI10.1137/0218014zbMath0677.68070OpenAlexW2007519459MaRDI QIDQ3833633
Gianfranco Bilardi, Alexandru Nicolau
Publication date: 1989
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://hdl.handle.net/1813/6609
sortingparallel computationbitonic sequenceshared-memory machinestime \(\times \) processors optimality
Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Theory of operating systems (68N25) Theory of software (68N99) Algorithms in computer science (68W99)
Related Items (23)
Fast integer merging on the EREW PRAM ⋮ An optimal parallel algorithm using exclusive read/writes for the rectilinear Voronoi diagram ⋮ AN EFFICIENT ALGORITHM FOR MANAGING A PARALLEL HEAP∗ ⋮ Exploiting few inversions when sorting: Sequential and parallel algorithms ⋮ Techniques for parallel manipulation of sparse matrices ⋮ Fast parallel GPU-sorting using a hybrid algorithm ⋮ Fast integer merging on the EREW PRAM ⋮ A complexity theory of efficient parallel algorithms ⋮ An optimal parallel adaptive sorting algorithm ⋮ Optimal parallel algorithms for point-set and polygon problems ⋮ Testing a simple polygon for monotonicity optimally in parallel ⋮ Parallel methods for visibility and shortest-path problems in simple polygons ⋮ Parallel heap: an optimal parallel priority queue ⋮ Optimal merging and sorting on the EREW PRAM ⋮ A note on adaptive parallel sorting ⋮ Parallel Sorting for GPUs ⋮ Constructing arrangements optimally in parallel ⋮ Fast and compact planar embeddings ⋮ Parallel algorithms for merging and sorting ⋮ Sorting in linear time? ⋮ Space-efficient parallel merging ⋮ Finding the Convex Hull of Discs in Parallel ⋮ An optimal parallel algorithm for merging using multiselection
This page was built for publication: Adaptive Bitonic Sorting: An Optimal Parallel Algorithm for Shared-Memory Machines
