Run-time data-flow analysis

Authors:
Li Jianhui;Zang Binyu;Wu Rong;Zhu Chuanqi
Affiliations:
Parallel Processing Institute, Fudan University, Shanghai 200433, P.R. China;Parallel Processing Institute, Fudan University, Shanghai 200433, P.R. China;Parallel Processing Institute, Fudan University, Shanghai 200433, P.R. China;Parallel Processing Institute, Fudan University, Shanghai 200433, P.R. China
Venue:
Journal of Computer Science and Technology
Year:
2002

Citing 7
Cited 0

A Scheme to Enforce Data Dependence on Large Multiprocessor Systems

IEEE Transactions on Software Engineering
Array privatization for parallel execution of loops

ICS '92 Proceedings of the 6th international conference on Supercomputing
The privatizing DOALL test: a run-time technique for DOALL loop identification and array privatization

ICS '94 Proceedings of the 8th international conference on Supercomputing
SUIF: an infrastructure for research on parallelizing and optimizing compilers

ACM SIGPLAN Notices
Run-time methods for parallelizing partially parallel loops

ICS '95 Proceedings of the 9th international conference on Supercomputing
Automatic array privatization and demand-driven symbolic analysis

Automatic array privatization and demand-driven symbolic analysis
The design considerations and test results of AFT-a new generation parallelizing compiler

APDC '97 Proceedings of the 1997 Advances in Parallel and Distributed Computing Conference (APDC '97)

Quantified Score

Hi-index	0.00

Visualization

Abstract

Parallelizing compilers have made great progress in recent years. However, there still remains a gap between the current ability of parallelizing compilers and their final goals. In order to achieve the maximum parallelism, run-time techniques were used in parallelizing compilers during last few years. First, this paper presents a basic run-time privatization method. The definition of run-time dead code is given and its side effect is discussed. To eliminate the imprecision caused by the run-time dead code, backward data-flow information must be used. Proteus Test, which can use backward information in run-time, is then presented to exploit more dynamic parallelism. Also, a variation of Proteus Test, the Advanced Proteus Test, is offered to achieve partial parallelism. Proteus Test was implemented on the parallelizing compiler AFT. In the end of this paper the program fpppp.f of Spec95fp Benchmark is taken as an example, to show the effectiveness of Proteus Test.