Cost effective memory disambiguation for multimedia codes

Proceedings of the 2002 International Conference on Compilers, Architecture, and Synthesis for Embedded Systems, CASES '02

Volumn , Issue , 2002, Pages 117-126

  Salamí, Esther ^a   Corbal, Jesús ^a   Álvarez, Carlos ^a   Valero, Mateo ^a  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

Memory disambiguation; Multimedia; Run time analysis; Time to market; VLIW

Indexed keywords

ACCESS PATTERNS; ALIASING; ARRAY ELEMENTS; BENCHMARK SUITES; CODE SIZE; COST EFFECTIVE; DISAMBIGUATION METHOD; MEDIA MEMORY; MEDIABENCH; MEMORY DISAMBIGUATION; MEMORY REFERENCES; RUN-TIME ANALYSIS; RUNTIMES; VLIW ARCHITECTURES;

BENCHMARKING; COST EFFECTIVENESS; PROGRAM COMPILERS; SYNTHESIS (CHEMICAL); VERY LONG INSTRUCTION WORD ARCHITECTURE;

EMBEDDED SYSTEMS;

EID: 33745157400     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/581630.581649     Document Type: Conference Paper

References (27)

1. S. Aditya, V. Kathail, and B. R. Rau. Elcor's machine description system: Version 3.0. Technical Report HPL-98-128, Information Technology Center, 1998.
2. D. Bernstein, D. Cohen, and D. E. Maydan. Dynamic memory disambiguation for array references. In Proceedings of the 27th Annual International Symposium on Microarchitecture, pages 105-111, November 1994.
3. B.-C. Cheng and W. mei W. Hwu. Modular interprocedural pointer analysis using access paths: design, implementation, and evaluation. In ACM SIGPLAN'00 Conference on Programming Language Design and Implementation, pages 57-69, 2000.
4. J.-D. Choi, M. Burke, and P. Carini. Efficient flow-sensitive interprocedural computation of pointer-induced aliases and side effects. In 20th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 232-245, Charleston, South Carolina, 1993.
5. A. Devices. Introducing tigersharc. Whitepaper. Available at http://www.analog.com/new/ads/html/SHARC2.
6. M. Emami, R. Ghiya, and L. J. Hendren. Context-sensitive interprocedural points-to analysis in the presence of function pointers. In ACM SIGPLAN'94 Conference on Programming Language Design and Implementation, pages 242-256, 1994.
7. D. M. Gallagher, W. Y. Chen, S. A. Mahlke, J. C. Gyllenhaal, and W. W. Hwu. Dynamic memory disambiguation using the memory conflict buffer. ACM SIGPLAN Notices, 29(11):183-193, 1994.
8. G. Golf, K. Kennedy, and C. Tseng. Practical dependence testing. In ACM SIGPLAN'91 Conference on Programming Language Design and Implementation, pages 15-29, June 1991.
9. A. Huang, G. Slavenburg, and J. Shen. Speculative disambiguation: A compilation technique for dynamic memory disambiguation. In Proceedings of the 21st International Symposium on Computer Architecture, pages 200-210, April 1994.
10. V. Kathail, M. Schlansker, and B. R. Rau. Hpl-pd architecture specification: Version 1.1. Technical Report HPL-93-180(R.1), Hewlett-Packard Laboratories, 2000.
11. H. P. Lab., R.-I. Group, and I. Group. Trimaran user manual. Available at http://www.trimaran.org/docs.html, 1998.
12. C. Lee, M. Potkonjak, and W. H. Mangione-Smith. Mediabench: A tool for evaluating and synthesizing multimedia and communications systems. MICRO-30, 1997.
13. S. A. Mahlke, D. C. Lin, W. Y. Chen, R. E. Hank, and R. A. Bringmann. Effective compiler support for predicated execution using the hyperblock. In Proceedings of the 25th International Symposium on Microarchitecture, pages 45-54, Dec. 1992.
14. D. Maydan, J. Hennessy, and M. Lam. Efficient and exact data dependence analysis. In ACM SIGPLAN'91 Conference on Programming Language Design and Implementation, pages 1-14, June 1991.
15. W. mei W. Hwu, S. A. Mahlke, W. Y. Chen, P. P. Chang, N. J. Warter, R. A. Bringmann, R. G. Ouellette, R. E. Hank, T. Kiyohara, G. E. Haab, J. G. Holm, , and D. M. Lavery. The superblock: An effective technique for vliw and superscalar compilation. The Journal of Supercomputing, Kluwer Academic Publishers, pages 229-248, 1993.
16. S. Moon and M. W. Hall. Evaluation of predicated array data-flow analysis for automatic parallelization. In ACM Symposium on Principles Practice of Parallel Programming, pages 84-95, 1999.
17. A. Nicolau. Run-time disambiguation: Coping with statically unpredictable dependencies. IEEE Transactions on Computers, 38(5):663-678, May 1989.
18. Y. Paek, J. Hoeflinger, and D. Padua. Simplification of array access patterns for compiler optimizations. ACM SIGPLAN Notices, 33(5):60-71, 1998.
19. J. Park and M. S. Schlansker. On predicated execution. Technical Report HPL-91-158, Hewlett-Packard Laboratories, 1991.
20. W. Pugh and D. Wonnacott. Constraint-based array dependence analysis. ACM Transactions on Programming Languages and Systems, 20(3):635-678, May 1998.
21. B. R. Rau. Iterative modulo scheduling. Technical Report HPL-94-115, Hewlett-Packard Laboratories, 1995.
22. L. Rauchwerger and D. Padua. The PRIVATIZING DOALL test: A run-time technique for DOALL loop identification and array privatization. In Proceedings of the 1994 ACM International Conference on Supercomputing, Manchester, England, 1994.
23. E. Salamí, J. Corbal, R. Espasa, and M. Valero. An evaluation of different dlp alternatives for the embedded media domain. 1st Workshop on Media Processors and DSPs, in conjunction with MICRO32, 1999.
24. P. Semiconductors. Trimedia tm-1300. Available at http://www-us3. semiconductors.com/trimedia/, 1999.
25. M. Shapiro and S. Horwitz. Fast and accurate flow-insensitive points-to analysis. In ACM Symposium on Principles of Programming Languages, pages 1-14, 1997.
26. TI. TMS320C62XX family. Technical Report .Available at http://www.ti.com/sc/docs/products/dsp/tms320c6201.html, Texas Instruments, 1999.
27. R. P. Wilson and M. S. Lam. Efficient context-sensitive pointer analysis for c programs. In ACM SIGPLAN Conference on Programming Language Design and Implementation, pages 1-, 1995.