The Community for Technology Leaders
Green Image
Issue No. 04 - July-Aug. (2012 vol. 32)
ISSN: 0272-1732
pp: 19-31
Feng Li , INRIA
Antoniu Pop , INRIA
Albert Cohen , INRIA
ABSTRACT
This article presents a general algorithm for transforming sequential imperative programs into parallel data-flow programs. The algorithm operates on a program dependence graph in static-single-assignment form, extracting task, pipeline, and data parallelism from arbitrary control flow, and coarsening its granularity using a generalized form of typed fusion. A prototype based on GNU Compiler Collection (GCC) is applied to the automatic parallelization of recursive C programs.
INDEX TERMS
Instruction sets, Parallel processing, Pipeline processing, Synchronization, Radiation detectors, Sequential analysis, SSA form, Instruction sets, Parallel processing, Pipeline processing, Synchronization, Radiation detectors, Sequential analysis, sequential imperative programs, automatic parallelization, data-flow model, loop fusion, program dependence graph
CITATION

A. Pop, F. Li and A. Cohen, "Automatic Extraction of Coarse-Grained Data-Flow Threads from Imperative Programs," in IEEE Micro, vol. 32, no. , pp. 19-31, 2012.
doi:10.1109/MM.2012.49
160 ms
(Ver 3.3 (11022016))