The Influence of Caches on the Performance of Sorting

Journal of Algorithms

Volumn 31, Issue 1, 1999, Pages 66-104

  LaMarca, Anthony ^a   Ladner, Richard E ^b  

^a PALO ALTO RESEARCH CENTER   (United States)

^b University of Washington   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0344406606     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1006/jagm.1998.0985     Document Type: Article

References (58)

1. A. Agarwal, M. Horowitz, and J. Hennessy, An analytical cache model, ACM Trans. Comput. Systems 7(2) (1989), 184-215.
2. A. Aggarwal, K. Chandra, and M. Snir, Hierarchical memory with block transfer, in "The Twenty-Eighth Annual IEEE Symposium on Foundations of Computer Science," 1987, pp. 204-216.
3. A. Aggarwal, K. Chandra, and M. Snir, A model for hierarchical memory, in "The Nineteenth Annual ACM Symposium on Theory of Computing," 1987, pp. 305-314.
4. A. Aggarwal and J. Vitter, The input/output complexity of sorting and related problems, Comm. ACM 31(9) (1988), 1116-1127.
5. B. Alpern, L. Carter, E. Feig, and T. Selker, The uniform memory hierarchy model of computation, Algorithmica 12(2-3) (1994), 72-109.
6. L. Arge, The buffer tree: A new technique for optimal I/O-algorithms, in "Proceedings of the WADS'95," Lecture Notes in Computer Science, Vol. 955, pp. 334-345, Springer-Verlag, Berlin/New York, 1995.
7. L. Arge, P. Ferragina, R. Grossi, and J. Vitter, On sorting strings in external memory, in "Proceedings of the STOC '97," 1997, pp. 540-548.
8. L. Arge, O. Procopiuc, S. Ramaswamy, T. Suel, and J. S. Vitter, Theory and practice of I/O-efficient algorithms for multidimensional batched searching problems, in "Proceedings of the SODA '98," 1998.
9. T. M. Austin, "Hardware and Software Mechanisms for Reducing Load Latency," Ph.D. dissertation, University of Wisconsin, Computer Sciences, 1996.
10. B. N. Bershad, D. Lee, T. Romer, and J. B. Chen, Avoiding conflict masses dynamically in large direct-mapped caches, in "Sixth International Conference on Architectural Support for Programming Languages and Operating Systems," 1994, pp. 158-170.
11. G. Blelloch, C. Plaxton, C. Leiserson, S. Smith, B. Maggs, and M. Zagha, A comparison of sorting algorithms for the connection machine, in "Proceedings of the Third ACM Symposium on Parallel Algorithms and Architecture," July 1991, pp. 3-16.
12. S. Carlsson, An optimal algorithm for deleting the root of a heap, Inform. Process. Lett. 37(2) (1991), 117-120.
13. S. Carr, K. McKinley, and C. W. Tseng, Compiler optimizations for improving data locality, in "Sixth International Conference on Architectural Support for Programming Languages and Operating Systems," 1994, pp. 252-262.
14. Y.-J. Chiang, Experiments on the practical I/O efficiency of geometric algorithms: Distribution sweep vs. plane sweep, in "Proceedings of the WADS '95," Lecture Notes in Computer Science, Vol. 955, pp. 346-357, Springer-Verlag, Berlin/New York, 1995.
15. M. Cierniak and Wei Li, Unifying data and control transformations for distributed shared-memory machines, in "Proceedings of the 1995 ACM Symposium on Programming Languages Design and Implementation," Assoc. Comput. Mach., New York, 1995, pp. 205-217.
16. D. Clark, Cache performance of the VAX-11/780, ACM Trans. Comput. Systems 1(1) (1983), 24-37.
17. J. De Graffe and W. Kosters, Expected heights in heaps, BIT 32(4) (1992), 570-579.
18. F. Dehne, W. Dittrich, and D. Hutchinson, Efficient external memory algorithms by simulating coarse-grained parallel algorithms, in "Proceedings of the Ninth Annual ACM Symposium on Parallel Algorithms and Architectures," 1997, pp. 106-115.
19. A. Diwan, D. Tarditi, and E. Moss, Memory subsystem performance of programs using copying garbage collection, in "Proceedings of the Twenty-First Annual ACM Symposium on Principles of Programming Languages," 1994, pp. 1-14.
20. W. Feller, "An Introduction to Probability Theory and Its Applications," Wiley, New York, 1971.
21. D. Fenwick, D. Foley, W. Gist, S. VanDoren, and D. Wissell, The AlphaServer 8000 series: High-end server platform development, Digital Tech. J. 7(1) (1995), 43-65.
22. R. W. Floyd, Treesort 3, Comm. ACM 7(12) (1964), 701.
23. E. H. Friend, J. ACM 3 (1956), 152.
24. S. Gal, Y. Hollander, and A. Itai, Optimal mapping in direct mapped cache environments, Math. Programming 63 (1994), 371-387.
25. S. Gal and B. Klots, Optimal partitioning which maximizes the sum of the weighted averages, Oper. Res. 43 (1995), 500-508.
26. D. Gannon, W. Jalby, and K. Gallivan, Strategies for cache and local memory management by global program transformation, J. Parallel Distributed Comput. 5(5) (Oct. 1988), 587-616.
27. G. Gonnet and J. Munro, Heaps on heaps, SIAM J. Comput. 15(4) (1986), 964-971.
28. D. Grunwald, B. Zorn, and R. Henderson, Improving the cache locality of memory allocation, in "Proceedings of the 1993 ACM Symposium on Programming Languages Design and Implementation," Assoc. Comput. Mach., New York, 1993, pp. 177-186.
29. J. Hennesey and D. Patterson, "Computer Architecture A Quantitative Approach," 2nd ed., Morgan Kaufman, San Mateo, CA, 1996.
30. C. A. R. Hoare, Quicksort, Comput. J. 5 (1962), 10-15.
31. F. E. Holberton, in "Symposium on Automatic Programming," 1952, pp. 34-39.
32. Y. Hollander and A. Itai, "On the Complexity of Direct Caching," Technical Report CS0794, Technion, Computer Science Department, Jan. 1994.
33. L. Hui and K. C. Sevcik, Parallel sorting by overpartitioning, in "Proceedings of the Sixth ACM Symposium on Parallel Algorithms and Architecture," June 1994, pp. 46-56.
34. D. B. Johnson, Priority queues with update and finding minimum spanning trees, Inform. Process. Lett. 4 (1975).
35. K. Kennedy and K. McKinley, Optimizing for parallelism and data locality, in "Proceedings of the 1992 International Conference on Supercomputing," 1992, pp. 323-334.
36. R. Kessler and M. Hill, Page placement algorithms for large real-indexed caches, ACM Trans. Comput. Systems 10(4) (Nov. 1992), 338-359.
37. D. E. Knuth, "The Art of Computer Programming, Vol. III. - Sorting and Searching," Addison-Wesley, Reading, MA, 1973.
38. V. Kumar and E. Schwabe, Improved algorithms and data structures for solving graph problems in external memory, in "Proceedings of the IEEE Symposium on Parallel and Distributed Processing," 1996, pp. 169-177.
39. A. LaMarca, "Caches and Algorithms," Ph.D. dissertation, University of Washington, May 1996.
40. A. LaMarca and R. E. Ladner, The influence of caches on the performance of heaps, J. Experimental Algorithmes 1(4) (1996).
41. A. Lebeck and D. Wood, Cache profiling and the spec benchmarks: a case study, Computer 27(10) (Oct. 1994), 15-26.
42. D. Naor, C. Martel, and N. Matloff, Performance of priority queue structures in a virtual memory environment, Comput. J. 34(5) (Oct. 1991), 428-437.
43. C. Nyberg, T. Barclay, Z. Cvetanovic, J. Gray, and D. Lomet, Alphasort: a RISC machine sort, in "1994 ACM SIGMOD International Conference on Management of Data," May 1994, pp. 233-242.
44. R. Reischuk, Probabilistic parallel algorithms for sorting and selection, SIAM J. Comput. 14 (1985), 396-409.
45. R. Sedgewick, Implementing quicksort programs, Comm. ACM 21(10) (Oct. 1978), 847-857.
46. H. H. Seward, Masters thesis, M.I.T. Digital Computer Laboratory Report R-232, 1954.
47. J. P. Singh, H. S. Stone, and D. F. Thiebaut, A model of workloads and its use in miss-rate prediction for fully associative caches, IEEE Trans. Comput. 41(7) (1992), 811-825.
48. A. Srivastava and A. Eustace, ATOM: A system for building customized program analysis tools, in "Proceedings of the 1994 ACM Symposium on Programming Languages Design and Implementation," Assoc. Comput. Mach., New York, 1994, pp. 196-205.
49. G. Taylor, P. Davies, and M. Farmwald, The TBL slice: a low-cost high-speed address translation mechanism, in "Proceedings of the Seventeenth Annual International Symposium on Computer Architecture," 1990, 355-363.
50. O. Temam, C. Fricker, and W. Jalby, Cache interference phenomena, in "Proceedings of the 1994 ACM SIGMETRICS Conference on Measurement and Modeling of Computer Systems," 1994, 261-271.
51. O. Temam, C. Fricker, and W. Jalby, Influence of cross-interferences on blocked loops: A case study with matrix-vector multiply, ACM Trans. Programming Languages Systems 17(4) (1995), 561-575.
52. D. E. Vengroff and J. S. Vitter, I/O-efficient scientific computation using TPIE, in "Proceedings of the Goddard Conference on Mass Storage Systems and Technologies," NASA Conference Publication 3340, Vol. II, 1996, pp. 553-570.
53. A. Verkamo, External quicksort, Performance Evaluation 8(4) (Aug. 1988), 271-288.
54. A. Verkamo, Performance comparison of distributive and mergesort as external sorting algorithms, J. Systems Software 10(3) (Oct. 1989), 187-200.
55. L. Wegner and J. Teuhola, The external heapsort, J. Systems Software 15(7) (July 1989), 917-925.
56. J. W. Williams, Heapsort, Comm. ACM 7(6) (1964), 347-348.
57. M. Wolf and M. Lam, A data locality optimizing algorithm, in "Proceedings of the 1991 ACM Symposium on Programming Languages Design and Implementation," Assoc. Comput. Mach., New York, 1991, pp. 30-44.
58. M. Wolfe, More iteration space tiling, in "Proceedings of Supercomputing '89," 1989, pp. 655-664.