{"title":"Polybench核映射到HPC CGRAs的分析","authors":"M. Weinhardt","doi":"10.1109/IPDPSW55747.2022.00114","DOIUrl":null,"url":null,"abstract":"This paper presents a detailed analysis of Mapping the Polybench C 4.2.1 kernels to Coarse-Grain Reconfigurable Arrays (CGRAs), targeting High-Performance Computing (HPC). The results show that the Polybench kernels are well suited for acceleration on a CGRA due to their regular array accesses. However, seperately mapping the innermost loops of the Polybench kernels to a CGRA yields only limited speedups because the small size of the generated dataflow graphs limits the available parallelism and results in a low computational intensity. Therefore, loop transformations which will increase the parallelism and the speedups are suggested. While this work focuses on a specific CGRA and its compiler, the observations and conclusions are also transferable to other CGRAs and their compilers.","PeriodicalId":286968,"journal":{"name":"2022 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"An Analysis of Mapping Polybench Kernels to HPC CGRAs\",\"authors\":\"M. Weinhardt\",\"doi\":\"10.1109/IPDPSW55747.2022.00114\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents a detailed analysis of Mapping the Polybench C 4.2.1 kernels to Coarse-Grain Reconfigurable Arrays (CGRAs), targeting High-Performance Computing (HPC). The results show that the Polybench kernels are well suited for acceleration on a CGRA due to their regular array accesses. However, seperately mapping the innermost loops of the Polybench kernels to a CGRA yields only limited speedups because the small size of the generated dataflow graphs limits the available parallelism and results in a low computational intensity. Therefore, loop transformations which will increase the parallelism and the speedups are suggested. While this work focuses on a specific CGRA and its compiler, the observations and conclusions are also transferable to other CGRAs and their compilers.\",\"PeriodicalId\":286968,\"journal\":{\"name\":\"2022 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW)\",\"volume\":\"22 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-05-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2022 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IPDPSW55747.2022.00114\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IPDPSW55747.2022.00114","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
摘要
本文以高性能计算(HPC)为目标,详细分析了将Polybench C 4.2.1内核映射到粗粒度可重构阵列(CGRAs)的方法。结果表明,Polybench内核由于其常规的数组访问,因此非常适合在CGRA上进行加速。然而,单独将Polybench内核的最内层循环映射到CGRA只会产生有限的加速,因为生成的数据流图的小尺寸限制了可用的并行性并导致低计算强度。因此,建议使用循环变换来增加并行性和加速。虽然这项工作的重点是特定的CGRA及其编译器,但观察结果和结论也可转移到其他CGRA及其编译器。
An Analysis of Mapping Polybench Kernels to HPC CGRAs
This paper presents a detailed analysis of Mapping the Polybench C 4.2.1 kernels to Coarse-Grain Reconfigurable Arrays (CGRAs), targeting High-Performance Computing (HPC). The results show that the Polybench kernels are well suited for acceleration on a CGRA due to their regular array accesses. However, seperately mapping the innermost loops of the Polybench kernels to a CGRA yields only limited speedups because the small size of the generated dataflow graphs limits the available parallelism and results in a low computational intensity. Therefore, loop transformations which will increase the parallelism and the speedups are suggested. While this work focuses on a specific CGRA and its compiler, the observations and conclusions are also transferable to other CGRAs and their compilers.