| 算法的相关性变换与划分带个数的关系 |
| |
| 引用本文： | 王树义.算法的相关性变换与划分带个数的关系[J].大连理工大学学报,1995,35(3):422-424. |
| |
| 作者姓名： | 王树义 |
| |
| 作者单位： | 大连理工大学计算机科学与工程系 |
| |
| 摘 要： | 使用相关性变换法，划分并映射循环算法到具有固定尺寸的Ｓｙｓｔｏｌｉｃ阵列。下标集合被划分成若干条带，划分带的条数与变换后的Ｓｙｓｔｏｌｉｃ阵列算法的执行时间成正比。指出了Ｍｏｌｄｏｖａｎ给出的计算划分带条数的公式有很大局限性，给出了由空间变换计算划分带条数的方法。
|
| 关 键 词： | 算法 算法变换 算法划分 相关性变换 划分带 |
Relation between data dependency transformation and number of partitioning bands |
| |
| Wang Shuyi.Relation between data dependency transformation and number of partitioning bands[J].Journal of Dalian University of Technology,1995,35(3):422-424. |
| |
| Authors: | Wang Shuyi |
| |
| Abstract: | Using Data Dependency Method for partitioning and mapping algorithms into VLSIsystolic arrays,index set of algorithms must be partitioned into several bands.The processingtime of partitioned algorithm is proportional to the number of bands.The paper shows that theformula for computing the number of bands given by Moldovan is not correct and a method forcomputing it is presented by means of space transformation. |
| |
| Keywords: | algorithms very large scale integrated circuits/algorithm transformation algorithm partition |
| 本文献已被 CNKI 维普 等数据库收录！ |
