Cache-aware and cache-oblivious adaptive sorting (2005)
| Venue: | In Proc. 32nd International Colloquium on Automata, Languages, and Programming, Lecture Notes in Computer Science |
| Citations: | 7 - 4 self |
BibTeX
@INPROCEEDINGS{Brodal05cache-awareand,
author = {Gerth Stølting Brodal and Rolf Fagerberg and Gabriel Moruz},
title = {Cache-aware and cache-oblivious adaptive sorting},
booktitle = {In Proc. 32nd International Colloquium on Automata, Languages, and Programming, Lecture Notes in Computer Science},
year = {2005},
publisher = {Springer Verlag}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
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/Ooptimal adaptive sorting algorithms. 1
