Parallel Integer Sorting Is More Efficient Than Parallel Comparison Sorting on Exclusive Write PRAMs

DOI10.1137/S0097539799352449zbMath1008.68042OpenAlexW2053601995MaRDI QIDQ4785624

Yijie Han, Xiao-Jun Shen

Publication date: 5 January 2003

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0097539799352449

zbMATH Keywords

algorithmsanalysis of algorithmsparallel algorithmsdesign of algorithmsinteger sortingbucket sortingconservative algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10)

Related Items (8)

A Linear Time Algorithm for Ordered Partition ⋮ On coding labeled trees ⋮ Recognizing and representing proper interval graphs in parallel using merging and sorting ⋮ An efficient parallel algorithm for building the separating tree ⋮ Approximating Huffman codes in parallel ⋮ More Efficient Parallel Integer Sorting ⋮ Parallel computation of the Burrows Wheeler transform in compact space ⋮ Sorting real numbers in \(O(n \sqrt{\log n})\) time and linear space

This page was built for publication: Parallel Integer Sorting Is More Efficient Than Parallel Comparison Sorting on Exclusive Write PRAMs