Article

Free access

Automatic generation of DAG parallelism

Authors:

W. HsiehAuthors Info & Claims

PLDI '89: Proceedings of the ACM SIGPLAN 1989 conference on Programming language design and implementation

Pages 54 - 68

https://doi.org/10.1145/73141.74823

Published: 21 June 1989 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 I987 International 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]

Michael Burke and Ron Cytron. Interprocedural dependence analysis and parallelization. Proceedings of the,_qigplan '86 Symposium on Compiler Construction, 21(7):162- 175, July 1986.

Digital Library

[4]

Michael Burke, Ron Cytron, Jeanne Ferrante, Wilson Hsieh, Vivek Sarkar, and David Shields. Automatic discovery of parallelism: a tool and an experiment. A CM SfGPLAN Symposium on Parallel Programming: Experience with Applications, Languages, and Systems, 77-84., July 1988.

Digital Library

[5]

Michael Burke, Ron Cytron, Jeanne Ferrante, Michael Hind, Wilson Hsieh, and Vivek Sarkar. Automatic Parallelization for DAG Parallelism. Technical Report, MIT, NYU, IBM, 1989. Text in preparation.

[6]

Michael Burke, Ron Cytron, Jeanne Ferrante, and Wilson Hsieh. Automatic Generation of Nested, Fork-Join Parallelism. Technical Report, MIT,IBM, February 1989. To appear in The Journal of Supercomputing.

[7]

Ron Cytron and Jeanne Ferrante. An Improved Control Dependence Algorithm. Technical Report, IBM, 1987. Tech. Report RC 13291.

[8]

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

[9]

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

Digital Library

[10]

Ron Cytron, David j. Kuck, and Alex V. Veidenbaum. The effect of restructuring compilers on program performance for highspeed computers. Computer Physics Communications, 37:39-48, 1985.

[11]

J. J. Dongarra, J. R. Bunch, C. B. Moler, and G. W. Stewart. Linpack Users' Guide. SiAM Press, 1979.

[12]

J. A. Fisher, J. R. Ellis, J. C. Ruttenberg, and A. Nicolau. Parallel processing: a smart compiler and a dumb machine. Proceedings of the ACM Symposium on Compiler Construction, 37- 47, June 1984.

Digital Library

[13]

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

[14]

E.j. Gilbert. An Investigation of the Partitioning of Algorithms Across an MIMD Computing System. Technical Report, Computer Systems Laboratory, Stanford University, May 1980. TR No. 176.

[15]

Wilson C. Hsieh. Eziracting Parallelism from Sequential Programs. Technical Report, Massachusetts Institute of Technology, May 1988. Master's thesis.

[16]

IBM. Parallel Fortran Language and Li. brary Reference. Technical Report, International Business Machines, March 1988. Pub. No. SC23-0431-0.

[17]

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

Digital Library

[18]

T. Lengauer and Robert Tarjan. A fast algorithm for finding dominators in a flowgraph. TOPLAS, July 1979.

Digital Library

[19]

Samuel Pratt Midkiff. Automatic Generation of Synchronization Instructions For Parallel Processors. Technical Report, Center for Supercomputing Research and Development, U. of Illinois, May 1986. CSRD Rept. No.588, UILU-ENG-86-8002.

[20]

Alexandru Nicolau. A Fine-Grain Parallelizing Compiler. Technical Report TR 86-792, Department of Computer Science- Cornell Universitg, December 1986.

Digital Library

[21]

Dick Pountain and David May. A tutorial introduction of OCCAM programming. March 1987.

Digital Library

[22]

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

Digital Library

[23]

B. T. Smith, :I. M. Boyle, J. J. Dongarra, B. S. Garbow, Y. Ikebe, V. C. Klema, and C. B. Moler. Matriz Eigensystem Routines - Eispack Guide. Springer-Verlag, 1976.

[24]

Michael J. Wolfe. Techniques for Improving the Inherent Parallelism in Programs. Technical Report, University of Illinois at Urbana-Champaign, 1978. M.S. Thesis.

[25]

Michael J. Wolfe. Optimizing Supercompilers for Supercomputers. PhD thesis, University of Illinois at Urbana-Champaign, 1982. Report No. UIUCDCS-R-82-1105.

Digital Library

Cited By

Nicolau ALi GKejariwal A(2009)Techniques for efficient placement of synchronization primitivesACM SIGPLAN Notices10.1145/1594835.150420744:4(199-208)Online publication date: 14-Feb-2009
https://dl.acm.org/doi/10.1145/1594835.1504207
Nicolau ALi GVeidenbaum AKejariwal AGschwind MNicolau ASalapura VMoreira J(2009)Synchronization optimizations for efficient execution on multi-coresProceedings of the 23rd international conference on Supercomputing10.1145/1542275.1542303(169-180)Online publication date: 8-Jun-2009
https://dl.acm.org/doi/10.1145/1542275.1542303
Nicolau ALi GKejariwal AReed DSarkar V(2009)Techniques for efficient placement of synchronization primitivesProceedings of the 14th ACM SIGPLAN symposium on Principles and practice of parallel programming10.1145/1504176.1504207(199-208)Online publication date: 14-Feb-2009
https://dl.acm.org/doi/10.1145/1504176.1504207
Show More Cited By

Index Terms

