A preceding activation scheme with graph unfolding for the parallel processing system-array

Authors:
H. Yamana;T. Hagiwara;J. Kohdate;Y. Muraoka
Affiliations:
School of Science and Engineering, Waseda University, c/o Prof. Yoichi MURAOKA, 3-4-1, Okubo, Shinjuku-ku, Tokyo, 169 JAPAN;NEC Corp., Tokyo, JAPAN;NEC Corp., Tokyo, JAPAN;NEC Corp., Tokyo, JAPAN
Venue:
Proceedings of the 1989 ACM/IEEE conference on Supercomputing
Year:
1989

Citing 6
Cited 0

System architecture of parallel processing system -Harry-

ICS '88 Proceedings of the 2nd international conference on Supercomputing
Requirements for optimal execution of oops with tests

ICS '88 Proceedings of the 2nd international conference on Supercomputing
The Cydra 5 Departmental Supercomputer: Design Philosophies, Decisions, and Trade-Offs

Computer
The VAL Language: Description and Analysis

ACM Transactions on Programming Languages and Systems (TOPLAS)
Dependence graphs and compiler optimizations

POPL '81 Proceedings of the 8th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Very Long Instruction Word architectures and the ELI-512

ISCA '83 Proceedings of the 10th annual international symposium on Computer architecture

Quantified Score

Hi-index	0.00

Visualization

Abstract

The purpose of this paper is to propose and evaluate a new scheme, called the Preceding Activation Scheme with Graph Unfolding, which translates a FORTRAN program into a dataflow graph and executes it efficiently. The problems in restructuring a FORTRAN program into a dataflow graph are that (1) a FORTRAN program is not written in a single assignment rule and (2) it has an explicit control flow. These problems result in little parallelism because many gate-operations, such as T/F gates, are introduced in the dataflow graph to synchronize the data movement. Therefore, discarding these gate-operations is the key to exposing parallelism in a FORTRAN program. In this paper, the preceding activation scheme with graph unfolding is proposed to discard these gate-operations. Then, the result of the performance evaluation by the -Harray- software simulator is presented. It is shown that the execution speed with the proposed scheme for flow graphs without backward branches is about 1.5 times as fast as that with the extended activation scheme which initiates the execution only after it is confirmed that a basic block will be selected at a conditional branch. Moreover, the execution speed is 2.7 times as fast as that with the extended activation scheme if a flow graph including backward branches are unfolded by the proposed scheme.