Programming environment for phase-reconfigurable parallel programming on SuperNode

[1992] Proceedings of the Fourth IEEE Symposium on Parallel and Distributed Processing Pub Date : 1992-12-01 DOI:10.1109/SPDP.1992.242710

J. Adamo, L. Trejo

引用次数: 9

Abstract

The authors present a programming environment called C-NET developed for the reconfigurable SuperNode multiprocessor. It allows the implementation of variable-topology programs that are referred to as phase-reconfigurable programs. The design decisions concerning dynamic-reconfiguration handling are discussed with regard to the architectural constraints of the machine. It provides three specialized languages: PPL (phase programming language), for the development of phase-reconfigurable programs: GCL (graph-construction language), for the construction of graphs on which the phases are to be executed; and CPL components programming language), for coding the software components. The first example on which the programming environment was tested was the conjugate-gradient (CG) algorithm. The results are encouraging. Phase-reconfigurable implementation of CG was developed and compared with a fixed topology implementation (8*4 torus).<>

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

基于SuperNode的相位可重构并行编程环境

作者提出了一种为可重构SuperNode多处理器开发的编程环境C-NET。它允许实现可变拓扑程序，称为相位可重构程序。根据机器的结构约束，讨论了动态重构处理的设计决策。它提供了三种专门的语言:PPL(阶段编程语言)，用于开发阶段可重构程序;GCL(图形构造语言)，用于构造要执行阶段的图形;以及CPL组件编程语言)，用于对软件组件进行编码。对编程环境进行测试的第一个例子是共轭梯度(CG)算法。结果令人鼓舞。开发了CG的相位可重构实现，并与固定拓扑实现(8*4环面)进行了比较。

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

求助全文

约1分钟内获得全文去求助

来源期刊

[1992] Proceedings of the Fourth IEEE Symposium on Parallel and Distributed Processing

自引率

0.00%

发文量

期刊最新文献

On uniformization of affine dependence algorithms On embedding ternary trees into Boolean hypercubes A divide and conquer approach to shortest paths in planar layered digraphs Advanced software pipelining and the program dependence graph A fast sort using parallelism within memory