More Web Proxy on the site http://driver.im/

Article

Free access

A foundation for sequentializing parallel code

Authors:

J. FerranteAuthors Info & Claims

SPAA '90: Proceedings of the second annual ACM symposium on Parallel algorithms and architectures

Pages 350 - 359

https://doi.org/10.1145/97444.97702

Published: 01 May 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 rnultiprocessing. Proceedings of the 1987 Internalional Conference on Supercomputing, 1987. Also published in The Journal of Parallel and Distributed Computing, Oct., 1988, Vol. 5, No. 5, pp. 617- 640.

Digital Library

[2]

Randy Allen and Ken Kennedy. Automatic translation of fortran programs to vector form. A CM Transactions on Programming Languages and Systems, 9(4):491-592, October 1987.

Digital Library

[3]

A.V. Aho, R. Sethi, and J.D. Ullman. Compilers: Principles, Techniques, and Tools. Addison-Wesley, 1986.

Digital Library

[4]

Mario R. Barbacci. A comparison of register transfer languages for describing computers and digital systems. IEEE Transactions on Computers, C-24:137-150, February 1975.

Digital Library

[5]

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

Digital Library

[6]

Michael Burke, Ron Cytron, Jeanne Ferrante, and Wilson Hsieh. Automatic generation of nested, fork-join parallelism. Journal of Supercomputing, 2(3):71-88, July 1989.

[7]

Robert Cartwright and Mathias Felleisen. The semantics of program dependence. SIGPLAN '89 Conference on Programming Language Dest9n and Implemenlation, pages 13-27, June 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]

J. Ferrante and M. E. Mace. On linearizing parallel code. Conf. Rec. Twelfth A CM Syrup. on Principles of Programming Languages, pages 179-189, January 1985.

Digital Library

[10]

Jeanne Ferrante, Mary Mace, and Barbara Simons. Generating sequential code from parallel code. Proceedings of the A CM 1988 International Conference on Supercompuling, pages 582-592, July 1988.

Digital Library

[11]

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

Digital Library

[12]

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

Digital Library

[13]

Susan Horwitz, Jan Prins, and Thomas R eps. On the adequacy of program dependence graphs for representing programs. Conf. Rec. Fifteenth A CM Symposium on Principles of Programming Languages, pages 146-157, January 1987.

Digital Library

[14]

David J. Kuck. The Structure of Com p~tters a~d Computalions. John Wiley and Sons, 1978.

Digital Library

[15]

Vivek Sarkar. Partitioning and Scheduling Parallel Programs for Multiprocessors. Pit nm.n, London and The MIT Press, Cambridge, Massachusetts, 1989. In the series, Research Monographs in Parallel and Distributed Computing.

Digital Library

[16]

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

Digital Library

[17]

V. Sarkar and J. Hennessy. Compile-time partitioning and scheduling of parallel programs. Proceedings of the Sigplan '86 Symposium on Compiler Construction, 21(7):17-26, July 1986.

Digital Library

Cited By

Stanier JRastello F(2021)Graphs and Gating FunctionsSSA-based Compiler Design10.1007/978-3-030-80515-9_14(185-199)Online publication date: 12-Jun-2021
https://doi.org/10.1007/978-3-030-80515-9_14
Bellucci AMalizia AAedo I(2014)Light on horizontal interactive surfacesACM Computing Surveys10.1145/250046746:3(1-42)Online publication date: 1-Jan-2014
https://dl.acm.org/doi/10.1145/2500467
Stanier JWatson D(2013)Intermediate representations in imperative compilersACM Computing Surveys10.1145/2480741.248074345:3(1-27)Online publication date: 3-Jul-2013
https://dl.acm.org/doi/10.1145/2480741.2480743
Show More Cited By

Index Terms

A foundation for sequentializing parallel code

Recommendations

The National Science Foundation (seminar session): funding opportunities for CS faculty through the CCLI program

A new program in undergraduate education at the National Science Foundation is the Course, Curriculum and Laboratory Improvement (CCLI) program. CCLI has two tracks that are of particular interest to CS faculty members. They are the Educational ...
The National Science Foundation (seminar session): funding opportunities for CS faculty through the CCLI program
SIGCSE '00: Proceedings of the thirty-first SIGCSE technical symposium on Computer science education

