DBScholar

Back to papers

PARADIS: An Efficient Parallel Algorithm for In-place Radix Sort

Summary: PARADIS: parallel in-place radix sort with speculative permutation (stripes per core) and a parallel repair phase in a shared-nothing design. Adaptive load balancing allocates processors to buckets, addressing skew and enabling scalability. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
11218
Venue
VLDB
Year
2015
Pagerank
6.9501893e-05
Overall Rank
4,021 | 72.42%
DOI
10.14778/2824032.2824050

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@article{cho_vldb15,
        title = {{PARADIS: An Efficient Parallel Algorithm for In-place Radix Sort}},
        author = {Cho, Minsik and Finkler, Ulrich and Brand, Daniel and Kulandaisamy, Vincent and Bordawekar, Rajesh and Puri, Ruchir},
        journal = {PVLDB},
        series = {{VLDB} '15},
        volume = {8},
        number = {12},
        doi = {10.14778/2824032.2824050},
        url = {https://doi.org/10.14778/2824032.2824050},
        year = {2015}
}

Incoming Citations (Sorted by Pagerank)

Showing 7 of 7 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 9 of 9 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Previous Page 1 / 1 Next

Semantically Similar Papers