Cache-Aware and Cache-Oblivious Adaptive Sorting

Gerth Stølting Brodal, Rolf Fagerberg, and Gabriel Moruz

In Proc. 32nd International Colloquium on Automata, Languages, and Programming, volume 3580 of Lecture Notes in Computer Science, pages 576-588. Springer Verlag, Berlin, 2005.

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.

Copyright notice

© Springer-Verlag Berlin Heidelberg 2005. All rights reserved.

Online version

icalp05.pdf (167 Kb)

DOI

10.1007/11523468_47

Links

BIBTEX entry

@incollection{icalp05,
  author = "Gerth St{\o}lting Brodal and Rolf Fagerberg and Gabriel Moruz",
  booktitle = "Proc. 32nd International Colloquium on Automata, Languages, and Programming",
  doi = "10.1007/11523468_47",
  isbn = "978-3-540-27580-0",
  pages = "576-588",
  publisher = "Springer {V}erlag, Berlin",
  series = "Lecture Notes in Computer Science",
  title = "Cache-Aware and Cache-Oblivious Adaptive Sorting",
  volume = "3580",
  year = "2005"
}