In this paper, we propose two new algorithms, Burstsort and MEBurstsort, for sorting large sets of integer keys. Our algorithms use a novel approach for sorting ...
Abstract. The increasing latency between memory and processor speeds has made it imperative for algorithms to reduce expensive ac- cesses to main memory. In ...
In this paper, we propose two new algorithms, Burstsort and MEBurstsort, for sorting large sets of integer keys. Our algorithms use a novel approach for sorting ...
Apr 8, 2009 · The new algorithms are simple, fast and efficient. We compare them against the best existing algorithms using several collections and data sizes ...
Using Compact Tries for Cache-Efficient Sorting of Integers. R. Sinha. WEA, volume 3059 of Lecture Notes in Computer Science, page 513-528.
Jan 9, 2016 · Combine index and data into a single array. Then use some cache-friendly sorting algorithm to sort these pairs (by index). Then get rid of indexes.
Missing: Compact | Show results with:Compact
Jul 2, 2012 · I'm trying to find the best data structure for a sorted list of positive integers (millions of elements). Requirements are (in order of importance):
Jan 31, 2018 · I found something ironic about sort performance in Julia vs R. I am trying to sort a vector with integer values ranging from 1 to 1_000_000.
Missing: Compact | Show results with:Compact
Mar 26, 2019 · For example if you have a list of 5-digit integers, then radix sort can sort it in O(n) time, but if you don't know how large the integers are, ...
Missing: Compact | Show results with:Compact
[PDF] Efficient sorting using registers and caches | Semantic Scholar
www.semanticscholar.org › paper
This paper introduces a new cache-conscious sorting algorithm, R-MERGE, which achieves better performance in practice over algorithms that are superior in ...