Parallel Computations on Reconfigurable Meshes
Parallel Computations on Reconfigurable Meshes
复制标题
可重构网格的并行计算
DOI：
10.1109/12.277290
复制
发表时间：
1993
期刊：
影响因子：
--
通讯作者：
Q. Stout
中科院分区：
文献类型：
--
作者：
Russ Miller;V. Prasanna;D. Reisis;Q. Stout
具有可重构总线的网格被提出作为计算模型。可重新配置的网格捕获了来自各种来源的显着特征，包括 CAAPP、CHiP、多态环面网络和总线自动化。它由通过可重构总线系统互连的处理器阵列组成，可用于动态获取处理器之间的各种互连模式。介绍了可重构网格的各种基本数据移动操作。基于这些操作，还介绍了有效解决涉及图形和数字化图像的各种问题的算法。该算法渐近优于先前针对上述可重构架构获得的算法，以及先前针对网格、具有多个广播的网格、具有多个总线的网格、树状网格和金字塔计算机获得的算法。通过在可重构网格上比在可编程随机存取存储器 (PRAM) 上更有效地解决一些问题（例如异或）来说明可重构性的威力。 >
The mesh with reconfigurable bus is presented as a model of computation. The reconfigurable mesh captures salient features from a variety of sources, including the CAAPP, CHiP, polymorphic-torus network, and bus automation. It consists of an array of processors interconnected by a reconfigurable bus system that can be used to dynamically obtain various interconnection patterns between the processors. A variety of fundamental data-movement operations for the reconfigurable mesh are introduced. Based on these operations, algorithms that are efficient for solving a variety of problems involving graphs and digitized images are also introduced. The algorithms are asymptotically superior to those previously obtained for the aforementioned reconfigurable architectures, as well as to those previously obtained for the mesh, the mesh with multiple broadcasting, the mesh with multiple buses, the mesh-of-trees, and the pyramid computer. The power of reconfigurability is illustrated by solving some problems, such as the exclusive OR, more efficiently on the reconfigurable mesh than is possible on the programmable random-access memory (PRAM). >