article

Free access

Compact representations for control dependence

Authors:

Jeanne Ferrante,

V. SarkarAuthors Info & Claims

ACM SIGPLAN Notices, Volume 25, Issue 6

Pages 337 - 351

https://doi.org/10.1145/93548.93592

Published: 01 June 1990 Publication History

First page of PDF

References

[1]

Frances Allen, Michael Burke, Philippe Charles, Ron Cytron, and Jeanne Ferrante. An overview of the ptran analysis system for multiprocessing. Proceedings of the 1987 International Conference on Supercomputin9, 1987. Also published in The Journal of Parallel and Distributed Computing, Oct., 1988, Vol. 5, No. 5, pp. 617-640.

Digital Library

[2]

Frances Allen, Michael Burke, Ron Cytron, Jeanne Ferrante, Wilson Hsieh, and Vivek Saxkar. A framework for determining useful parallelism. Proceedings of the A CM 1988 International Conference on Supercomputing, 207- 215, July 1988.

Digital Library

[3]

Bowen Alpern, Mark N. Wegman, and F. Kenneth Zadeck. Detecting equality of variables in programs. Fifteenth A CM Principles of Programming Languages Symposium, 1-11, January 1988. San Diego, CA.

Digital Library

[4]

William Baxter and J. R. Bauer, III. The program dependence graph in vectorization. Sixteenth A CM Principles of Programming Languages Symposium, 1- 11., January 11-13 1989. Austin, Texas.

Digital Library

[5]

Ron Cytron and Jeanne Ferrante. What's in a name? or the value of renaming for parallelism detection and storage allocation. Proceedings of lhe 1987 International Conference on Parallel Processing, I9-27, August 1987.

[6]

Robert Cartwright and Mathias Felleisen. The semantics of program dependence. SIGPLAN '89 Conference on Programming Language Design and Implementation, 13-27, June 1989.

Digital Library

[7]

Ron Cytron, Jeanne Ferrante, Barry K. Rosen, Mark N. Wegman, and F. Kenneth Zadeck. An efficient method for computing static single assignment form. Sixteenlh Annual A CM Symposium on Principles of Programming Languages, 25-35, January 1989.

Digital Library

[8]

Ron Cytron, Jeanne Ferrante, and Vivek Sarkar. Experiences using control dependence in ptran. Proceedings of the Second Workshop on Languages and Compilers for Parallel Computing, August 1989.

Digital Library

[9]

Ron Cytron, Andy Lowry, and Ken Zadeck. Code motion of control structures in high-level languages. Conf. Rec. of the A CM Syrup. on Principles of Compiler Construction, 1986.

Digital Library

[10]

J. Ferrante, K. Ottenstein, and J. Warren. The program dependence graph and its use in optimization. A CM Transactions on Programming Languages and Systems, 319-349, July 1987.

Digital Library

[11]

Rajiv Gupta and Mary Lou Sofia. A reconfigurable liw architecture and its compiler. Proc. of the 1987 Int'l Conf. on Parallel Processing, Aug. 1987.

[12]

Rajiv Gupta and Mary Lou Sofia. Region scheduling. Proc. of the Second International Conferenece on Supercomputing, 3:141- 148, May 1987.

[13]

Dov Harel. A linear time algorithm for finding dominators in flow graphs and related problems. Symposium on Theory of Computing, May 1985.

Digital Library

[14]

Susan Horwitz, Jan Prins, and Thomas Reps. Integrating non-interfering versions of programs. Conf. Rec. Fifteenth A CM Symposium on Principles of Programming Languages, 133-145, January 1987.

Digital Library

[15]

David J. Kuck. The Structure of Computers and Computations. John Wiley and Sons, 1978.

Digital Library

[16]

Karl J. Ottenstein, Robert A. Ba!lance, and Arthur B. Maccabe. Gated single-assignment form: dataflow interpretation for imperative languages. A CM SIGPLAN Symposium on Programming Language Design and Implementation, June 1990.

[17]

Barry K. Rosen, Mark N. Wegma.n, a,nd F. Kenneth Zadeck. Global value numbers and redundant computations. Fifteenth A CM Principles of Programming Languages Symposium, 12-27, January 1988. San Diego, CA.

Digital Library

[18]

Rebecca Parsons Selke. A rewriting semantics for program dependence graphs. Sixteenth A CM Principles of Programming Languages Symposium, January 11-13 1989. Austin, Texas.

Digital Library

[19]

J.T. Schwartz and M. Sharir. Tarjan's fast interval finding algorithm. Technical Report, Courant Institute, New York University, 1978. SETL Newsletter Number 204.

[20]

Mark Wegman and Ken Zadeck. Constant propagation with conditional branches. Conf. Rec. Twelfth ACM Symposium on Principles of Programming Languages, 291-299, January 1985.

Digital Library

[21]

Daniel Yellin. Representing sets with constant time equality testing. Proceedings of the First Annual A CM-SiAM Symposium on Discrete Algorithms, 64-73, January 1990.

Digital Library

Cited By

