The purpose of this work is to propose and evaluate the preceding activation scheme with graph unfolding, which translate a Fortran program into a dataflow graph and executes it efficiently. The problems in restructuring a Fortran program into a dataflow graph are that a Fortran program is not written in a single assignment rule and 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. The preceding activation scheme with graph unfolding is proposed to discard these gate operations. 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 is unfolded by the proposed scheme.
|出版ステータス||Published - 1989 12月 1|
|イベント||Proceedings: Supercomputing '89 - Reno, NV, USA|
継続期間: 1989 11月 13 → 1989 11月 17
|Other||Proceedings: Supercomputing '89|
|City||Reno, NV, USA|
|Period||89/11/13 → 89/11/17|
ASJC Scopus subject areas