Cache-aware and cache-oblivious adaptive sorting

Authors:
Gerth Stølting Brodal;Rolf Fagerberg;Gabriel Moruz
Affiliations:
BRICS, Department of Computer Science, University of Aarhus, Århus N, Denmark;Department of Mathematics and Computer Science, University of Southern Denmark, Odense M, Denmark;BRICS, Department of Computer Science, University of Aarhus, Århus N, Denmark
Venue:
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Year:
2005

Citing 14
Cited 11

The input/output complexity of sorting and related problems

Communications of the ACM
A new measure of presortedness

Information and Computation
Splitsort—an adaptive sorting algorithm

Information Processing Letters
A survey of adaptive sorting algorithms

ACM Computing Surveys (CSUR)
External memory algorithms and data structures: dealing with massive data

ACM Computing Surveys (CSUR)
Introduction to Algorithms

Introduction to Algorithms
Practical Adaptive Sorting

ICCI '91 Proceedings of the International Conference on Computing and Information: Advances in Computing and Information
Cache Oblivious Distribution Sweeping

ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
A General Lower Bound on the I/O-Complexity of Comparison-based Algorithms

WADS '93 Proceedings of the Third Workshop on Algorithms and Data Structures
External memory data structures

Handbook of massive data sets
On the limits of cache-obliviousness

Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Cache-Oblivious Algorithms

FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
A new representation for linear lists

STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Time bounds for selection

Journal of Computer and System Sciences

Engineering a cache-oblivious sorting algorithm

Journal of Experimental Algorithmics (JEA)
Optimal sparse matrix dense vector multiplication in the I/O-model

Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
Terracost: Computing least-cost-path surfaces for massive grid terrains

Journal of Experimental Algorithmics (JEA)
On the adaptiveness of Quicksort

Journal of Experimental Algorithmics (JEA)
Inversion-sensitive sorting algorithms in practice
Sorting on architecturally diverse computer systems

Proceedings of the Third International Workshop on High-Performance Reconfigurable Computing Technology and Applications
Low depth cache-oblivious algorithms

Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures
Adaptive algorithms for planar convex hull problems

FAW'10 Proceedings of the 4th international conference on Frontiers in algorithmics
Tradeoffs between branch mispredictions and comparisons for sorting algorithms

WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
Two constant-factor-optimal realizations of adaptive heapsort

IWOCA'11 Proceedings of the 22nd international conference on Combinatorial Algorithms
The weak-heap data structure: Variants and applications

Journal of Discrete Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

Two new adaptive sorting algorithms are introduced which perform an optimal number of comparisons with respect to the number of inversions in the input. The first algorithm is based on a new linear time reduction to (non-adaptive) sorting. The second algorithm is based on a new division protocol for the GenericSort algorithm by Estivill-Castro and Wood. From both algorithms we derive I/O-optimal cache-aware and cache-oblivious adaptive sorting algorithms. These are the first I/O-optimal adaptive sorting algorithms.