Analysing cache effects in distribution sorting

ACM Journal of Experimental Algorithmics

Volumn 5, Issue , 2000, Pages 14-

  Rahman, Naila ^a   Raman, Rajeev ^a  

^a KING'S COLLEGE LONDON   (United Kingdom)

Author keywords

Cache; Efficient sorting algorithms; External memory algorithms; Memory hierarchy

Indexed keywords

EID: 85005914923     PISSN: 10846654     EISSN: 10846654     Source Type: Journal    
DOI: 10.1145/351827.384256     Document Type: Article

References (12)

1. Aggaewal, A. and Vitter, J. S. 1988. The I/O complexity of sorting and related problems. Communications o] the ACM 31, 1116-1127.
2. Aho, A. V., Hopceoft, J. E., and Ullman, J. D. 1974. The Design and Analysis of Computer Algorithms. Addison-Wesley.
3. Handy, J. 1998. The Cache Memory Handbook. Academic Press.
4. Hennessy, J. L. and Patteeson, D. A. 1996. Computer Architecture: A Quantitative Approach (Second ed.). Morgan Kaufmann.
5. Rudin, W. 1974. Real & Complex Analysis. McGraw-Hill, New York.
6. Knuth, D. E. 1997. The Art of Computer Programming. Volume 3: Sorting and Searching, 3rd ed. Addison-Wesley.
7. Ladner, R. E., Fix, J. D., and LaMaeca, A. 1999. Cache performance analysis of traver-sals and random accesses. In Proc. 10th ACM-SJAM SODA (1999), pp. 613-622.
8. LaMaeca, A. and Ladner, R. E. 1999. The influence of caches on the performance of sorting. Journal of Algorithms 31, 66-104. Preliminary version in Proc. 8th ACM-SJAM SODA (1997), pp. 370-379.
9. Neubert, K. D. 1998. The Flashsortl algorithm. In Dr Dobb's Journal (February 1998), pp. 123-125. foetran code listing, p. 131.
10. Rahman, N. and Raman, R. 1999. Analysing cache effects in distribution sorting. Preliminary version in Algorithm Engineering: Proc. 3rd Workshop on Algorithm Engineering (1999), Number 1668 in LNCS, pp. 184-198.
11. Rahman, N. and Raman, R. 2000. Analysing the Cache Behaviour of Non-uniform Distribution Sorting Algorithms. In Proc. 8th Annual European Symposium on Algorithms (2000), Number 1879 in LNCS, pp. 380-391.
12. Sanders, P. 1999. Accessing multiple sequences through set-associative cache. In Proc. 26th ICALP (1999), Number 1644 in LNCS, pp. 655-664.