The DOI matches its Crossref record; 18 of the 18 references it cites were found in a registry or an index.
Advanced compiler optimizations for supercomputers
Open accessAbstract
Compilers for vector or multiprocessor computers must have certain optimization features to successfully generate parallel code.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Compilers: Principles, Techniques, and Tools
Aho, A. V., Sethi, R., & Ullman, J. D. (1986) · Cited by 8,448
The American National Standards Institute
Andersen, F. A. (1984) · IEEE Engineering in Medicine and Biology Magazine · doi:10.1109/memb.1984.5006016 · Cited by 1,212
A unified approach to global program optimization
Kildall, G. A. (1973) · Proceedings of the 1st annual ACM SIGACT-SIGPLAN symposium on Principles of programming languages - POPL '73 · doi:10.1145/512927.512945 · Cited by 916
Optimizing supercompilers for supercomputers
Wolfe, M. (2020) · Proceedings of the 34th ACM International Conference on Supercomputing · doi:10.1145/3392717.3400034 · Cited by 837
Self-citationDependence 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
Self-citationAllocating Independent Subtasks on Parallel Processors
Kruskal, C. P., & Weiss, A. A. (1985) · IEEE Transactions on Software Engineering · doi:10.1109/tse.1985.231547 · Cited by 347
High-Speed Multiprocessors and Compilation Techniques
Padua, Kuck, & Lawrie (1980) · IEEE Transactions on Computers · doi:10.1109/tc.1980.1675676 · Cited by 270
Doacross: Beyond Vectorization for Multiprocessors.
Cytron, R. K. (1986) · Proceedings of the International Conference on Parallel Processing · Cited by 264
Interprocedural dependence analysis and parallelization
Burke, M. G., & Cytron, R. K. (2004) · ACM SIGPLAN Notices · doi:10.1145/989393.989411 · Cited by 219
A Survey of Parallel Machine Organization and Programming
Kuck, D. J. (1977) · ACM Computing Surveys · doi:10.1145/356683.356686 · Cited by 202
PFC: A Program to Convert Fortran to Parallel Form
Allen, J. R., & Kennedy, K. (1982) · Rice Research Repository (Rice University) · Cited by 194
Allen, J. R., & Kennedy, K. (1984) · ACM SIGPLAN Symposium on Compiler Construction · doi:10.1145/502874.502897 · Cited by 185
Direct parallelization of call statements
Triolet, R., Irigoin, F., & Feautrier, P. (1986) · Proceedings of the 1986 SIGPLAN symposium on Compiler construction · doi:10.1145/12276.13329 · Cited by 174
Symbolic evaluation and the global value graph
Reif, J. H., & Lewis, H. R. (1977) · ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages (POPL) · doi:10.1145/512950.512961 · Cited by 90
Multiprocessors: discussion of some theoretical and practical problems
Haiek, D. A. P. (1980) · Cited by 77
Parallel Processing of Ordinary Programs
Kuck, D. J. (1976) · Advances in computers · doi:10.1016/s0065-2458(08)60521-5 · Cited by 71
EFFECTS OF PROGRAM RESTRUCTURING, ALGORITHM CHANGE, AND ARCHITECTURE CHOICE ON PROGRAM PERFORMANCE.
Kuck, D. J., Sameh, A., Cytron, R. K., Veidenbaum, A. V., Polychronopoulos, C. D., Lee, G., McDaniel, T., Leasure, B., Beckman, C., Davies, J. R. B., et al. (1984) · Cited by 70
Interprocedural dependence analysis and parallelization
Burke, M., & Cytron, R. K. (1986) · ACM SIGPLAN Notices · doi:10.1145/13310.13328 · Cited by 69
Cited by
Compiler transformations for high-performance computing
Bacon, D. F., Graham, S. L., & Sharp, O. J. (1994) · ACM Computing Surveys · doi:10.1145/197405.197406 · Cited by 818
Dataflow analysis of array and scalar references
Feautrier, P. (1991) · International Journal of Parallel Programming · doi:10.1007/bf01407931 · Cited by 567
Executing a program on the MIT tagged-token dataflow architecture
Arvind, & Nikhil, R. S. (1990) · IEEE Transactions on Computers · doi:10.1109/12.48862 · Cited by 401
I-structures: data structures for parallel computing
Arvind, Nikhil, R. S., & Pingali, K. K. (1989) · ACM Transactions on Programming Languages and Systems · doi:10.1145/69558.69562 · Cited by 360
Strategies for cache and local memory management by global program transformation
Gannon, D., Jalby, W., & Gallivan, K. (1988) · Journal of Parallel and Distributed Computing · doi:10.1016/0743-7315(88)90014-7 · Cited by 350
Metadata
- Authors
- Padua, D. A., & Wolfe, M. J.
- Venue
- Communications of the ACM
- Published
- 1986-12
- Volume
- 29
- Issue
- 12
- Pages
- 1184-1201
- ISSN
- 0001-0782 (ISSN-L)
- 1557-7317
- OpenAlex
- W2098688018
- Cited by
- 690
- References
- 18
- FWCI
- 39.89
- 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
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.