Abstract
Induction variable analysis is an important part of the symbolic analysis in parallelizing compilers. Induction variables can be formed by FOR or DO loops within procedures or loops of recursive procedure calls. This paper presents an algorithm to find induction variables in formal parameters of procedures caused by recursive procedure calls. The compile-time knowledge of induction variables in formal parameters is essential to summarize array sections to be used for data dependency testing and parallelization.
Original language | English (US) |
---|---|
Title of host publication | Proceedings - International Symposium on Parallel Architectures, Algorithms and Networks, I-SPAN 2002 |
Editors | D. Frank Hsu, Rafael P. Saldana, Oscar H. Ibarra |
Publisher | IEEE Computer Society |
Pages | 245-250 |
Number of pages | 6 |
ISBN (Electronic) | 0769515797 |
DOIs | |
State | Published - 2002 |
Event | International Symposium on Parallel Architectures, Algorithms and Networks, I-SPAN 2002 - Makati, Manila, Philippines Duration: May 22 2002 → May 24 2002 |
Publication series
Name | Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks, I-SPAN |
---|---|
Volume | 2002-January |
Other
Other | International Symposium on Parallel Architectures, Algorithms and Networks, I-SPAN 2002 |
---|---|
Country/Territory | Philippines |
City | Makati, Manila |
Period | 5/22/02 → 5/24/02 |
Bibliographical note
Publisher Copyright:© 2002 IEEE.
Keywords
- Algorithm design and analysis
- Computer science
- Parallel architectures
- Program processors
- Testing