Analysing the cache behaviour of non-uniform distribution sorting algorithms

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1879, Issue , 2000, Pages 380-392

  Rahman, Naila ^a   Raman, Rajeev ^a  

^a KING'S COLLEGE LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS; DIGITAL ARITHMETIC;

AVERAGE CASE; CACHE PERFORMANCE; FLOATING POINT NUMBERS; NON-UNIFORM DISTRIBUTION; RADIX SORT; SORTING ALGORITHM;

DIGITAL ARITHMETIC; ALGORITHMS;

EID: 84927132247     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45253-2_35     Document Type: Article

References (15)

1. A. V. Aho, J. E. Hopcroft, and J. D. Ullman. The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, Massachusetts, 1974. 380
2. D. Dubhashi, and D. Ranjan. Balls and Bins: A Study in Negative Dependence. Random Structures and Algorithms 13(2) 1998, pp. 99-124. 386
3. M. Frigo, C. E. Leiserson, H. Prokop and S. Ramachandran. Cache-oblivious algorithms. In Proc. 40th FOCS, pp. 285-298, 1999.
4. J. Handy. The Cache Memory Handbook. Academic Press, 1998. 382
5. J. L. Hennessy and D. A. Patterson. Computer Architecture: A Quantitative Approach, 2e, Morgan Kaufmann, 1996. 380, 381, 381, 382, 389, 390
6. K. Joag-Dev and F. Proschan. Negative association of random variables, with applications. Ann Statist. 11 (1983), pp. 286-295. 386
7. D. E. Knuth. The Art of Computer Programming. Volume 3: Sorting and Searching, 3rd ed. Addison-Wesley, 1997. 380, 387
8. R. E. Ladner, J. D. Fix and A. LaMarca, The cache performance of traversals and random accesses In Proc. 10th ACM-SIAM SODA, pp. 613-622, 1999. 381, 381, 381, 390
9. A. LaMarca and R. E. Ladner, The influence of caches on the performance of sorting. In Journal of Algorithms 31 (1999), pp. 66-104. 380, 381, 381, 381, 390
10. K. D. Neubert. The Flashsort1 algorithm. Dr Dobb's Journal, pp. 123-125, February 1998. FORTRAN code listing, p. 131, ibid. 387
11. N. Rahman and R. Raman. Analysing Cache Effects in Distribution Sorting. In Proc. 3rd WAE, LNCS 1668, pp. 184-198, 1999. 380, 380, 381, 381, 382, 388, 390
12. N. Rahman and R. Raman. Adapting radix sort to the memory hierarchy. In Proc. 2nd ALENEX, 2000, www.cs.unm.edu/Conferences/ALENEX00/proceedings.html. 381
13. P. Sanders. Accessing multiple sequences through set-associative cache. In Proc. 26th ICALP, LNCS 1644, pp. 655-664, 1999. 381, 381, 381, 384, 387
14. S. Sen and S. Chatterjee. Towards a theory of cache-efficient algorithms (extended abstract). In Proc. 11th SODA, pp. 829-838, 2000. 381, 381, 381, 384, 387, 387
15. J. S. Vitter. External Memory Algorithms and Data Structures: Dealing with Massive Data. To appear in ACM Computing Surveys. 381