Using algebraic transformations to optimize expression evaluation in scientific code

Parallel Architectures and Compilation Techniques - Conference Proceedings, PACT

Volumn , Issue , 1998, Pages 376-384

  Zory, Julien ^a   Coelho, Fabien ^a  

^a PSL RESEARCH UNIVERSITY   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; EMBEDDED SYSTEMS; PATTERN MATCHING;

ALGEBRAIC TRANSFORMATIONS; ASSOCIATIVE-COMMUTATIVE; COMBINATORIAL EXPLOSION; EQUIVALENT EXPRESSION; INSTRUCTION LEVEL PARALLELISM; PATTERN-MATCHING TECHNIQUE; PERFORMANCE ENHANCING; PERFORMANCE IMPROVEMENTS;

PARALLEL ARCHITECTURES;

EID: 84907993593     PISSN: 1089795X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/PACT.1998.727284     Document Type: Conference Paper

References (18)

1. A. V. Aho, R. Sethi, and J. D. Ullman. Compilers Principles, Techniques, and Tools. Addison-Wesley Publishing Company, 1986.
2. ANSI. American National Standard Programming Language Fortran 77, ANSI x3.9-1978, ISO 1539-1980. New-York, 1983.
3. ANSI. Rationale for American National Standard for Information Systems, Programming Language, C. included in ANSI X3.159-1989, 1989.
4. F. Baccelli, G. Cohen, G. J. Olsder, and J.-P. Quadrat. Synchronization and Linearity, chapter Max-Plus Algebra, pages 103-154. Wiley, 1992.
5. L. Bachmair, T. Chen, and I. V. Ramakrishnan. Associativecommutative discrimination nets. In International Joint Conference on Theory And Practice of Software Development, pages 61-74, Apr. 1993.
6. P. Baudin and J. Raguideau. CAVEAT Algebraic Simplification Rules. Technical Report 0.2.1-7, Commissariat À l'énergie Atomique-Département d'électronique et d'Instrumentation Nucléaire, Dec. 1996.
7. J. Bayko. Great Microprocessors of the Past and Present (V 10.11). http://www.cs.uregina.ca/-bayco/ design/design.html,Mar. 1998.
8. D. Benanav, D. Kapur, and P. Narendran. Complexity of matching problems. Journal of Symbolic Computation, 3:203-216, 1987.
9. T. Chen and S. Anantharaman. STORM: A Many-to-one Associative-Commutative Matcher. Lecture Notes in Computer Science, 914:414-419, 1995.
10. J.-F. Colonna. The Subjectivity of Computers. Communications of the ACM, 36(8), Aug. 1993.
11. G. Erickson. RISC for Graphics: A Survey and Analysis of Multimedia Extended Instruction Set Architectures. Electrical Engineering 8362, Dept. of Elec. Eng., University of Minnesota, Dec. 1996.
12. R. Hartley. Subexpression Sharing in Filters Using Canonic Signed Digit Multipliers. IEEE Circuits and Systems-Part II: Analog and Digital Signal Processing Transactions, 43(10), Oct. 1996.
13. HPF Forum. High Performance Fortran Language Specification. Rice University, Houston, Texas, Nov. 1996. version 2.0.
14. ISO/IEC. Fortran 90 International Standard ISO/IEC 1539:1991 (E), second 1991-07-01 edition, 1991.
15. R. M. Karp. Reducibility among combinatorial problems. Complexity of Computer Computations, pages 85-103, 1972.
16. D. J. Kuck and K. Maruyama. Time Bounds on the Parallel Evaluation of Arithmetic Expressions. SIAM Journal of Computing, 4(2):147-162, 1975.
17. Kuck and Associates. KAP for IBM Fortran-User Guide, 3.3 edition, 1996.
18. K. K. Parhi. High-Level Algorithm and Architecture Transformations for DSP Synthesis. Journal of VLSI Signal Processing, 9:121-143, 1995.