Automatic generation of DAG parallelism

Recommendations

Automatic generation of custom SIMD instructions for superword level parallelism
DATE '14: Proceedings of the conference on Design, Automation & Test in Europe

Application specific instruction-set processors (ASIPs) have drawn significant attention from System-on-a-Chip (SoC) community due to the capability of fine grain flexibility and customizability. In order to maximize the benefit of ASIP, automatic ...
Converting thread-level parallelism to instruction-level parallelism via simultaneous multithreading

To achieve high performance, contemporary computer systems rely on two forms of parallelism: instruction-level parallelism (ILP) and thread-level parallelism (TLP). Wide-issue super-scalar processors exploit ILP by executing multiple instructions from a ...
Experiments in Automatic Microcode Generation

A procedure is described which permits applications problems coded in a higher level language to be compiled to microcode for horizontally microprogrammed processors. An experimental language has been designed which is suitable for expressing ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

PLDI '89: Proceedings of the ACM SIGPLAN 1989 conference on Programming language design and implementation

June 1989

355 pages

ISBN:089791306X

DOI:10.1145/73141

Editor:
R. L. Wexelblat
ACM Headquarters, New York, NY

ACM SIGPLAN Notices Volume 24, Issue 7
Proceedings of the SIGPLAN '89 symposium on Interpreters and interpretive techniques
July 1989
355 pages
ISSN:0362-1340
EISSN:1558-1160
DOI:10.1145/74818
Editor:
Richard Wexelblat
Issue’s Table of Contents

Copyright © 1989 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

SIGPLAN: ACM Special Interest Group on Programming Languages

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 21 June 1989

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

PLDI89

Sponsor:

SIGPLAN

PLDI89: Programming Language Design & Implementation

June 19 - 23, 1989

Oregon, Portland, USA

Acceptance Rates

Overall Acceptance Rate 406 of 2,067 submissions, 20%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

57
Total Citations
View Citations
776
Total Downloads

Downloads (Last 12 months)99
Downloads (Last 6 weeks)23

Reflects downloads up to 12 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

Nicolau ALi GKejariwal A(2009)Techniques for efficient placement of synchronization primitivesACM SIGPLAN Notices10.1145/1594835.150420744:4(199-208)Online publication date: 14-Feb-2009
https://dl.acm.org/doi/10.1145/1594835.1504207
Nicolau ALi GVeidenbaum AKejariwal AGschwind MNicolau ASalapura VMoreira J(2009)Synchronization optimizations for efficient execution on multi-coresProceedings of the 23rd international conference on Supercomputing10.1145/1542275.1542303(169-180)Online publication date: 8-Jun-2009
https://dl.acm.org/doi/10.1145/1542275.1542303
Nicolau ALi GKejariwal AReed DSarkar V(2009)Techniques for efficient placement of synchronization primitivesProceedings of the 14th ACM SIGPLAN symposium on Principles and practice of parallel programming10.1145/1504176.1504207(199-208)Online publication date: 14-Feb-2009
https://dl.acm.org/doi/10.1145/1504176.1504207
Zhu MCai WLee BWu X(2005)A Hybrid Analysis of an Optimization Approach for Cluster ApplicationsThe Journal of Supercomputing10.1007/s11227-005-0157-732:3(191-215)Online publication date: 1-Jun-2005
https://dl.acm.org/doi/10.1007/s11227-005-0157-7
Ming Zhu Yang Wang Meng Ding (2004)Dynamic key messaging for cluster computingThird IEEE International Symposium on Network Computing and Applications, 2004. (NCA 2004). Proceedings.10.1109/NCA.2004.1347777(192-199)Online publication date: 2004
https://doi.org/10.1109/NCA.2004.1347777
Zhu MKatsinis CCai WLee B(2004)Key Messaging on SOME-Bus clustersParallel Computing10.1016/j.parco.2004.07.00430:8(947-971)Online publication date: 1-Aug-2004
https://dl.acm.org/doi/10.1016/j.parco.2004.07.004
Zhu Genjiang Xe Li Sun Zhongxiu (1996)PRG: procedure reference analysis in extracting non-data parallelismProceedings of 1996 IEEE Second International Conference on Algorithms and Architectures for Parallel Processing, ICA/sup 3/PP '9610.1109/ICAPP.1996.562907(446-450)Online publication date: 1996
https://doi.org/10.1109/ICAPP.1996.562907
Girkar MPolychronopoulos C(1995)Extracting task-level parallelismACM Transactions on Programming Languages and Systems10.1145/210184.21018917:4(600-634)Online publication date: 1-Jul-1995
https://dl.acm.org/doi/10.1145/210184.210189
Cosnard MLoi M(1995)Automatic task graph generation techniquesProceedings of the Twenty-Eighth Hawaii International Conference on System Sciences10.1109/HICSS.1995.375471(113-122)Online publication date: 1995
https://doi.org/10.1109/HICSS.1995.375471
Pande SAgrawal DMauney J(1995)A Scalable Scheduling Scheme for Functional Parallelism on Distributed Memory Multiprocessor SystemsIEEE Transactions on Parallel and Distributed Systems10.1109/71.3727926:4(388-399)Online publication date: 1-Apr-1995
https://dl.acm.org/doi/10.1109/71.372792
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 Table of Contents