Advanced copy propagation for arrays

ACM SIGPLAN Notices

Volumn 38, Issue 7, 2003, Pages 24-33

  Vanbroekhoven, Peter ^a   Janssens, Gerda ^a   Bruynooghe, Maurice ^a   Corporaal, Henk ^b   Catthoor, Francky ^b  

^a UNIVERSITY OF LEUVEN   (Belgium)

^b IMEC   (Belgium)

Author keywords

Arrays; Copy propagation; Optimization; Single assignment

Indexed keywords

ALGORITHMS; DATA PROCESSING; DATA STRUCTURES; MULTIMEDIA SYSTEMS; OPTIMIZATION; RESPONSE TIME (COMPUTER SYSTEMS); SOFTWARE PROTOTYPING; STORAGE ALLOCATION (COMPUTER);

COPY PROPAGATION; SINGLE ASSIGNMENT;

PROGRAM COMPILERS;

EID: 1442313358     PISSN: 03621340     EISSN: None     Source Type: Journal    
DOI: 10.1145/780731.780736     Document Type: Conference Paper

References (18)

1. A. V. Aho, R. Sethi, and J. D. Ullman. Compilers: Principles, Techniques and Tools. Addison-Wesley, Inc., 1986.
2. U. Banerjee. Dependence testing in ordinary programs. Master's thesis, Dept. of Comp. Sci., Univ. of Illinois, Nov. 1976.
3. F. Catthoor, S. Wuytack, E. De Greef, F. Balasa, L. Nachtergaele, and A. Vandecappelle. Custom Memory Management Methodology: Exploration of Memory Organisation for Embedded Multimedia System Design. Kluwer Academic Publishers, 1998.
4. K. Danckaert. Loop transformations for data transfer and storage reduction on multiprocessor systems. PhD thesis, K.U. Leuven, 2001.
5. E. De Greef, F. Catthoor, and H. De Man. Memory size reduction through storage order optimization for embedded parallel multimedia applications. In Proceedings of the Workshop on Parallel Processing and Multimedia of the International Parallel Processing Symposium, pages 84-98, 1997.
6. P. Feautrier. Dataflow analysis of array and scalar references. International Journal of Parallel Programming, 20(1):23-53, 1991.
7. M. W. Hall, J. M. Anderson, S. P. Amarasinghe, B. R. Murphy, S.-W. Liao, E. Bugnion, and M. S. Lam. Maximizing multiprocessor performance with the suif compiler. In IEEE Computer, December 1996.
8. J. Hennessy and D. Patterson. Computer Architecture: A Quantitative Approach. Morgan Kaufmann Publishers, San Francisco, CA, 1996.
9. B. Kienhuis. Matparser: An array dataflow analysis compiler. Technical report, University of California, Berkeley, February 2000.
10. J. Knoop, O. Ruthing, and B. Steffen. Partial dead code elimination. In SIGPLAN Conference on Programming Language Design and Implementation, pages 147-158, 1994.
11. H. Kung and C. Leiserson. Systolic arrays for VLSI. In Sparse Matrix Proceedings, pages 245-282, Philadelphia:SIAM, 1978.
12. S. Muchnick. Advanced compiler design & implementation. Morgan Kaufmann Publishers, San Francisco, CA, 1997.
13. W. Pugh. The Omega test: A fast and practical integer programming algorithm for dependence analysis. In Proceedings of Supercomputing '91, Albuquerque, NM, 1991.
14. F. Quilleré and S. Rajopadhye. Optimizing memory usage in the polyhedral model. ACM Transactions on Programming Languages, 22(5):773-815, September 2000.
15. P. Quinton, S. Rajopadhye, and T. Risset. On manipulating Z-polyhedra. Technical report, Institut de Recherche en Informatique et Systemes Aleatoires, 1996.
16. L. Thiele and U. Artz. On the synthesis of massively parallel architectures. International journal of high speed electronics and systems, 4(2):99-131, 1993.
17. R. Tronçon, M. Bruynooghe, G. Janssens, and F. Catthoor. Storage size reduction by in-place mapping of arrays. In A. Cortesi, editor, Verification, Model Checking and Abstract Interpretation, Third Int. Workshop, MCAI 2002, Revised Papers, volume 2294 of LNCS, pages 167-181. Springer-Verlag, 2002.
18. M. Wegman and K. Zadeck. Constant propagation with conditional branches. ACM Transactions on Programming Languages and Systems, 13(2):181-210, April 1991.