Proximity Mergesort: Optimal In-Place Sorting in the Cache-Oblivious Model

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn 15, Issue , 2004, Pages 284-292

  Franceschini, Gianni ^a  

^a UNIVERSITY OF PISA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; DATA TRANSFER; FUNCTIONS; HIERARCHICAL SYSTEMS; RANDOM ACCESS STORAGE;

CACHE-OBLIVIOUS MODEL; MAIN MEMORY;

CACHE MEMORY;

EID: 1842487595     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (30)

1. Pankaj K. Agarwal, Lars Arge, Andrew Darmer, and Bryan Holland-Minkley. Cache-oblivious data structures for orthogonal range searching. In In Proc. 19th ACM Symposium on Computational Geometry, 2003.
2. A. Aggarwal, B. Alpern, A. Chandra, and M. Snir. A model for hierarchical memory. In Alfred Aho, editor, Proceedings of the 19th Annual ACM Symposium on Theory of Computing, pages 305-314, New York City, NY, May 1987. ACM Press.
3. A. Aggarwal, A. K. Chandra, and M. Snir. Hierarchical memory with block transfer. In Ashok K. Chandra, editor, Proceedings of the 28th Annual Symposium on Foundations of Computer Science, pages 204-216, Los Angeles, CA, October 1987. IEEE Computer Society Press.
4. Alok Aggarwal and Jeffrey Scott Vitter. The input/output complexity of sorting and related problems. Communications of the ACM, 31(9):1116-1127, September 1988.
5. Stephen Alstrup, Michael A. Bender, Erik D. Demaine, Martin Farach-Colton, J. Ian Munro, Theis Rauhe, and Mikkel Thorup. E cient tree layout in a multilevel memory hierarchy. Manuscript, November 11 2002.
6. Lars Arge, Michael A. Bender, Erik D. Demaine, Bryan Holland-Minkley, and J. Ian Munro. Cache-oblivious priority queue and graph algorithm applications. In Proceedings of the 34th Annual ACM Symposium on Theory of Computing (STOC-02), pages 268-276, New York, May 19-21 2002. ACM Press.
7. M. A. Bender, E. D. Demaine, and M. Farach-Colton. Cache-oblivious b-trees. In IEEE, editor, 41st Annual Symposium on Foundations of Computer Science: proceedings: 12-14 November, 2000, Redondo Beach, California, pages 399-409, 1109 Spring Street, Suite 300, Silver Spring, MD 20910, USA, 2000. IEEE Computer Society Press.
8. Michael A. Bender, Richard Cole, Erik D. Demaine, and Martin Farach-Colton. Scanning and traversing: Maintaining data for traversals in a memory hierarchy. Lecture Notes in Computer Science, 2461:139-??, 2002.
9. Michael A. Bender, Richard Cole, and Rajeev Raman. Exponential structures for e cient cache-oblivious algorithms. Lecture Notes in Computer Science, 2380:195-??, 2002.
10. Michael A. Bender, Erik D. Demaine, and Martin Farach-Colton. E cient tree layout in a multilevel memory hierarchy. Lecture Notes in Computer Science, 2461:165-??, 2002.
11. Michael A. Bender, Ziyang Duan, John Iacono, and Jing Wu. A locality-preserving cache-oblivious dynamic dictionary. In Proceedings of the 13th Annual ACM-SIAM Symposium On Discrete Mathematics (SODA-02), pages 29-38, New York, January 6-8 2002. ACM Press.
12. Gerth Stølting Brodal and Rolf Fagerberg. Cache oblivious distribution sweeping. Lecture Notes in Computer Science, 2380:426-??, 2002.
13. Gerth Stølting Brodai and Rolf Fagerberg. Funnel heap - A cache oblivious priority queue. Lecture Notes in Computer Science, 2518:219-??, 2002.
14. Gerth Stølting Brodai and Rolf Fagerberg. On the limits of cache-obliviousness. In Proc. 35th Annual ACM Symposium on Theory of Computing, 2003.
15. Gerth Stølting Brodal, Rolf Fagerberg, and Riko Jacob. Cache-oblivious search trees via trees of small height. In Proc. 13th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 39-48, 2002.
16. Gianni Franceschini and Viliam Geffert. A Simple In-Place Sorting with O(n log n) Comparisons and O(n) Moves. In Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science (FOCS), 2003.
17. Gianni Franceschini and Roberto Grossi. Implicit dictionaries supporting searches and amortized updates in O(log n log log n). In Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'03), pages 670-678. SIAM, 2003.
18. Gianni Franceschini and Roberto Grossi. Optimal cache-oblivious implicit dictionaries. In Proceedings of the 30th International Colloquium on Automata, Languages and Programming (ICALP), 2003.
19. Gianni Franceschini and Roberto Grossi. Optimal worst-case operations for implicit cache-oblivious search trees. In Proceedings of the 8th International Workshop on Algorithms and Data Structures (WADS), 2003.
20. Gianni Franceschini, Roberto Grossi, J. Ian Munro, and Linda Pagli. Implicit B-trees: New results for the dictionary problem. In Proceedings of the 43th Annual IEEE Symposium on Foundations of Computer Science (FOCS), 2002.
21. M. Frigo, C. E. Leiserson, H. Prokop, and S. Ramachandran, Cache-oblivious algorithms. In IEEE, editor, 40th Annual Symposium on Foundations of Computer Science: October 17-19, 1999, New York City, New York, pages 285-297, 1109 Spring Street, Suite 300, Silver Spring, MD 20910, USA, 1999. IEEE Computer Society Press.
22. Jyrki Katajainen and Tomi A. Pasanen. In-place sorting with fewer moves. Information Processing Letters, 70(1):31-37, April 1999.
23. D.E. Knuth. The Art of Computer Programming, Vol. 3: Sorting and Searching. 1973. (Second edition: 1998).
24. M. A. Kronrod. Optimal ordering algorithm without operational eld. Soviet Math. Dokl., 10:744-746, 1969.
25. Tony W. Lai and Derick Wood. Implicit selection. In R. Karlsson and A. Lingas, editors, SWAT 88: 1st Scandinavian Workshop on Algorithm Theory, volume 318 of Lecture Notes in Computer Science, pages 14- 23, Halmstad, Sweden, 5-8 July 1988. Springer-Verlag.
26. J. I. Munro. Searching a two key table under a single key. In Alfred Aho, editor, Proceedings of the 19th Annual ACM Symposium on Theory of Computing, pages 383-387, New York City, NY, May 1987. ACM Press.
27. J. Ian Munro and Venkatesh Raman. Sorting with minimum data movement, Journal of Algorithms, 13(3):374-393, September 1992.
28. J. Ian Munro and Hendra Suwanda. Implicit data structures for fast search and update. Journal of Computer and System Sciences, 21(2):236-250, 1980.
29. H. Prokop. Cache-oblivious algorithms. Master's thesis. MIT, Cambridge, MA, 1999.
30. Jeffrey Salowe and William Steiger. Simpli ed stable merging tasks. Journal of Algorithms, 8(4):557-571, December 1987.