Cache-aware and cache-oblivious adaptive sorting

Lecture Notes in Computer Science

Volumn 3580, Issue , 2005, Pages 576-588

  Brodal, Gerth Stølting ^a   Fagerberg, Rolf ^b   Moruz, Gabriel ^a  

^a AARHUS UNIVERSITY   (Denmark)

^b UNIVERSITY OF SOUTHERN DENMARK   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

ADAPTIVE ALGORITHMS; ADAPTIVE SYSTEMS; BUFFER STORAGE;

ADAPTIVE SORTING ALGORITHMS; GENETICSORT ALGORITHM; LINEAR TIME REDUCTION;

SORTING;

EID: 26444495553     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11523468_47     Document Type: Conference Paper

References (21)

1. A. Aggarwal and J. S. Vitter. The input/output complexity of sorting and related problems. Communications of the ACM, 31(9):1116-1127, 1988.
2. L. Arge. External memory data structures. In J. Abello, P. M. Pardalos, and M. G. C. Resende, editors, Handbook of Massive Data Sets.
3. L. Arge, G. S. Brodal, and R. Fagerberg. Cache-oblivious data structures. In D. Mehta and S. Sahni, editors, Handbook of Data Structures and Applications, page 27. CRC Press, 2004.
4. L. Arge, M. Knudsen, and K. Larsen. A general lower bound on the I/O-complexity of comparison-based algorithms. In Proc. of Workshop on Algorithms and Data Structures, 1993.
5. M. Blum, R. W. Floyd, V. Pratt, R. L. Rivest, and R. E. Tarjan. Time bounds for selection. J. Comput. Syst. Sci., 7:448-461, 1973.
6. G. S. Brodai. Cache-oblivious algorithms and data structures. In Proc. 9th Scandinavian Workshop on Algorithm Theory, Lecture Notes in Computer Science. Springer Verlag, Berlin, 2004.
7. G. S. Brodai and R. Fagerberg. Cache oblivious distribution sweeping. In Proc. 29th International Colloquium on Automata, Languages, and Programming, pages 426-438. Springer Verlag, Berlin, 2002.
8. G. S. Brodai and R. Fagerberg. On the limits of cache-obliviousness. In Proc. 35th Annual ACM Symposium on Theory of Computing, pages 307-315, 2003.
9. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to Algorithms, 2nd Edition. MIT Press, 2001.
10. E. Demaine. Cache-oblivious algorithms and data structures. Lecture Notes from the EEF Summer School on Massive Data Sets, 2002.
11. V. Estivill-Castro and D. Wood. A new measure of presortedness. Information and Computation, 83(1):111-119, 1989.
12. V. Estivill-Castro and D. Wood. Practical adaptive sorting. In Advances in Computing and Information - Proc. of the International Conference on Computing and Information, pages 47-54. Springer-Verlag, 1991.
13. V. Estivill-Castro and D. Wood. A survey of adaptive sorting algorithms. ACM Computing Surverys, 24(4):441-475, 1992.
14. M. Frigo, C. E. Leiserson, H. Prokop, and S. Ramachandran. Cache oblivious algorithms. In 40th Ann. IEEE Symp. on Foundations of Computer Science, pages 285-298, 1999.
15. L. J. Guibas, E. M. McCreight, M. F. Plass, and J. R. Roberts. A new representation of linear lists. In Proc. 9th Ann. ACM Symp. on Theory of Computing, pages 49-60, 1977.
16. D. E. Knuth. The Art of Computer Programming. Vol 3, Sorting and searching. Addison-Wesley, 1973.
17. C. Levcopoulos and O. Petersson. Splitsort - an adaptive sorting algorithm. Information Processing Letters, 39(1):205-211, 1991.
18. H. Manilla. Measures of presortedness and optimal sorting algorithms. IEEE Trans. Comput., 34:318-325, 1985.
19. K. Mehlhorn. Data structures and algorithms. Vol. 1, Sorting and searching. Springer, 1984.
20. A. Pagh, R. Pagh, and M. Thorup. On adaptive integer sorting. In Proc. 12th Annual European Symposium on Algorithms, volume 3221, pages 556-567. 2004.
21. J. S. Vitter. External memory algorithms and data structures: Dealing with massive data. ACM Computing Surveys, 33(2):209-271, 2001.