Optimised predecessor data structures for internal memory

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

Volumn 2141 LNCS, Issue , 2001, Pages 67-78

  Rahman, Naila ^a   Cole, Richard ^b   Raman, Rajeev ^c  

^a KING'S COLLEGE LONDON   (United Kingdom)

^b POLYTECHNIC UNIVERSITY   (United States)

^c UNIVERSITY OF LEICESTER   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

CACHE MISS; CACHE-OBLIVIOUS ALGORITHMS; HIERARCHICAL MEMORY; INTERNAL MEMORY; PREDECESSOR PROBLEMS; PREDECESSOR QUERIES; 3 LEVELS; TRANSLATION LOOKASIDE BUFFER;

ALGORITHMS; COMPUTER ARCHITECTURE; DATA STRUCTURES; OPERATIONS RESEARCH; TREES (MATHEMATICS); BUFFER STORAGE; MEMORY ARCHITECTURE;

CACHE MEMORY;

EID: 78650747954     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44688-5_6     Document Type: Conference Paper

References (22)

1. L. Arge, J. S. Vitter. Optimal Dynamic Interval Management in External Memory (extended abstract). FOCS 1996, pp. 560-569.
2. A. Andersson. Faster Deterministic Sorting and Searching in Linear Space. In Proc. 37th IEEE FOCS, pp. 135-141, 1996.
3. Bender, M., Cole, R. and Raman. R. Exponential trees for cache-oblivious algorithms. In preparation, 2001.
4. Bender, M., Demaine, E. and Farach-Colton, M. Cache-oblivous B-trees. In Proc. 41st IEEE FOCS, pp. 399-409, 2000.
5. Comer, D. The Ubiquitous B-Tree. ACM Comput. Surv. 11 (1979), p.121.
6. Frigo, M., Leiserson, C. E., Prokop, H., and Ramachandran, S. Cache-oblivious algorithms. In Proc. 40th IEEE FOCS, pp. 285-298, 1999.
7. Furber, S. B. Arm System-On-Chip Architecture Addison-Wesley Professional, 2nd ed., 2000.
8. Hennessy, J. L. and Patterson, D. A. Computer Architecture: A Quantitative Approach (Second ed.). Morgan Kaufmann, 1996.
9. D. E. Knuth. The Art of Computer Programming. Volume 3: Sorting and Searching, 3rd ed. Addison-Wesley, 1997.
10. Ladner, R. E., Fix, J. D., and LaMarca, A. Cache performance analysis of traversals and random accesses. In Proc. 10th ACM-SIAM SODA (1999), pp. 613-622.
11. LaMarca, A. and Ladner, R. E. The influence of caches on the performance of sorting. J. Algorithms 31, 66-104, 1999.
12. Korda, M. and Raman, R. An experimental evaluation of hybrid data structures for searching. In Proc. 3rd WAE, LNCS 1668, pp. 213-227, 1999.
13. Mehlhorn, K. and Sanders, P. Accessing multiple sequences through set-associative cache, 2000. Prel. vers. Proc. 26th ICALP, LNCS 1555, 1999.
14. H. Prokop. Cache-oblivious algorithms. MS Thesis, MIT, 1999.
15. Rahman, N. and Raman, R. Analysing cache effects in distribution sorting. ACM J. Exper. Algorithmics, WAE '99 special issue, to appear. Prel. vers. in Proc. 3rd WAE, LNCS 1668, pp. 184-198, 1999.
16. Rahman, N. and Raman, R. Analysing the cache behaviour of non-uniform distribution sorting algorithms. In Proc. 8th ESA, LNCS 1879, pp. 380-391, 2000.
17. Rahman, N. and Raman, R. Adapting radix sort to the memory hierarchy. TR 00-02, King's College London, 2000, http://www.dcs.kcl.ac.uk/ technical-reports/2000.html Prel. vers. in Proc. ALENEX 2000.
18. Sen, S. and Chatterjee, S. Towards a theory of cache-efficient algorithms (extended abstract). In Proc. 11th ACM-SIAM SODA (2000), pp. 829-838.
19. Sleator, D. D. and Tarjan, R. E. Amortized efficiency of list update and paging rules. Communications of the ACM 28, 202-208, 1995.
20. Sun Microsystem. UltraSPARC User's Manual. Sun Microsystems, 1997.
21. Vitter, J. S. External memory algorithms and data structures: Dealing with MASSIVE data. To appear in ACM Computing Surveys, 2000.
22. D. E. Willard. Reduced memory space for multi-dimensional search trees. In Proc. STACS '85, pages 363-374, 1985.