Interprocedural induction variable analysis

Peiyi Tang, Pen Chung Yew

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Scopus citations

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 languageEnglish (US)
Title of host publicationProceedings - International Symposium on Parallel Architectures, Algorithms and Networks, I-SPAN 2002
EditorsD. Frank Hsu, Rafael P. Saldana, Oscar H. Ibarra
PublisherIEEE Computer Society
Pages245-250
Number of pages6
ISBN (Electronic)0769515797
DOIs
StatePublished - 2002
EventInternational Symposium on Parallel Architectures, Algorithms and Networks, I-SPAN 2002 - Makati, Manila, Philippines
Duration: May 22 2002May 24 2002

Publication series

NameProceedings of the International Symposium on Parallel Architectures, Algorithms and Networks, I-SPAN
Volume2002-January

Other

OtherInternational Symposium on Parallel Architectures, Algorithms and Networks, I-SPAN 2002
CountryPhilippines
CityMakati, Manila
Period5/22/025/24/02

Keywords

  • Algorithm design and analysis
  • Computer science
  • Parallel architectures
  • Program processors
  • Testing

Fingerprint Dive into the research topics of 'Interprocedural induction variable analysis'. Together they form a unique fingerprint.

Cite this