{"title":"程序间诱导变量分析","authors":"P. Tang, P. Yew","doi":"10.1109/ISPAN.2002.1004289","DOIUrl":null,"url":null,"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.","PeriodicalId":255069,"journal":{"name":"Proceedings International Symposium on Parallel Architectures, Algorithms and Networks. I-SPAN'02","volume":"15 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2002-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Interprocedural induction variable analysis\",\"authors\":\"P. Tang, P. Yew\",\"doi\":\"10.1109/ISPAN.2002.1004289\",\"DOIUrl\":null,\"url\":null,\"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.\",\"PeriodicalId\":255069,\"journal\":{\"name\":\"Proceedings International Symposium on Parallel Architectures, Algorithms and Networks. I-SPAN'02\",\"volume\":\"15 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2002-08-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings International Symposium on Parallel Architectures, Algorithms and Networks. I-SPAN'02\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISPAN.2002.1004289\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings International Symposium on Parallel Architectures, Algorithms and Networks. I-SPAN'02","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISPAN.2002.1004289","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
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.