Architecture synthesis for application specified parallel computers

通过对应用程序的分析，研究了一种构造可静态重构处理器间网络连接拓扑的方法。提出了一种为处理单元(PE)模型生成网络和并行程序的算法。该算法被实现为一个网络生成系统，该研究开发的网络生成系统接收一个用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.