Dataflow analysis of array and scalar references

DOI10.1007/BF01407931zbMath0741.68075WikidataQ29999069 ScholiaQ29999069MaRDI QIDQ1186095

Paul Feautrier

Publication date: 28 June 1992

Published in: International Journal of Parallel Programming (Search for Journal in Brave)

zbMATH Keywords

program verificationdataflow analysisarray and scalar expansionparallel program constructionsemantics analysis

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (14)

DETECTION OF SCANS ⋮ Semi-automatic composition of loop transformations for deep parallelism and memory hierarchies ⋮ Scalable and structured scheduling ⋮ Incremental closure for systems of two variables per inequality ⋮ Quantifier elimination in automatic loop parallelization ⋮ ON THE OPTIMALITY OF ALLEN AND KENNEDY'S ALGORITHM FOR PARALLELISM EXTRACTION IN NESTED LOOPS ⋮ Dataflow analysis of array and scalar references ⋮ Some efficient solutions to the affine scheduling problem. I: One- dimensional time ⋮ Automatic implementation of affine iterative algorithms: Design flow and communication synthesis ⋮ The combinatorics of cache misses during matrix multiplication ⋮ On the optimality of Feautrier's scheduling algorithm ⋮ The complexity of multidimensional periodic scheduling ⋮ OPTIMAL SOFTWARE PIPELINING UNDER RESOURCE CONSTRAINTS ⋮ Some efficient solutions to the affine scheduling problem. II: Multidimensional time

Uses Software

• Lucid
• PipLib

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Data dependence and its application to parallel processing
• Dataflow analysis of array and scalar references
• Parametric integer programming
• Automatic translation of FORTRAN programs to vector form
• An Algorithm for Structuring Flowgraphs
• The parallel execution of DO loops

This page was built for publication: Dataflow analysis of array and scalar references