A new program in undergraduate education at the National Science Foundation is the Course, Curriculum and Laboratory Improvement (CCLI) program. CCLI has two tracks that are of particular interest to CS faculty members. They are the Educational ...
Berkeley Foundation for Opportunities in Information Technology: A Decade of Broadening Participation

The Berkeley Foundation for Opportunities in Information Technology is a decade-old endeavor to expose pre-college young women and underrepresented racial and ethnic minorities to the fields of computer science and engineering, and prepare them for ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Conferences

SPAA '90: Proceedings of the second annual ACM symposium on Parallel algorithms and architectures

May 1990

417 pages

ISBN:0897913701

DOI:10.1145/97444

Chairman:
F. T. Leighton
Massachusetts Institute of Technology, Cambridge, MA

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]

Sponsors

Computer Tech Inst.: Computer Technology Institute
CTI: Computer Technology Inst.
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGARCH: ACM Special Interest Group on Computer Architecture
EATCS: European Association for Theoretical Computer Science
IEEE-CS: Computer Society

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 May 1990

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

SPAA90

Sponsor:

Computer Tech Inst.
CTI
SIGACT
SIGARCH
EATCS
IEEE-CS

SPAA90: 2nd Annual ACM Symposium on Parallel Algorithms & Architecture

July 2 - 6, 1990

Island of Crete, Greece

Acceptance Rates

Overall Acceptance Rate 447 of 1,461 submissions, 31%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

11
Total Citations
View Citations
443
Total Downloads

Downloads (Last 12 months)40
Downloads (Last 6 weeks)6

Reflects downloads up to 01 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Stanier JRastello F(2021)Graphs and Gating FunctionsSSA-based Compiler Design10.1007/978-3-030-80515-9_14(185-199)Online publication date: 12-Jun-2021
https://doi.org/10.1007/978-3-030-80515-9_14
Bellucci AMalizia AAedo I(2014)Light on horizontal interactive surfacesACM Computing Surveys10.1145/250046746:3(1-42)Online publication date: 1-Jan-2014
https://dl.acm.org/doi/10.1145/2500467
Stanier JWatson D(2013)Intermediate representations in imperative compilersACM Computing Surveys10.1145/2480741.248074345:3(1-27)Online publication date: 3-Jul-2013
https://dl.acm.org/doi/10.1145/2480741.2480743
Ito SHagihara SYonezaki N(2006)An operational semantics of program dependence graphs for unstructured programsProceedings of the 11th Asian computing science conference on Advances in computer science: secure software and related issues10.5555/1782734.1782756(264-271)Online publication date: 6-Dec-2006
https://dl.acm.org/doi/10.5555/1782734.1782756
Sarkar V(2005)Analysis and optimization of explicity parallel programs using the parallel program graph representationLanguages and Compilers for Parallel Computing10.1007/BFb0032686(94-113)Online publication date: 9-Jun-2005
https://doi.org/10.1007/BFb0032686
Weil DBertin VClosse EPoize MVenier PPulou JThe C(2000)Efficient compilation of ESTEREL for real-time embedded systemsProceedings of the 2000 international conference on Compilers, architecture, and synthesis for embedded systems10.1145/354880.354882(2-8)Online publication date: 1-Nov-2000
https://dl.acm.org/doi/10.1145/354880.354882
Feigen LKlappholz DCasazza RXue XBoehm HLang BYellin D(1994)The revival transformationProceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages10.1145/174675.178043(421-434)Online publication date: 1-Feb-1994
https://dl.acm.org/doi/10.1145/174675.178043
Weise DCrew RErnst MSteensgaard BBoehm HLang BYellin D(1994)Value dependence graphsProceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages10.1145/174675.177907(297-310)Online publication date: 1-Feb-1994
https://dl.acm.org/doi/10.1145/174675.177907
Grunwald DSrinivasan H(1993)Data flow equations for explicitly parallel programsACM SIGPLAN Notices10.1145/173284.15534928:7(159-168)Online publication date: 1-Jul-1993
https://dl.acm.org/doi/10.1145/173284.155349
Grunwald DSrinivasan HChen MHalstead R(1993)Data flow equations for explicitly parallel programsProceedings of the fourth ACM SIGPLAN symposium on Principles and practice of parallel programming10.1145/155332.155349(159-168)Online publication date: 1-Aug-1993
https://dl.acm.org/doi/10.1145/155332.155349
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

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 Table of Contents