A modal model of memory

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

Volumn 2073, Issue , 2001, Pages 81-96

  Mitchell, Nick ^a   Carter, Larry ^b   Ferrante, Jeanne ^c  

^a IBM T J WATSON RESEARCH CENTER   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Cache; Modal; Model; Performance; Profiling

Indexed keywords

EID: 84949641205     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45545-0_18     Document Type: Conference Paper

References (35)

1. D. Bailey and et al. NAS parallel benchmarks. http://science.nas.nasa.gov/Software/NPB.
2. D. A. Berson, R. Gupta, and M. L. Soffa. URSA: A unified resource allocator for registers and functional units in vliw architectures. In Conference on Architectures and Compilation Techniques for Fine and Medium Grain Parallelism, Orlando, FL, Jan. 1993.
3. J. Bilmes, K. Asanović, C.-W. Chin, and J. Demmel. Optimizing matrix multiply using PHiPAC: a portable, high-performance, ANSI C coding methodology. In International Conference on Supercomputing, 1997.
4. E. A. Brewer. Portable High-Performance Supercomputing: High-Level Platform-Dependent Optimization. PhD thesis, Massachusetts Institute of Technology, 1994.
5. C. S. Collberg. Reverse interpretation + mutation analysis = automatic retargeting. In Programming Language Design and Implementation, 1997.
6. C. Consel, L. Hornof, J. Lawall, R. Marlet, G. Muller, J. Noyé, S. Thibault, and N. Volanschi. Tempo: Specializing systems applications and beyond. In Symposium on Partial Evaluation, 1998.
7. P. Diniz and M. Rinard. Dynamic feedback: An effective technique for adaptive computing. In Programming Language Design and Implementation, June 1997.
8. D. R. Engler, W. C. Hsieh, and M. F. Kaashoek. ’C: A language for high-level, efficient, and machine-independent dynamic code generation. In Principles of Programming Languages, Saint Petersburg, FL, Jan. 1996.
9. A. P. Ershov. On the partial computation principle. Inf. Process. Lett., 1977.
10. J. Ferrante, V. Sarkar, and W. Thrash. On estimating and enhancing cache effectiveness. In Workshop on Languages and Compilers for Parallel Computing, 1991.
11. B. Fraguela, R. Doallo, and E. Zapata. Automatic analytical modeling for the estimation of cache misses. In Parallel Architectures and Compilation Techniques, Oct. 1999.
12. M. Frigo and S. G. Johnson. The fastest fourier transform in the west. Technical Report MIT-LCS-TR-728, Massachusetts Institute of Technology, Laboratory for Computer Science, Sept. 1997.
13. K. S. Gatlin and L. Carter. Architecture-cognizant divide and conquer algorithms. In Supercomputing, Nov. 1999.
14. S. Ghosh. Cache Miss Equations: Compiler Analysis Framework for Tuning Memory Behavior. PhD thesis, Princeton, Sept. 1999.
15. B. Grant, M. Mock, M. Philipose, C. Chambers, and S. J. Eggers. DyC: An expressive annotation-directed dynamic compiler for c. Technical Report UWCSE-97-03-03, University of Washington, Department of Computer Science and Engineering, June 1998.
16. J. L. Gustafson and Q. O. Snell. HINT-a new way to measure computer performance. In HICSS-28, Wailela, Maui, Hawaii, Jan. 1995.
17. R. Hoover and K. Zadeck. Generating machine specific optimizing compilers. In Principles of Programming Languages, St. Petersburg, FL, 1996.
18. W. Kelly and W. Pugh. A unifying framework for iteration reordering transformations. In Proceedings of IEEE First International Conference on Algorithms and Architectures for Parallel Processing, Apr. 1995.
19. R. E. Ladner, J. D. Fix, and A. LaMarca. Cache performance analaysis of traversals and random accesses. In Symposium on Discrete Algorithms, Jan. 1999.
20. M. Leone and P. Lee. A declarative approach to run-time code generation. In Workshop on Compiler Support for System Software, pages 8-17, Tuscon, AZ, 1996.
21. O. M. Lubeck, Y. Luo, H. J. Wasserman, and F. Bassetti. Development and validation of a hierarhical memory model incorporating cpu-and memory-operation overlap. Technical Report LA-UR-97-3462, Los Alamos National Laboratory, 1998.
22. J. D. McCalpin. Memory bandwidth and machine balance in current high performance computers. In IEEE Computer Society Technical Committee on Computer Architecture Newsletter, Dec. 1995.
23. L. McVoy and C. Staelin. lmbench: Portable tools for performance analysis. In Usenix Proceedings, Jan. 1995.
24. N. Mitchell. Guiding Program Transformations with Modal Performance Models. PhD thesis, University of California, San Diego, Aug. 2000.
25. N. Mitchell, K. Högstedt, L. Carter, and J. Ferrante. Quantifying the multi-level nature of tiling interactions. In International Journal on Parallel Programming, June 1998.
26. R. H. Saavedra and D. Park. Improving the effectiveness of software prefetching with adaptive execution. In Parallel Architectures and Compilation Techniques, Boston, MA, Oct. 1996.
27. R. H. Saavedra and A. J. Smith. Measuring cache and TLB performance and their effect on benchmark run times. IEEE Trans. Comput., 44(10):1223-1235, Oct. 1995.
28. V. Sarkar. Automatic selection of high-order transformations in the IBM XL FORTRAN compilers. IBM J. Res. Dev., 41(3), May 1997.
29. V. Sarkar and R. Thekkath. A general framework for iteration-reordering loop transformations (Technical Summary). In Programming Language Design and Implementation, 1992.
30. O. Temam, E. D. Granston, and W. Jalby. To copy or not to copy: A compiletime technique for assessing when data copying should be used to eliminate cache conflicts. In Supercomputing’93, pages 410-419, Portland, Oregon, Nov. 1993.
31. S. W. K. Tjiang and J. L. Hennessy. Sharlit—a tool for building optimizers. In Programming Language Design and Implementation, pages 82-93, San Francisco, California, June 1992. SIGPLAN Notices 27(7), July 1992.
32. M. J. Voss and R. Eigenmann. ADAPT: Automated de-coupled adaptive program transformation. In International Conference on Parallel Processing, Toronto, CA, Aug. 2000.
33. T. P. Way and L. L. Pollock. Towards identifying and monitoring optimization impacts. In Mid-Atlantic Student Workshop on Programming Languages and Systems, 1997.
34. R. C. Whaley and J. Dongarra. Automatically tuned linear algebra software. In Supercomputing, Nov. 1998.
35. D. Whitfield and M. L. Soffa. An approach to ordering optimizing transformations. In Principles and Practice of Parallel Programming, pages 137-146, Seattle, WA, Mar. 1990.