Adapting radix sort to the memory hierarchy

ACM Journal of Experimental Algorithmics

Volumn 6, Issue , 2001, Pages

  Rahman, Naila ^a   Raman, Rajeev ^a  

^a KING'S COLLEGE LONDON   (United Kingdom)

Author keywords

Cache; Translation lookaside buffer (TLB)

Indexed keywords

EID: 33749364766     PISSN: 10846654     EISSN: None     Source Type: Journal    
DOI: 10.1145/945394.945401     Document Type: Article

References (20)

1. Aggarwal, A. and Vitter, J. S. 1988. The I/O complexity of sorting and related problems. Communications of the ACM 31, 1116-1127.
2. Aho, A. V., Hopcroft, J. E., and Ullman, J. D. 1974. The Design and Analysis of Computer Algorithms. Addison-Wesley.
3. Cormen, T. H., Leiserson, C. E., and Rivest, R. L. 1990. Introduction to Algorithms. MIT Press.
4. Friend, E. H. 1956. Sorting on electronic computer systems. Journal of the ACM 3, 134-168.
5. Frigo, M., Leiserson, C. E., Prokop, H., and Ramachandran, S. 1999. Cache-oblivious algorithms. In Proc. 40th IEEE FOCS (1999), pp. 285-298.
6. Gannon, D. and Jalby, W. 1987. The influence of memory hierarchy on algorithm organization: Programming FFTs on a vector multiprocessor. In L. H. Jamieson, D. B. Gannon, and R. J. Douglass Eds., The Characteristics of Parallel Algorithms. MIT Press.
7. Handy, J. 1998. The Cache Memory Handbook. Academic Press.
8. Hennessy, J. L. and Patterson, D. A. 1996. Computer Architecture: A Quantitative Approach (Second ed.). Morgan Kaufmann.
9. Ladner, R. E., Fix, J. D., and LaMarca, A. 1999. Cache performance analysis of traversal and random accesses. In Proc. 10th ACM-SIAM SODA (1999), pp. 613-622.
10. LaMarca, A. and Ladner, R. E. 1999. The influence of caches on the performance of sorting. Journal of Algorithms 31, 66-104.
11. Preliminary version in Proc. 8th ACM-SIAM SODA, 370-379, 1997.
12. Matias, Y., Segal, E., and Vitter, J. S. 2000. Efficient bundle sorting. In Proceedings of the 11th Annual SIAM/ACM Symposium on Discrete Algorithms (2000).
13. Mehlhorn, K. and Sanders, P. 2000. Accessing multiple sequences through set-associative cache. Unpublished manuscript.
14. Preliminary version in Proc. 26th ICALP, LNCS 1555, 1999.
15. Moret, B. and Shapiro, H. 1994. An empirical assessment of algorithms for constructing a minimum spanning tree. In Computational Support for Discrete Mathematics, Volume 15 of DIM ACS Monographs in Discrete Mathematics and Theoretical Computer Science, pp. 99-117. American Mathematical Society.
16. Rahman, N. and Raman, R. 1999. Analysing cache effects in distribution sorting. Manuscript submitted for journal publication. 1999. Preliminary version in Algorithm, Engineering: Proc. 3rd Workshop on Algorithm Engineering, Number 1668 in LNCS (1999), pp. 184-198.
17. Sen, S. and Chatterjee, S. 2000. Towards a theory of cache-efficient algorithms (extended abstract). In Proc. 11th ACM-SIAM SODA (2000), pp. 829-838.
18. Sleator, D. D. and Tarjan, R. E. 1985. Amortized efficiency of list update and paging rules. Communications of the ACM 28, 202-208.
19. Sun Microsystem. 1997. UltraSPARC User's Manual. Sun Microsystem.
20. Vitter, J. S. 2000. External memory algorithms and data structures: Dealing with MASSIVE data. To appear in ACM Computing Surveys.