Study on High-Level Programming Environments for Supercomputing (1991)

超级计算高级编程环境研究（1991）

• 批准号: 02650271
• 负责人: SHIMASAKI Masaaki
• 金额: $ 1.86万
• 依托单位: Kyushu University
• 依托单位国家: 日本
• 项目类别: Grant-in-Aid for General Scientific Research (C)
• 财政年份: 1990
• 资助国家: 日本
• 起止时间: 1990 至 1991
• 项目状态: 已结题
• 来源: https://kaken.nii.ac.jp/grant/KAKENHI-PROJECT-02650271/
• 关键词: Supercomputers; Parallel processing; Programming; Scheduling; LINDA; Visualization; Fractal; Quaternion; プログラム開発支援環境; ライブラリ-パッケ-ジ; ビジュアリゼ-ション; 四元数; コンピュ-タグラフィクス; レイトレ-シング

Problems of programming environments for supercomputing were investigated from the view points : (1) programming languages and processors, (2) mathematical libraries, (3) visualization and computer graphics. Parallel processing is considered important for supercomputers in the next generation. At present, the state of art for programming environment of parallel processors is very primitive. Processor scheduling plays an important role in parallel processing to attain high performance. In order to attain high performance for a single program, it is necessary that a compiler selects an adequate scheduling algorithm. We proposed new scheduling algorithms, called 1 )the static/dynamic merged algorithm, and 2 )the modified GSS which is extended to cope with IF statements in the loop for parallel execution. We have developed an experimental parallel C compiler for 4 RISC CPU's workstation with the new scheduling algorithm. Besides memory shared multiprocessors, it is considered that distributed memory machines also play an important role in the next generation of supercomputing. We proposed an extension to LINDA language in this context. As far as visualization and computer graphics are concerned, we investigated fractals in quaternions and its application to computer graphics, It is shown that self contraction mapping functions in quaternions can generate useful tree patterns in the 3 dimensional space.

从以下角度研究了超级计算的编程环境问题：（1）编程语言和处理器，（2）数学库，（3）可视化和计算机图形学。并行处理被认为对于下一代超级计算机很重要。目前，并行处理器编程环境的技术水平还很原始。处理器调度在并行处理以获得高性能方面起着重要作用。为了使单个程序获得高性能，编译器有必要选择适当的调度算法。我们提出了新的调度算法，称为 1）静态/动态合并算法，以及 2）改进的 GSS，它被扩展以处理循环中的 IF 语句以进行并行执行。我们为4个RISC CPU的工作站开发了一个实验性的并行C编译器，采用了新的调度算法。除了内存共享多处理器之外，分布式内存机也被认为在下一代超级计算中发挥着重要作用。在此背景下，我们提出了 LINDA 语言的扩展。就可视化和计算机图形学而言，我们研究了四元数中的分形及其在计算机图形学中的应用，结果表明四元数中的自收缩映射函数可以在3维空间中生成有用的树模式。

项目成果

Sato Hiroyuki, Shimasaki Masaaki: "Communication in Linda/Q -Datatypes and Unification-" Proc. 1991 Int. Conf. on Parallel Processing. 219-226 (1991)

Sato Hiroyuki、Shimasaki Masaaki：“Linda/Q 中的通信 - 数据类型和统一 -”Proc。

Masaaki Shimasaki et al: "Fractals in Quaternions and their Application to Computer Graphics" IFIP Working Conference on Programming Environments for High-Level Scientific Problem Solving. 61-70 (1991)

Masaaki Shimasaki 等人：“四元数中的分形及其在计算机图形学中的应用”IFIP 高级科学问题解决编程环境工作会议。

Masaki Shimasaki,Yasuhiro Matsusaka,Masanobu Nomura: "Fractals in Quaternions and their Application to Computer Graphics" IFIP WG2.5 A working Conference on Programming,Environmonts for HighーLevel Scientific Problem Solving. (1991)

Masaki Shimasaki、Yasuhiro Matsusaka、Masanobu Nomura：“四元数中的分形及其在计算机图形学中的应用” IFIP WG2.5 编程工作会议，高级科学问题解决环境（1991 年）。

Sato Hiroyuki,Shimasaki Masaaki: "Communication in Lindal Q ーDatatypes and Unificationー" Proc.1991 International Conference on Parallel Processing. II. 219-226 (1991)

Sato Hiroyuki、Shimasaki Masaaki：“Lindal Q 中的通信 - 数据类型和统一”Proc.1991 国际并行处理会议 II (1991)。

松延 栄治,入江 啓一,島崎 眞昭: "ネットワ-ク仮想端末FNVTの機能強化および実験について" 平成2年度電気関係学会九州支部連合大会 558. (1990)

Eiji Matsunobu、Keiichi Irie、Masaaki Shimazaki：“网络虚拟终端FNVT的功能增强和实验”1990年日本电气工程师协会九州分会558。（1990）