{"title":"非均匀依赖嵌套循环的区域划分方法","authors":"S. Jeong, Mann-Ho Lee","doi":"10.1109/TENCON.1999.818447","DOIUrl":null,"url":null,"abstract":"Many methods have been proposed in order to parallelize loops with non-uniform dependences, but most of these approaches perform poorly due to irregular and complex dependence constraints. Our approach is based on the convex hull theory which has adequate information to handle non-uniform dependences. By parallelizing the anti-dependence region using variable renaming, we divide the iteration space into two parallel regions and one or less sequential region. This paper proposes an improved region partitioning method (IRP) for minimizing the size of the sequential region. Comparison with other schemes shows more parallelism than the existing techniques.","PeriodicalId":121142,"journal":{"name":"Proceedings of IEEE. IEEE Region 10 Conference. TENCON 99. 'Multimedia Technology for Asia-Pacific Information Infrastructure' (Cat. No.99CH37030)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1999-09-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Region partitioning method of nested loops with non-uniform dependences\",\"authors\":\"S. Jeong, Mann-Ho Lee\",\"doi\":\"10.1109/TENCON.1999.818447\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Many methods have been proposed in order to parallelize loops with non-uniform dependences, but most of these approaches perform poorly due to irregular and complex dependence constraints. Our approach is based on the convex hull theory which has adequate information to handle non-uniform dependences. By parallelizing the anti-dependence region using variable renaming, we divide the iteration space into two parallel regions and one or less sequential region. This paper proposes an improved region partitioning method (IRP) for minimizing the size of the sequential region. Comparison with other schemes shows more parallelism than the existing techniques.\",\"PeriodicalId\":121142,\"journal\":{\"name\":\"Proceedings of IEEE. IEEE Region 10 Conference. TENCON 99. 'Multimedia Technology for Asia-Pacific Information Infrastructure' (Cat. No.99CH37030)\",\"volume\":\"3 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1999-09-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of IEEE. IEEE Region 10 Conference. TENCON 99. 'Multimedia Technology for Asia-Pacific Information Infrastructure' (Cat. No.99CH37030)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/TENCON.1999.818447\",\"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 of IEEE. IEEE Region 10 Conference. TENCON 99. 'Multimedia Technology for Asia-Pacific Information Infrastructure' (Cat. No.99CH37030)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/TENCON.1999.818447","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Region partitioning method of nested loops with non-uniform dependences
Many methods have been proposed in order to parallelize loops with non-uniform dependences, but most of these approaches perform poorly due to irregular and complex dependence constraints. Our approach is based on the convex hull theory which has adequate information to handle non-uniform dependences. By parallelizing the anti-dependence region using variable renaming, we divide the iteration space into two parallel regions and one or less sequential region. This paper proposes an improved region partitioning method (IRP) for minimizing the size of the sequential region. Comparison with other schemes shows more parallelism than the existing techniques.