The DOI matches its Crossref record; 12 of the 12 references it cites were found in a registry or an index.
Automatic translation of FORTRAN programs to vector form
Open accessAbstract
The recent success of vector computers such as the Cray-1 and array processors such as those manufactured by Floating Point Systems has increased interest in making vector operations available to the FORTRAN programmer. The FORTRAN standards committee is currently considering a successor to FORTRAN 77, usually called FORTRAN 8x, that will permit the programmer to explicitly specify vector and array operations. Although FORTRAN 8x will make it convenient to specify explicit vector operations in new programs, it does little for existing code. In order to benefit from the power of vector hardware, existing programs will need to be rewritten in some language (presumably FORTRAN 8x) that permits the explicit specification of vector operations. One way to avoid a massive manual recoding effort is to provide a translator that discovers the parallelism implicit in a FORTRAN program and automatically rewrites that program in FORTRAN 8x. Such a translation from FORTRAN to FORTRAN 8x is not straightforward because FORTRAN DO loops are not always semantically equivalent to the corresponding FORTRAN 8x parallel operation. The semantic difference between these two constructs is precisely captured by the concept of dependence . A translation from FORTRAN to FORTRAN 8x preserves the semantics of the original program if it preserves the dependences in that program. The theoretical background is developed here for employing data dependence to convert FORTRAN programs to parallel form. Dependence is defined and characterized in terms of the conditions that give rise to it; accurate tests to determine dependence are presented; and transformations that use dependence to uncover additional parallelism are discussed.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
The Art of Computer Programming
Knuth, D. E. (1968) · Cited by 16,000
The Design and Analysis of Computer Algorithms
Aho, A. V., & Hopcroft, J. E. (1974) · CERN Document Server (European Organization for Nuclear Research) · Cited by 9,403
Depth-First Search and Linear Graph Algorithms
Tarjan, R. (1972) · SIAM Journal on Computing · doi:10.1137/0201010 · Cited by 6,081
Minimization of Boolean Functions*
McCluskey, E. J. (1956) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1956.tb03835.x · Cited by 1,230
The Problem of Simplifying Truth Functions
Quine, W. V. (1952) · The American Mathematical Monthly · doi:10.1080/00029890.1952.11988183 · Cited by 894
Dependence graphs and compiler optimizations
Kuck, D. J., Kuhn, R. H., Padua, D. A., Leasure, B., & Wolfe, M. (1981) · Proceedings of the 8th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '81 · doi:10.1145/567532.567555 · Cited by 651
Conversion of control dependence to data dependence
Allen, J. R., Kennedy, K., Porterfield, C., & Warren, J. (1983) · Proceedings of the 10th ACM SIGACT-SIGPLAN symposium on Principles of programming languages - POPL '83 · doi:10.1145/567067.567085 · Cited by 609
Self-citationThe Structure of Computers and Computations
Kuck, D. L. (1978) · UCLA - Biblioteca de Ciencias y Tecnologia Felix Morales Bueno · Cited by 492
A Survey of Parallel Machine Organization and Programming
Kuck, D. J. (1977) · ACM Computing Surveys · doi:10.1145/356683.356686 · Cited by 198
Dependence analysis for subscripted variables and its application to program transformations
Allen, J. R. (1983) · Rice Research Repository (Rice University) · Cited by 168
Cited by
The program dependence graph and its use in optimization
Ferrante, J., Ottenstein, K. J., & Warren, J. D. (1987) · ACM Transactions on Programming Languages and Systems · doi:10.1145/24039.24041 · Cited by 2,755
Dataflow analysis of array and scalar references
Feautrier, P. (1991) · International Journal of Parallel Programming · doi:10.1007/bf01407931 · Cited by 567
A practical automatic polyhedral parallelizer and locality optimizer
Bondhugula, U., Hartono, A., Ramanujam, J., & Sadayappan, P. (2008) · ACM SIGPLAN Notices · doi:10.1145/1379022.1375595 · Cited by 248
Improving the ratio of memory operations to floating-point operations in loops
Carr, S., & Kennedy, K. (1994) · ACM Transactions on Programming Languages and Systems · doi:10.1145/197320.197366 · Cited by 155
Self-citationEstimating interlock and improving balance for pipelined architectures
Callahan, D., Cocke, J., & Kennedy, K. (1988) · Journal of Parallel and Distributed Computing · doi:10.1016/0743-7315(88)90002-0 · Cited by 152
Self-citation
Metadata
- Authors
- Allen, R., & Kennedy, K.
- Venue
- ACM Transactions on Programming Languages and Systems
- Published
- 1987-10
- Volume
- 9
- Issue
- 4
- Pages
- 491-542
- ISSN
- 0164-0925 (ISSN-L)
- 1558-4593
- OpenAlex
- W2135736783
- Cited by
- 734
- References
- 12
- FWCI
- 42.72
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Automatic translation of FORTRAN programs to vector form. https://app.cochat.ai/papers/10.1145/29873.29875
- The paper
- Allen, R., & Kennedy, K. (1987). Automatic translation of FORTRAN programs to vector form. ACM Transactions on Programming Languages and Systems. https://doi.org/10.1145/29873.29875
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.