ECO: An empirical-based compilation and optimization system

Proceedings - International Parallel and Distributed Processing Symposium, IPDPS 2003

Volumn , Issue , 2003, Pages

  Baradaran, Nastaran ^a   Chame, Jacqueline ^a   Chen, Chun ^a   Diniz, Pedro ^a   Hall, Mary ^a   Lee, Yoon Ju ^a   Liu, Bing ^a   Lucas, Robert ^a  

^a UNIVERSITY OF SOUTHERN CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DISTRIBUTED PARAMETER NETWORKS; ECONOMIC AND SOCIAL EFFECTS; EMBEDDED SYSTEMS;

ACCURATE PERFORMANCE; APPLICATION PROGRAMMERS; EMPIRICAL TECHNIQUES; HISTORICAL INFORMATION; OPTIMIZATION SYSTEM; PARALLELISM AND LOCALITIES; PERFORMANCE PROBLEMS; TARGET ARCHITECTURES;

SHAPE MEMORY EFFECT;

EID: 84947242665     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IPDPS.2003.1213377     Document Type: Conference Paper

References (44)

1. V. Adve, R. Bagrodia, E. Deelman, T. Phan and R. Sakellariou. Compiler-Supported Simulation of Very Large Parallel Applications. In Proceedings of Supercomputing '99, Nov. 1999.
2. J. Auslander, M. Philipose, C. Chambers, S Eggers, and B. Bershad. Fast, effective dynamic compilation. In Proceedings of the 1996 ACM SIGPLAN Conference on Program Language Design and Implementation, ACM Press, May 1996.
3. D. Bacon et al. A compiler framework for restructuring data declaration to enhance cache and TLB effectiveness. In Proceedings of CASCON'94, Nov. 1994.
4. V. Bala, E. Duestervald, S. Banerjia. Dynamo: A Transparent Run-Time Optimization System. In Proceedings of the 2000 ACMSIGPLAN Conference on Programming Languages Design and Implementation, ACM Press, 2000, pp. 1-12.
5. J. Bilmes, K. Asanovic, C.-W. Chen, J. Demmel. Optimizing Matrix Multiply using PHiPAC: A Portable High-Performance ANSI-C Coding Methodology. In Proceedings of the 1997 ACMInternational Conference on Supercomputing, 1997.
6. F. Bodin, T. Kisuki, P. M. W. Knijnenburg, M. F. P. O'Boyle and E. Rohou. Iterative Compilation in a Non-Linear Optimization Space. In Proceedings of the Workshop on Profile and Feedback-Directed Optimization, Oct. 1998.
7. S. Carr, K. McKinley and K. Kennedy. Compiler Optimizations for Improving Cache Locality. In Proceedings of Supercomputing '92, November 1992.
8. S. Carr and K. Kennedy. Improving the Ratio of Memory Operations to Floating-Point Operations in Loops. In ACMTransactions on Programming Languages and Systems (TOPLAS), 15(3), pp 400-462, July 1994.
9. J. Chame and S. Moon. A tile selection algorithm for data locality and cache interference. In Proceedings of the 1999 ACM International Conference on Supercomputing, ACM Press, pp. 492-499, June 1999
10. S. Chatterjee, E. Parker, P. J. Hanlon, A. R. Lebeck. Exact Analysis of the Cache Behavior of Nested Loops. In Proceedings of the 2001 ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI'01), ACM Press, pp. 286-297, June 2001.
11. S. Coleman and K. McKinley. Tile size selection using cache organization and data layout. In Proceedings of the 1995 ACM SIGPLAN Conference on Programming Language Design and Implementation, pp. 279-290, ACM Press, June 1995.
12. K. Cooper, P. J. Schielke and D. Subramanian. Optimizing for reduced code space using genetic algorithms. In Proceedings of the 1999Worshop on Languages, Compilers and Tools for Embedded Systems (LCTES), May 1999.
13. K. Cooper, D. Subramanian and L. Torczon. Adaptive Optimizing Compilers for the 21st Century. Journal of Supercomputing, 2002.
14. A. Cox and R. Fowler. Adaptive cache coherency for detecting migratory shared data. In Proceedings of the 20th International Symposium on Computer Architecture (ISCA'93), ACM Press, May 1993.
15. P. Diniz and B. Liu. Selector: An Effective Technique for Adaptive Computing. To appear in Proceedings of the Forteenth Workshop on Languages and Compilers for Parallel Computing (LCPC'01).
16. P. Diniz and M. Rinard. Dynamic Feedback: An Effective Technique for Adaptive Computing. In Proceedings of the 1997 ACMSIGPLAN Conference on Program Language Design and Implementation, ACM Press, June 1997.
17. D. Engler. VCODE: A retargetable, extensible, very fast dynamic code generation system. In Proceedings of the 1996 ACM SIGPLAN Conference on Program Language Design and Implementation, ACM Press, June 1996.
18. M. Frigo. A Fast Fourier Transform Compiler. In Proceedings of the 1999 ACM SIGPLAN Conference on Programming Language Design and Implementation, ACM Press, June 1999.
19. S. Ghosh, M. Martonosi, and S. Malik. Cache miss equations: An analytical representation of cache misses. In Proceedings of the 1997 ACM International Conference on Supercomputing Vienna, Austria, July 1997.
20. S. Ghosh, M. Martonosi, and S. Malik. Precise miss analysis for program transformations with caches of arbitrary associativity. In Proceedings of the Eighth International Conference on Architectural Support for Programming Languages and Operating Systems, pages 228-239, ACM Press, New York, Oct. 1998.
21. E-J. Im and K. Yelick. Optimizing Sparse Matrix Computation for Register Reuse in SPARSITY. In Proceedings of the International Conference on Computational Science, special session on Architecture-Specific Performance Tuning, May 2001. To be published in Springer LNCS series.
22. M. Lam, E. Rothberg, and M. Wolf. The cache performance and optimization of blocked algorithms. In Proceedings of the Fourth International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS'91), pp. 63-74, ACM Press, April 1991.
23. P. Lee and M. Leone. Optimizing ML with run-time code generation. In Proceedings of the 1996 ACM Conference on Program Language Design and Implementation, ACMPress, June 1996.
24. S. Leung and J. Zahorjan. Improving the performance of runtime parallelization. In Proceedings of the Fourth ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, pp. 83-91, ACM Press, May 1993.
25. H. Massalin. Superoptimizer-A look at the smallest program. In Proceedings of the Second International Conference on Architectural Support for Programming Languages and Operating Systems, ACMPress, pp. 122-126, Apr. 1987.
26. J. Mellor-Crummey, R. Fowler, G. Marin and N. Tallent. HPCView: A Tool for Top-Down Analysis of Node Performance. In Journal of Supercomputing, 23, pp 81-104, 2002.
27. D. Mirkovic and S. L. Johnsson. Automatic Performance Tuning in the UHFFT Library. In Proceedings of the International Conference on Computational Science (ICCS'01), May 2001.
28. N. Mitchell, L. Carter, J. Ferrante, and K. Hgstedt. Quantifying the Multi-Level Nature of Tiling Interactions. In Proceedings of the Tenth International Workshop on Languages and Compilers for Parallel Computing (LCPC'91), Aug. 1991.
29. S. Moon and M. Hall. Evaluation of Predicated Array Data-Flow Analysis for Automatic Parallelization. In Proceedings of the 1999 ACM Symposium on Principles and Practice of Parallel Programming, ACM Press, May 1999
30. L. Rauchwerger and D. Padua. The LRPD test: speculative run-time parallelization of loop with privatization and reduction parallelization. In Proceedings of the 1995 ACM SIGPLAN Conference on Programming Language Design and Implementation, ACM Press, June 1995.
31. G. Rivera and C.-W. Tseng. Data transformations for eliminating conflict misses. In Proceedings of the 1998 ACM Conference on Programming Language Design and Implementation, pp. 34-49, ACM Press, June 1998.
32. G. Rivera and C.-W. Tseng. Eliminating conflict misses for high performance architectures. In Proceedings of the 1998 International Conference on Supercomputing, pp. 353-360, ACM Press, July 1998.
33. T. Romer, D. Lee, B. Bershad and J. Chen. Dynamic page mapping policies for cache conflict resolution on standard hardware. In Proceedings of the First USENIX Symposium on Operating Systems Design and Implementation, ACM Press, pp. 255-266, Nov. 1994.
34. R. Saavedra, S. Gaines, and M. Carlton. Characterizing the Performance Space of Shared Memory Computers Using Micro-Benchmarks. In Proceedings of Hot Interconnects 1993, August 1993.
35. R. Saavedra and D. Park. Improving the effectiveness of software prefetching with adaptive execution. In Proceedings of the 1996 International Conference on Parallel Architectures and Compilation Techniques, ACM Press, October 1996.
36. J. Saltz, H. Berryman and J. Wu. Multiprocessors and runtime compilation. Concurrency: Practice & Experience, 3(6):573-592, Dec. 1991.
37. O. Temam, C. Fricker, E. Granston, and W. Jalby. Cache performance analysis. APPARC deliverables PME2, Leiden University, July 1993.
38. O. Temam, E. Granston, and W. Jalby. To copy or not to copy: A compile-time technique for assessing when data copying should be used to eliminate cache conflicts. In Proceedings of Supercomputing '93, pp. 401-419, Portland, Oregon, Nov. 1993.
39. M. Voss and R. Eigenmann. High-Level Adaptive Program Optimization with ADAPT. In Proceedings of the 2001 ACM SIGPLAN Conference on Principles and Practice of Parallel Processing, ACM Press, June, 2001.
40. C. Whaley and J. Dongarra. Automatically tuned linear algebra software. In Proceedings of Supercomputing '98, 1998.
41. M. Wolf and M. Lam. A Data Locality Optimization Algorithm. In Proceedings of the 1991 ACM SIGPLAN Conference on Programming Language Design and Implementation, ACM Press, June 1991.
42. M. Wolfe. More iteration space tiling. In Proceedings of Supercomputing '89, pp. 655-664 Reno, Nevada, November 1989.
43. J. Xiong, J. Johnson, R. Johnson and D. Padua. SPL: A Language and Compiler for DSP Algorithms. In Proceedings of the 2001 ACM Conference on Programming Language Design and Implementation, ACM Press, June 2001.
44. Hao Yu and L. Rauchwerger. Adaptive Reduction Parallelization. In Proceedings of the 2000 International Conference on Supercomputing, ACM Press, May 2000.