Song SChoi HKim HLee J(2021)Fine-grained pipeline parallelization for network function programsProceedings of the 2021 IEEE/ACM International Symposium on Code Generation and Optimization10.1109/CGO51591.2021.9370309(162-173)Online publication date: 27-Feb-2021
https://dl.acm.org/doi/10.1109/CGO51591.2021.9370309
Xu BQian JZhang XWu ZChen L(2005)A brief survey of program slicingACM SIGSOFT Software Engineering Notes10.1145/1050849.105086530:2(1-36)Online publication date: 1-Mar-2005
https://dl.acm.org/doi/10.1145/1050849.1050865
Sreedhar VGao GCytron RLee P(1995)A linear time algorithm for placing φ-nodesProceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages10.1145/199448.199464(62-73)Online publication date: 25-Jan-1995
https://dl.acm.org/doi/10.1145/199448.199464
Show More Cited By

Index Terms

Compact representations for control dependence

Recommendations

Querying multi-granular compact representations
DASFAA'06: Proceedings of the 11th international conference on Database Systems for Advanced Applications

A common phenomenon of time-qualified data are temporal repetitions, i.e., the association of multiple time values with the same data. In order to deal with finite and infinite temporal repetitions in databases we must use compact representations. There ...
Domain representations of spaces of compact subsets

We present a method for constructing from a given domain representation of a space X with underlying domain D, a domain representation of a subspace of compact subsets of X where the underlying domain is the Plotkin powerdomain of D. We show that this ...
Algorithms and limits for compact plan representations

Compact representations of objects is a common concept in computer science. Automated planning can be viewed as a case of this concept: a planning instance is a compact implicit representation of a graph and the problem is to find a path (a plan) in ...

Comments

Information & Contributors

Information

Published In

cover image ACM SIGPLAN Notices

ACM SIGPLAN Notices Volume 25, Issue 6

Jun. 1990

343 pages

ISSN:0362-1340

EISSN:1558-1160

DOI:10.1145/93548

Editor:
Marina Chen

Issue’s Table of Contents

PLDI '90: Proceedings of the ACM SIGPLAN 1990 conference on Programming language design and implementation
June 1990
351 pages
ISBN:0897913647
DOI:10.1145/93542
Chairman:
Bernard N. Fischer

Copyright © 1990 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 June 1990

Published in SIGPLAN Volume 25, Issue 6

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

33
Total Citations
View Citations
696
Total Downloads

Downloads (Last 12 months)67
Downloads (Last 6 weeks)11

Reflects downloads up to 12 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

Song SChoi HKim HLee J(2021)Fine-grained pipeline parallelization for network function programsProceedings of the 2021 IEEE/ACM International Symposium on Code Generation and Optimization10.1109/CGO51591.2021.9370309(162-173)Online publication date: 27-Feb-2021
https://dl.acm.org/doi/10.1109/CGO51591.2021.9370309
Xu BQian JZhang XWu ZChen L(2005)A brief survey of program slicingACM SIGSOFT Software Engineering Notes10.1145/1050849.105086530:2(1-36)Online publication date: 1-Mar-2005
https://dl.acm.org/doi/10.1145/1050849.1050865
Sreedhar VGao GCytron RLee P(1995)A linear time algorithm for placing φ-nodesProceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages10.1145/199448.199464(62-73)Online publication date: 25-Jan-1995
https://dl.acm.org/doi/10.1145/199448.199464
Song SChoi HKim H(2021)Fine-Grained Pipeline Parallelization for Network Function Programs2021 IEEE/ACM International Symposium on Code Generation and Optimization (CGO)10.1109/CGO51591.2021.9370309(162-173)Online publication date: 27-Feb-2021
https://doi.org/10.1109/CGO51591.2021.9370309
Damani SSarkar V(2021)Common Subexpression Convergence: A New Code Optimization for SIMT ProcessorsLanguages and Compilers for Parallel Computing10.1007/978-3-030-72789-5_5(64-73)Online publication date: 26-Mar-2021
https://doi.org/10.1007/978-3-030-72789-5_5
Kim BHeo SLee GSong SKim JKim HAmaral JKulkarni M(2019)Spinal code: automatic code extraction for near-user computation in fogsProceedings of the 28th International Conference on Compiler Construction10.1145/3302516.3307356(87-98)Online publication date: 16-Feb-2019
https://dl.acm.org/doi/10.1145/3302516.3307356
(2017)Exploiting vectorization in high level synthesis of nested irregular loopsJournal of Systems Architecture: the EUROMICRO Journal10.1016/j.sysarc.2017.03.00175:C(1-14)Online publication date: 1-Apr-2017
https://dl.acm.org/doi/10.1016/j.sysarc.2017.03.001
Yadegari BDebray S(2017)Control Dependencies in Interpretive SystemsRuntime Verification10.1007/978-3-319-67531-2_19(312-329)Online publication date: 6-Sep-2017
https://doi.org/10.1007/978-3-319-67531-2_19
Rodrigues BQuintão Pereira FAranha DZaks AHermenegildo M(2016)Sparse representation of implicit flows with applications to side-channel detectionProceedings of the 25th International Conference on Compiler Construction10.1145/2892208.2892230(110-120)Online publication date: 17-Mar-2016
https://dl.acm.org/doi/10.1145/2892208.2892230
Lattuada MFerrandi FMarculescu DLiu F(2015)Code Transformations Based on Speculative SDC SchedulingProceedings of the IEEE/ACM International Conference on Computer-Aided Design10.5555/2840819.2840830(71-77)Online publication date: 2-Nov-2015
https://dl.acm.org/doi/10.5555/2840819.2840830
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Issue’s Table of Contents