Architecture synthesis for application specified parallel computers

通过对应用程序的分析，研究了静态可重构处理器间网络连接拓扑结构的构成方法。提出了一种处理单元模型的网络生成和并行程序生成算法。该算法是作为一个网络生成系统实现的。本研究开发的网络生成系统包含一个用C语言编写的应用程序、多个PE和一个PE的多个连接端口。将收到的应用程序划分为多个操作，并将这些操作分配给pe并进行调度。pe间通信链路是根据数据交换量和执行时间生成的。调度过程在重复两次以细化生成的网络和任务分配。最后，系统生成pe间链路信息，并根据生成的pe间链路在并行计算机上执行并行程序。通过网络生成系统，生成了网络和并行程序，并给出了一些示例程序。这些网络和程序在并行计算机模拟器上进行了评估。结果表明，采用SOR方案的泊松解算器在生成的网络上比传统的常规网络（如最近邻连接）运行得更快。FFT程序的另一个结果显示了使用生成系统的类似好处。实验还表明，对于具有不平衡结构的并联程序，本文导出的系统具有更高的效率。

A method is studied for composing the connection topology of statically reconfigurable inter-processor networks by analyzing application programs. An algorithm to generate networks and parallel programs for a PE (Processing Element) model is presented. This algorithm is realized as a network generation system.The network generation system developed by this research receives an application program written in C language, a number of PE, and a number of connection ports a PE. The received application program is divided into operations and the operations are assigned to PEs and scheduled. Inter-PE communication links are generated based on the amount of data exchange and execution time. Scheduling process in repeated twice to refine the generated network and task assignment. Finally, the system produces an inter-PE link information and a paralleled program to be executed on the parallel computer with the generated inter-PE link.By the network generation system, networks and paralleled programs are generated with some sample programs. These networks and programs are evaluated on a parallel computer simulator.As a result, the Poisson solver with SOR scheme runs faster on the generated network than conventional regular networks such as the nearest neighbor connection. Another result for the FFT program shows similar benefits using the generation system. These experiments also show the system derived here is more efficient for the case of a paralleled program with unbalance structure.