Analysing cache effects in distribution sorting

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

Volumn 1668, Issue , 1999, Pages 183-197

  Rahman, Naila ^a   Raman, Rajeev ^a  

^a KING'S COLLEGE LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

BUFFER STORAGE; DIGITAL ARITHMETIC;

CACHE ANALYSIS; CACHE MISS RATES; EXPECTED TIME; FLASHSORT1; FLOATING POINTS; FLOATING-POINT DATA; INTEGER OPERATIONS; SORTING ALGORITHM;

SORTING;

EID: 84957072154     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48318-7_16     Document Type: Conference Paper

References (7)

1. A. V. Aho, J. E. Hopcroft, and J. D. Ullman. The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, Massachusetts, 1974.
2. J. Handy. The Cache Memory Handbook. Academic Press, 1998.
3. J. L Hennessy and D. A. Patterson, Computer Architecture: A Quantitative Approach, 2nd ed. Morgan Kaufmann, 1996.
4. D. E. Knuth. The Art of Computer Programming. Volume 3: Sorting and Searching, 3rd ed. Addison-Wesley, 1997.
5. R. E. Ladner, J. D. Fix and A. LaMarca, The Cache performance of traversals and random accesses In Proc. 10th ACM-SIAM Symposium on Discrete Algorithms, pp. 613–622, 1999.
6. A. LaMarca and R. E. Ladner, The influence of caches on the performance of sorting. In Proc.8th ACM-SIAM Symposium on Discrete Algorithms, pp. 370–379, 1997
7. K. D. Neubert. The Flashsort1 algorithm. Dr Dobb’s Journal, pp 123–125, February 1998. FORTRAN code listing, p. 131