Simon Schulz, O. Bringmann, Thomas Schweizer, W. Rosenstiel
{"title":"旋转并行映射:一种在CGRAs上映射数据并行应用程序的新方法","authors":"Simon Schulz, O. Bringmann, Thomas Schweizer, W. Rosenstiel","doi":"10.1109/ReConFig.2014.7032554","DOIUrl":null,"url":null,"abstract":"In this paper we present a new way of mapping data-parallel applications on coarse-grained reconfigurable architectures (CGRAs) to increase their performance. Traditional mapping approaches aim to map an application to a minimum number of contexts. In this work we gave up this idea. We propose to use the temporal domain with multiple contexts, as the preferred mapping domain. The benefit of this approach is that enough free resources are made accessible for a parallel execution of a datapath, which enables a higher utilization of a CGRA's resources, and thus a performance increase can be achieved. To show the validity of the proposed method, the speedup of various applications is evaluated using both, theoretical and experimental studies. The results show a performance improvement of up to 122% when compared to traditional application mapping techniques.","PeriodicalId":137331,"journal":{"name":"2014 International Conference on ReConFigurable Computing and FPGAs (ReConFig14)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Rotated parallel mapping: A novel approach for mapping data parallel applications on CGRAs\",\"authors\":\"Simon Schulz, O. Bringmann, Thomas Schweizer, W. Rosenstiel\",\"doi\":\"10.1109/ReConFig.2014.7032554\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper we present a new way of mapping data-parallel applications on coarse-grained reconfigurable architectures (CGRAs) to increase their performance. Traditional mapping approaches aim to map an application to a minimum number of contexts. In this work we gave up this idea. We propose to use the temporal domain with multiple contexts, as the preferred mapping domain. The benefit of this approach is that enough free resources are made accessible for a parallel execution of a datapath, which enables a higher utilization of a CGRA's resources, and thus a performance increase can be achieved. To show the validity of the proposed method, the speedup of various applications is evaluated using both, theoretical and experimental studies. The results show a performance improvement of up to 122% when compared to traditional application mapping techniques.\",\"PeriodicalId\":137331,\"journal\":{\"name\":\"2014 International Conference on ReConFigurable Computing and FPGAs (ReConFig14)\",\"volume\":\"14 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 International Conference on ReConFigurable Computing and FPGAs (ReConFig14)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ReConFig.2014.7032554\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 International Conference on ReConFigurable Computing and FPGAs (ReConFig14)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ReConFig.2014.7032554","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Rotated parallel mapping: A novel approach for mapping data parallel applications on CGRAs
In this paper we present a new way of mapping data-parallel applications on coarse-grained reconfigurable architectures (CGRAs) to increase their performance. Traditional mapping approaches aim to map an application to a minimum number of contexts. In this work we gave up this idea. We propose to use the temporal domain with multiple contexts, as the preferred mapping domain. The benefit of this approach is that enough free resources are made accessible for a parallel execution of a datapath, which enables a higher utilization of a CGRA's resources, and thus a performance increase can be achieved. To show the validity of the proposed method, the speedup of various applications is evaluated using both, theoretical and experimental studies. The results show a performance improvement of up to 122% when compared to traditional application mapping techniques.