The DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
Conversion of control dependence to data dependence
Abstract
Program analysis methods, especially those which support automatic vectorization, are based on the concept of interstatement dependence where a dependence holds between two statements when one of the statements computes values needed by the other. Powerful program transformation systems that convert sequential programs to a form more suitable for vector or parallel machines have been developed using this concept [AllK 82, KKLW 80].The dependence analysis in these systems is based on data dependence. In the presence of complex control flow, data dependence is not sufficient to transform programs because of the introduction of control dependences. A control dependence exists between two statements when the execution of one statement can prevent the execution of the other. Control dependences do not fit conveniently into dependence-based program translators.One solution is to convert all control dependences to data dependences by eliminating goto statements and introducing logical variables to control the execution of statements in the program. In this scheme, action statements are converted to IF statements. The variables in the conditional expression of an IF statement can be viewed as inputs to the statement being controlled. The result is that control dependences between statements become explicit data dependences expressed through the definitions and uses of the controlling logical variables.This paper presents a method for systematically converting control dependences to data dependences in this fashion. The algorithms presented here have been implemented in PFC, an experimental vectorizer written at Rice University.
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
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
Flow diagrams, turing machines and languages with only two formation rules
Böhm, C., & Jacopini, G. (1966) · Communications of the ACM · doi:10.1145/355592.365646 · Cited by 791
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
Self-citationControl and data dependence for program transformations.
Towle, R. A. (1976) · Cited by 74
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
Self-citationCompiler 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
Automatic translation of FORTRAN programs to vector form
Allen, R., & Kennedy, K. (1987) · ACM Transactions on Programming Languages and Systems · doi:10.1145/29873.29875 · Cited by 734
Self-citationDynamic Warp Formation and Scheduling for Efficient GPU Control Flow
Fung, W. W. L., Sham, I., Yuan, G., & Aamodt, T. M. (2007) · 40th Annual IEEE/ACM International Symposium on Microarchitecture (MICRO 2007) · doi:10.1109/micro.2007.30 · Cited by 724
The program dependence graph in a software development environment
Ottenstein, K. J., & Ottenstein, L. M. (1984) · ACM SIGPLAN Notices · doi:10.1145/390011.808263 · Cited by 641
Improving GPU performance via large warps and two-level warp scheduling
Narasiman, V., Shebanow, M., Lee, C. J., Miftakhutdinov, R., Mutlu, O., & Patt, Y. N. (2011) · Proceedings of the 44th Annual IEEE/ACM International Symposium on Microarchitecture · doi:10.1145/2155620.2155656 · Cited by 413
Microarchitectural Design Space Exploration Using an Architecture-Centric Approach
Dubach, C., Jones, T., & O'Boyle, M. (2007) · 40th Annual IEEE/ACM International Symposium on Microarchitecture (MICRO 2007) · doi:10.1109/micro.2007.12 · Cited by 407
A brief survey of program slicing
Xu, B., Qian, J., Zhang, X., Wu, Z., & Chen, L. (2005) · ACM SIGSOFT Software Engineering Notes · doi:10.1145/1050849.1050865 · Cited by 313
Brown, N. C., Campora, J. P., Granade, C., Heim, B., Wernli, S., Ryan-Anderson, C., Lucchetti, D., Paetznick, A., Roetteler, M., Svore, K., et al. (2023) · arXiv · doi:10.48550/arxiv.2310.12106 · Cited by 4
Metadata
- Authors
- Allen, J. R., Kennedy, K., Porterfield, C., & Warren, J.
- Venue
- Proceedings of the 10th ACM SIGACT-SIGPLAN symposium on Principles of programming languages - POPL '83
- Publisher
- ACM Press
- Published
- 1983
- Pages
- 177-189
- OpenAlex
- W2140311411
- Cited by
- 609
- References
- 6
- FWCI
- 4.14
- Type
- conference paper
- Language
- en
- Open access
- closed
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.