Cache-efficient string sorting using copying

ACM Journal of Experimental Algorithmics

Volumn 11, Issue , 2006, Pages

  Sinha, Ranjan ^a   Zobel, Justin ^a   Ring, David ^b  

^a RMIT UNIVERSITY   (Australia)

^b NONE   (United States)

Author keywords

Algorithms; Algorthims; B.3.2 Memory Structures : Cache Memories; Cache; D.1.0 Programming Techniques : General; Design; E.1 Data Structures : Trees; E.5 Files : Sorting; Experimental algorithms; Experimentation; F.2.2 Analysis of Algorithms : Sorting; Performance; Sorting; String management; Tries

Indexed keywords

EID: 37849016162     PISSN: 10846654     EISSN: None     Source Type: Journal    
DOI: 10.1145/1187436.1187439     Document Type: Article

References (23)

1. ANDERSSON, A. AND NILSSON, S. 1998. Implementing radixsort. ACM J. Experimental Algorithmics 3, 7.
2. BENSON, D., LIPMAN, D. J., AND OSTELL, J. 1993. Genbank. Nucleic Acids Research 21, 13, 2963-2965.
3. BENTLEY, J. AND SEDGEWICK, R. 1997. Fast algorithms for sorting and searching strings. In Proc. Annual ACM-SIAM Symp. on Discrete Algorithms, Ed. Society for Industrial and Applied Mathematics, New Orleans, LA. 360-369.
4. BENTLEY, J. L. AND MCILROY, M. D. 1993. Engineering a sort function. Software - Practice and Experience 23, 11, 1249-1265.
5. DONGARRA, J., LONDON, K., MOORE, S., MUCCI, S., AND TERPSTRA, D. 2001. Using PAPI for hardware performance monitoring on linux systems. In Proc. Conf. on Linux Clusters: The HPC Revolution. Urbana, Illinois.
6. HARMAN, D. 1995. Overview of the second text retrieval conference (TREC-2). Inf. Process. Manage., 31, 3, 271-289.
7. HAWKING, D., CRASWELL, N., THISTLEWAITE, P., AND HARMAN, D. 1999. Results and challenges in web search evaluation. Computer Networks 31, 11-16, 1321-1330.
8. HEINZ, S., ZOBEL, J., AND WILLIAMS, H. E. 2002. Burst tries: A fast, efficient data structure for string keys. ACM Transactions on Information Systems 20, 2, 192-223.
9. rd Ed. Morgan Kaufmann Publishers, San Mateo, CA.
10. HOARE, C. A. R. 1961. Algorithm 64: Quicksort. Communications of the ACM 4, 7, 321.
11. HOARE, C. A. R. 1962. Quicksort. Computer Jour. 5, 1, 10-15.
12. JIMENEZ-GONZALEZ, D., NAVARRO, J., AND LARRIBA-PEY, J. L. 2003. CC-radix: a cache conscious sorting based on radix sort. In Proc. Euromicro Workshop on Parallel, Distributed and Network-based Processing, A. Clematis, Ed. IEEE Computer Society Press, Los Alamitos, CA, USA, 101-108.
13. LAMARCA, A. AND LADNER, R. E. 1999. The influence of caches on the performance of sorting. Jour. of Algorithms 31, 1, 66-104.
14. MCILROY, P. M., BOSTIC, K., AND MCILROY, M. D. 1993. Engineering radix sort. Computing Systems 6, 1, 5-27.
15. NILSSON, S. 1996. Radix sorting & searching. Ph.D. thesis, Department of Computer Science, Lund University, Lund, Sweden.
16. RAHMAN, N. AND RAMAN, R. 2000. Analysing cache effects in distribution sorting. ACM Jour. of Experimental Algorithmics 5, 14.
17. RAHMAN, N. AND RAMAN, R. 2001. Adapting radix sort to the memory hierarchy. ACM Jour. of Experimental Algorithmics 6, 7.
18. SEWARD, J. 2001. Valgrind - memory and cache profiler. http://developer.kde.org/~sewardj/docs-1.9.5/cg techdocs.html.
19. SINHA, R. 2004. Using compact tries for cache-efficient sorting of integers. In Proc. International Workshop on Efficient and Experimental Algorithms, C. C. Ribeiro, Ed. Lecture Notes in Computer Science, vol. 3059. Springer-Verlag, New York. 513-528.
20. SINHA, R. AND ZOBEL, J. 2004a. Cache-conscious sorting of large sets of strings with dynamic tries. ACM Jour. of Experimental Algorithmics 9, 1.5.
21. SINHA, R. AND ZOBEL, J. 2004b. Using random sampling to build approximate tries for efficient string sorting. In Proc. International Workshop on Efficient and Experimental Algorithms, C. C. Ribeiro, Ed. Lecture Notes in Computer Science, vol. 3059. Springer-Verlag, New York. 529-544.
22. WICKREMESINGHE, R., ARGE, L., CHASE, J., AND VITTER, J. S. 2002. Efficient sorting using registers and caches. ACM Jour. of Experimental Algorithmics 7, 9.
23. XIAO, L., ZHANG, X., AND KUBRICHT, S. A. 2000. Improving memory performance of sorting algorithms. ACM Jour. of Experimental Algorithmics 5, 3.