{"title":"在非相邻和不完全嵌套循环中改进循环交换的进一步结果","authors":"Tsung-Chuan Huang, Cheng-Ming Yang","doi":"10.1109/HIPS.1998.665147","DOIUrl":null,"url":null,"abstract":"Loop interchange is a powerful restructuring technique for supporting vectorization and parallelization. We propose an improved technique to determine whether loops can be interchanged between two non adjacent loops. We also present a method for determining whether we can directly make loop interchange on an imperfectly nested loop. Some experimental results are also presented to show the effectiveness of the method.","PeriodicalId":179985,"journal":{"name":"Proceedings Third International Workshop on High-Level Parallel Programming Models and Supportive Environments","volume":"5 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1998-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Further results for improving loop interchange in non-adjacent and imperfectly nested loops\",\"authors\":\"Tsung-Chuan Huang, Cheng-Ming Yang\",\"doi\":\"10.1109/HIPS.1998.665147\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Loop interchange is a powerful restructuring technique for supporting vectorization and parallelization. We propose an improved technique to determine whether loops can be interchanged between two non adjacent loops. We also present a method for determining whether we can directly make loop interchange on an imperfectly nested loop. Some experimental results are also presented to show the effectiveness of the method.\",\"PeriodicalId\":179985,\"journal\":{\"name\":\"Proceedings Third International Workshop on High-Level Parallel Programming Models and Supportive Environments\",\"volume\":\"5 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1998-03-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings Third International Workshop on High-Level Parallel Programming Models and Supportive Environments\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/HIPS.1998.665147\",\"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 Third International Workshop on High-Level Parallel Programming Models and Supportive Environments","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/HIPS.1998.665147","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Further results for improving loop interchange in non-adjacent and imperfectly nested loops
Loop interchange is a powerful restructuring technique for supporting vectorization and parallelization. We propose an improved technique to determine whether loops can be interchanged between two non adjacent loops. We also present a method for determining whether we can directly make loop interchange on an imperfectly nested loop. Some experimental results are also presented to show the effectiveness of the method.