Accessing multiple sequences through set associative caches

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

Volumn 1644 LNCS, Issue , 1999, Pages 655-664

  Sanders, Peter ^a  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

External memory algorithm; Memory hierarchy; Multi merge; Set associative cache

Indexed keywords

AUTOMATA THEORY;

CACHE HIERARCHIES; EXTERNAL MEMORY ALGORITHMS; HIGH PERFORMANCE PROCESSORS; LOWER ORDER TERMS; MEMORY HIERARCHY; MULTIPLE SEQUENCES; SEQUENTIAL DATA; SET ASSOCIATIVE CACHE;

CACHE MEMORY;

EID: 22644450628     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48523-6_62     Document Type: Conference Paper

References (22)

1. L. Arge. The buffer tree: A new technique for optimal I/O-algorithms. In 4th Workshop on Algorithms and Data Structures, number 955 in LNCS, pages 334{ 345. Springer, 1995.
2. R. D. Barve, E. F. Grove, and J. S. Vitter. Simple randomized mergesort on parallel disks. Parallel Computing, 23(4):601{631, 1997.
3. Gerth StØlting Brodal and Jyrki Katajainen. Worst-case e-cient external-memory priority queues. In 6th Scandinavian Workshop on Algorithm Theory, number 1432 in LNCS, pages 107{118. Springer Verlag, Berlin, 1998.
4. A. Crauser, P. Ferragina, and U. Meyer. Effcient priority queues in external memory. working paper, October 1997.
5. R. Fadel, K. V. Jakobsen, J. Katajainen, and J. Teuhola. External heaps combined with effective buffering. In 4th Australasian Theory Symposium, volume 19-2 of Australian Computer Science Communications, pages 72{78. Springer, 1997.
6. C. Fricker and P. Robert. An analytical cache model. Technical Report 1496, INRIA, Le Chesnay, 1991.
7. J. L. Hennessy and D. A. Patterson. Computer Architecture a Quantitative Approach. Morgan Kaufmann, 1996.
8. Intel Corporation, P.O. Box 5937, Denver, CO, 80217-9808, http://www.intel.com. Intel Archtecture Software Developer's Manual. Volume I: Basic Architecture, 1997. Ordering Number 243190.
9. J. Keller. The 21264: A superscalar alpha processor with out-of-order execution. In Microprocessor Forum, October 1996.
10. A. LaMarca and R. E. Ladner. The influence of caches on the performance of heaps. ACM Journal of Experimental Algorithmics, 1(4), 1996.
11. A. LaMarca and R. E. Ladner. The influence of caches on the performance of sorting. In 8th ACM-SIAM Symposium on Discrete Algorithm, pages 370{379, 1997.
12. MIPS Technologies, Inc. R10000 Microprocessor User's Manual, 2.0 edition, 1998. http://www.mips.com.
13. J. von Neumann. First draft of a report on the EDVAC. Technical report, University of Pennsylvania, 1945.
14. W. H. Press, S.A. Teukolsky, W. T. Vetterling, and B. P. Flannery. Numerical Recipes in C. Cambridge University Press, 2nd edition, 1992.
15. G. Rao. Performance analysis of cache memories. Journal of the ACM, 25(3):378{ 395, 1978.
16. P. Sanders. Random permutations on distributed, external and hierarchical memory. Information Processing Letters, 67(6):305{310, 1998.
17. Peter Sanders. Fast priority queues for cached memory. In ALENEX '99, Workshop on Algorithm Engineering and Experimentation, LNCS. Springer, 1999.
18. J. Sibeyn. From parallel to external list ranking. Technical Report MPI-I-97-1- 021, Max-Planck Institut f̈ur Informatik, 1997.
19. Sun Microsystems. UltraSPARC-IIi User's Manual, 1997.
20. D. E. Vengroff. TPIE User Manual and Reference, 1995. http://www.cs.duke.edu/dev/tpie-home-page.html.
21. J. S. Vitter. External memory algorithms. In 6th European Symposium on Algorithms, number 1461 in LNCS, pages 1{25. Springer, 1998.
22. J. S. Vitter and E. A. M. Shriver. Algorithms for parallel memory I: Two level memories. Algorithmica, 12(2{3):110{147, 1994.