Engineering a cache-oblivious sorting algorithm

ACM Journal of Experimental Algorithmics

Volumn 12, Issue , 2008, Pages

  Brodal, Gerth Stølting ^a   Fagerberg, Rolf ^b   Vinther, Kristoffer ^c,d  

^a AARHUS UNIVERSITY   (Denmark)

^b UNIVERSITY OF SOUTHERN DENMARK   (Denmark)

^c Systematic Software Engineering A S

^d SYSTEMATIC A S   (Denmark)

Author keywords

Cache oblivious algorithms; Funnelsort; Quicksort

Indexed keywords

EID: 51149097915     PISSN: 10846654     EISSN: None     Source Type: Journal    
DOI: 10.1145/1227161.1227164     Document Type: Article

References (49)

1. AGARWAL, P. K., ARGE, L., DANNER, A., AND HOLLAND-MINKLEY, B. 2003. Cache-oblivious data structures for orthogonal range searching. In Proc. 19th ACM Symposium on Computational Geometry. ACM, New York. 237-245.
2. AGGARWAL, A. AND VITTER, J. S. 1988. The input/output complexity of sorting and related problems. Communications of the ACM 31, 9, 1116-1127.
3. ARGE, L. 2001. External memory data structures. In Proc. 9th Annual European Symposium on Algorithms. LNCS, vol. 2161. Springer, New York. 1-29.
4. ARGE, L., BENDER, M. A., DEMAINE, E. D., HOLLAND-MINKLEY, B., AND MUNRO, J. I. 2002a. Cache-oblivious priorityqueue and graph algorithm applications. In Proc. 34th Annual ACM Symposium on Theory of Computing. ACM, New York. 268-276.
5. ARGE, L., CHASE, J., VITTER, J. S., AND WICKREMESINGHE, R. 2002b. Efficient sorting using registers and caches. ACM Journal of Experimental Algorithmics 7, 9.
6. ARGE, L., BRODAL, G. S., AND FAGERBERG, R. 2005a. Cache-oblivious data structures. In Handbook of Data Structures and Applications, D. Mehta and S. Sahni, Eds. CRC Press, Boca Ratom, FL. Chapter 34.
7. ARGE, L., BRODAL, G. S., FAGERBERG, R., AND LAUSTSEN, M. 2005b. Cache-oblivious planar orthogonal range searching and counting. In Proc. 21st Annual ACM Symposium on Computational Geometry. ACM, New York. 160-169.
8. ARGE, L., DE BERG, M., AND HAVERKORT, H. J. 2005c. Cache-oblivious R-trees. In Proc. 21st Annual ACM Symposium on Computational Geometry. ACM, New York. 170-179.
9. BAYER, R. AND MCCREIGHT, E. 1972. Organization and maintenance of large ordered indexes. Acta Informatica 1, 173-189.
10. BENDER, M., COLE, R., DEMAINE, E., AND FARACH-COLTON, M. 2002a. Scanning and traversing: Maintaining data for traversals in a memory hierarchy. In Proc. 10th Annual European Symposium on Algorithms. LNCS, vol. 2461. Springer, New York. 139-151.
11. BENDER, M., COLE, R., AND RAMAN, R. 2002b. Exponential structures for cache-oblivious algorithms. In Proc. 29th International Colloquium on Automata, Languages, and Programming. LNCS, vol. 2380. Springer, New York. 195-207.
12. BENDER, M., DEMAINE, E., AND FARACH-COLTON, M. 2002c. Efficient tree layout in a multilevel memory hierarchy. In Proc. 10th Annual European Symposium on Algorithms. LNCS, vol. 2461. Springer, New York. 165-173. Full version at http://arxiv.org/abs/cs/0211010.
13. BENDER, M. A., DEMAINE, E., AND FARACH-COLTON, M. 2000. Cache-oblivious B-trees. In Proc. 41st Annual Symposium on Foundations of Computer Science. IEEE Computer Society Press, Washington D.C. 399-409.
14. BENDER, M. A., DUAN, Z., IACONO, J., AND WU, J. 2002d. A locality-preserving cache-oblivious dynamic dictionary. In Proc. 13th Annual ACM-SIAM Symposium on Discrete Algorithms. ACM-SIAM, New York. 29-39.
15. BENDER, M. A., BRODAL, G. S., FAGERBERG, R., GE, D., HE, S., HU, H., IACONO, J., AND LÓPEZ-ORTIZ, A. 2003. The cost of cache-oblivious searching. In Proc. 44th Annual IEEE Symposium on Foundations of Computer Science. IEEE Computer Society Press, Washington D.C. 271-282.
16. BENDER, M. A., FINEMAN, J. T., GILBERT, S., AND KUSZMAUL, B. C. 2005. Concurrent cache-oblivious B-trees. In Proc. 17th Annual ACM Symposium on Parallel Algorithms. ACM, New York. 228-237.
17. BENDER, M. A., FARACH-COLTON, M., AND KUSZMAUL, B. C. 2006. Cache-oblivious string B-trees. In Proc. 25th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems. ACM, New York. 233-242.
18. BENTLEY, J. L. AND MCILROY, M. D. 1993. Engineering a sort function. Software-Practice and Experience 23, 1, 1249-1265.
19. BRODAL, G. S. 2004. Cache-oblivious algorithms and data structures. In Proc. 9th Scandinavian Workshop on Algorithm Theory. LNCS, vol. 3111. Springer, New York. 3-13.
20. BRODAL, G. S. AND FAGERBERG, R. 2002a. Cache oblivious distribution sweeping. In Proc. 29th International Colloquium on Automata, Languages, and Programming. LNCS, vol. 2380. Springer, New York. 426-438.
21. BRODAL, G. S. AND FAGERBERG, R. 2002b. Funnel heap - a cache-oblivious priority queue. In Proc. 13th Annual International Symposium on Algorithms and Computation. LNCS, vol. 2518. Springer, New York. 219-228.
22. BRODAL, G. S. AND FAGERBERG, R. 2003. On the limits of cache-obliviousness. In Proc. 35th Annual ACM Symposium on Theory of Computing. ACM, New York. 307-315.
23. BRODAL, G. S. AND FAGERBERG, R. 2006. Cache-oblivious string dictionaries. In Proc. 17th Annual ACM-SIAM Symposium on Discrete Algorithms. ACM-SIAM, New York. 581-590.
24. BRODAL, G. S., FAGERBERG, R., AND JACOB, R. 2002c. Cache oblivious search trees via binary trees of small height. In Proc. 13th Annual ACM-SIAM Symposium on Discrete Algorithms. ACM-SIAM, New York. 39-48.
25. BRODAL, G. S., FAGERBERG, R., MEYER, U., AND ZEH, N. 2004. Cache-oblivious data structures and algorithms for undirected breadth-first search and shortest paths. In Proc. 9th Scandinavian Workshop on Algorithm Theory. LNCS, vol. 3111. Springer, New York. 480-492.
26. BRODAL, G. S., FAGERBERG, R., AND MORUZ, G. 2005. Cache-aware and cache-oblivious adaptive sorting. In Proc. 32nd International Colloquium on Automata, Languages, and Programming. LNCS, vol. 3580. Springer, New York. 576-588.
27. CHOWDHURY, R. A. AND RAMACHANDRAN, V. 2004. Cache-oblivious shortest paths in graphs using buffer heap. In Proc. 16th Annual ACM Symposium on Parallelism in Algorithms and Architectures. ACM, New York.
28. CHOWDHURY, R. A. AND RAMACHANDRAN, V. 2006. Cache-oblivious dynamic programming. In Proc. 17th Annual ACM-SIAM Symposium on Discrete Algorithms. ACM-SIAM, New York. 591-600.
29. DEPARTMENT OF COMPUTER SCIENCE, DUKE UNIVERSITY. 2002. TPIE: a transparent parallel I/O environment. WWW page, http://www.cs.duke.edu/TPIE/.
30. FAGERBERG, R., PAGH, A., AND PAGH, R. 2006. External string sorting: Faster and cache-oblivious. In Proc. 23rd Annual Symposium on Theoretical Aspects of Computer Science. LNCS, vol. 3884. Springer, New York. 68-79.
31. FARZAN, A., FERRAGINA, P., FRANCESCHINI, G., AND MUNRO, J. I. 2005. Cache-oblivious comparison-based algorithmson multisets. In Proc. 13th Annual European Symposium on Algorithms. LNCS, vol. 3669. Springer, New York. 305-316.
32. FRANCESCHINI, G. 2004. Proximity mergesort: Optimal in-place sorting in the cache-oblivious model. In Proc. 15th Annual ACM-SIAM Symposium on Discrete Algorithms. ACM-SIAM, New York. 291-299.
33. FRANCESCHINI, G. AND GROSSI, R. 2003a. Optimal cache-oblivious implicit dictionaries. In Proc. 30th International Colloquium on Automata, Languages, and Programming. LNCS, vol. 2719. Springer, New York. 316-331.
34. FRANCESCHINI, G. AND GROSSI, R. 2003b. Optimal worst-case operations for implicit cache-oblivious search trees. In Proc. 8th International Workshop on Algorithms and Data Structures. LNCS, vol. 2748. Springer, New York. 114-126.
35. FRIGO, M., LEISERSON, C. E., PROKOP, H., AND RAMACHANDRAN, S. 1999. Cache-oblivious algorithms. In Proc. 40th Annual Symposium on Foundations of Computer Science. IEEE Computer Society Press, Washington D.C. 285-297.
36. GRAY, J. 2003. Sort benchmark home page. WWW page, http://research.microsoft.com/barc/SortBenchmark/.
37. HWANG, F. K. AND LIN, S. 1972. A simple algorithm for merging two disjoint linearly ordered sets. SIAM Journal on Computing 1, 1, 31-39.
38. JAMPALA, H. AND ZEH, N. 2005. Cache-oblivious planar shortest paths. In Proc. 32nd International Colloquium on Automata, Languages, and Programming. LNCS, vol. 3580. Springer, New York. 563-575.
39. KNUTH, D. E. 1998. The Art of Computer Programming, Vol 3, Sorting and Searching, 2nd ed. Addison-Wesley, Reading, MA.
40. LADNER, R. E., FORTNA, R., AND NGUYEN, B.-H. 2002. A comparison of cache aware and cache oblivious static search trees using program instrumentation. In Experimental Algorithmics. LNCS, vol. 2547. Springer, New York. 78-92.
41. LAMARCA, A. AND LADNER, R. E. 1999. The influence of caches on the performance of sorting. Journal of Algorithms 31, 66-104.
42. PROKOP, H. 1999. Cache-oblivious algorithms. M.S. thesis, Massachusetts Institute of Technology.
43. RAHMAN, N., COLE, R., AND RAMAN, R. 2001. Optimised predecessor data structures for internal memory. In Proc. 5th International Workshop on Algorithm Engineering. LNCS 2141, 67-78.
44. SANDERS, P. 2000. Fast priority queues for cached memory. ACM Journal of Experimental Algorithmics 5, 7.
45. SEDGEWICK, R. 1998. Algorithms in C++: Parts 1-4: Fundamentals, Data Structures, Sorting, Searching, third ed. Addison-Wesley, Reading, MA. Code available at http://www.cs.princeton.edu/∼rs/Algs3.cxx1- 4/code.txt.
46. VINTHER, K. 2003. Engineering cache-oblivious sorting algorithms. M.S. thesis, Department of Computer Science, University of Aarhus, Denmark. Available online at http://kristoffer.vinther.name/academia/thesis/.
47. VITTER, J. S. 2001. External memory algorithms and data structures: Dealing with massive data. ACM Computing Surveys 33, 2, 209-271.
48. WILLIAMS, J. W. J. 1964. Algorithm 232: Heapsort. Communications of the ACM 7, 347-348.
49. XIAO, L., ZHANG, X., AND KUBRICHT, S. A. 2000. Improving memory performance of sorting algorithms. ACM Journal of Experimental Algorithmics 5, 3.