正则数组设计中的代数变换

25th Annual International Computer Software and Applications Conference. COMPSAC 2001 Pub Date : 2001-10-08 DOI:10.1109/CMPSAC.2001.960647

T. P. Plaks

{"title":"正则数组设计中的代数变换","authors":"T. P. Plaks","doi":"10.1109/CMPSAC.2001.960647","DOIUrl":null,"url":null,"abstract":"Efficient parallelizing and mapping of algorithms onto regular arrays requires algebraic transformations. The paper considers the Iso-plane method for a class of algebraic transformations on the polytope model of algorithm. This method uses the partitioning of the ranges of loop indices in order to increase the dimensionality of the problem representation and a specific reordering of computations. As a result, the higher dimensional arrays with improved time complexity are produced.","PeriodicalId":269568,"journal":{"name":"25th Annual International Computer Software and Applications Conference. COMPSAC 2001","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2001-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Algebraic transformations in regular array design\",\"authors\":\"T. P. Plaks\",\"doi\":\"10.1109/CMPSAC.2001.960647\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Efficient parallelizing and mapping of algorithms onto regular arrays requires algebraic transformations. The paper considers the Iso-plane method for a class of algebraic transformations on the polytope model of algorithm. This method uses the partitioning of the ranges of loop indices in order to increase the dimensionality of the problem representation and a specific reordering of computations. As a result, the higher dimensional arrays with improved time complexity are produced.\",\"PeriodicalId\":269568,\"journal\":{\"name\":\"25th Annual International Computer Software and Applications Conference. COMPSAC 2001\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2001-10-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"25th Annual International Computer Software and Applications Conference. COMPSAC 2001\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CMPSAC.2001.960647\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"25th Annual International Computer Software and Applications Conference. COMPSAC 2001","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CMPSAC.2001.960647","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

有效的并行化和映射算法到正则数组需要代数变换。本文研究了算法多面体模型上一类代数变换的等平面方法。该方法使用循环索引范围的划分，以增加问题表示的维数，并对计算进行特定的重新排序。从而产生了具有改进时间复杂度的高维数组。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Algebraic transformations in regular array design

Efficient parallelizing and mapping of algorithms onto regular arrays requires algebraic transformations. The paper considers the Iso-plane method for a class of algebraic transformations on the polytope model of algorithm. This method uses the partitioning of the ranges of loop indices in order to increase the dimensionality of the problem representation and a specific reordering of computations. As a result, the higher dimensional arrays with improved time complexity are produced.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

25th Annual International Computer Software and Applications Conference. COMPSAC 2001

自引率

0.00%

发文量