article

Free access

Automatic generation of DAG parallelism

Authors:

W. HsiehAuthors Info & Claims

ACM SIGPLAN Notices, Volume 24, Issue 7

Pages 54 - 68

https://doi.org/10.1145/74818.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

Alrasheed HMelton A(2022)Measuring nestingIET Software10.1049/sfw2.12069Online publication date: 2-Aug-2022
https://doi.org/10.1049/sfw2.12069
Alrasheed HMelton A(2016)Scope of Selection Nodes in Object Oriented Programs2016 IEEE 40th Annual Computer Software and Applications Conference (COMPSAC)10.1109/COMPSAC.2016.185(203-208)Online publication date: Jun-2016
https://doi.org/10.1109/COMPSAC.2016.185
Alrasheed HMelton A(2014)Understanding and Measuring NestingProceedings of the 2014 IEEE 38th Annual Computer Software and Applications Conference10.1109/COMPSAC.2014.37(273-278)Online publication date: 21-Jul-2014
https://dl.acm.org/doi/10.1109/COMPSAC.2014.37
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 SIGPLAN Notices

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

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

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]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 21 June 1989

Published in SIGPLAN Volume 24, Issue 7

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

57
Total Citations
View Citations
752
Total Downloads

Downloads (Last 12 months)78
Downloads (Last 6 weeks)19

Reflects downloads up to 06 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

Alrasheed HMelton A(2022)Measuring nestingIET Software10.1049/sfw2.12069Online publication date: 2-Aug-2022
https://doi.org/10.1049/sfw2.12069
Alrasheed HMelton A(2016)Scope of Selection Nodes in Object Oriented Programs2016 IEEE 40th Annual Computer Software and Applications Conference (COMPSAC)10.1109/COMPSAC.2016.185(203-208)Online publication date: Jun-2016
https://doi.org/10.1109/COMPSAC.2016.185
Alrasheed HMelton A(2014)Understanding and Measuring NestingProceedings of the 2014 IEEE 38th Annual Computer Software and Applications Conference10.1109/COMPSAC.2014.37(273-278)Online publication date: 21-Jul-2014
https://dl.acm.org/doi/10.1109/COMPSAC.2014.37
Honda HKasahara H(2007)Coarse grain parallelism detection scheme of a fortran programSystems and Computers in Japan10.1002/scj.469022120322:12(24-36)Online publication date: 22-Mar-2007
https://doi.org/10.1002/scj.4690221203
Kalogeropulos S(2005)Identifying the available parallelism using static analysisParallel Computation10.1007/3-540-57314-3_13(151-165)Online publication date: 29-May-2005
https://doi.org/10.1007/3-540-57314-3_13
Hanson RHopkins T(2004)Algorithm 830ACM Transactions on Mathematical Software10.1145/974781.97478630:1(86-94)Online publication date: 1-Mar-2004
https://dl.acm.org/doi/10.1145/974781.974786
Aycock J(2003)A brief history of just-in-timeACM Computing Surveys10.1145/857076.85707735:2(97-113)Online publication date: 1-Jun-2003
https://dl.acm.org/doi/10.1145/857076.857077
Guangchun LJun ZXianliang LJun L(2003)HCCMACM SIGOPS Operating Systems Review10.1145/769782.76978637:2(25-36)Online publication date: 1-Apr-2003
https://dl.acm.org/doi/10.1145/769782.769786
Wei QLu XZhou X(2003)DFTSACM SIGOPS Operating Systems Review10.1145/769782.76978537:2(19-24)Online publication date: 1-Apr-2003
https://dl.acm.org/doi/10.1145/769782.769785
Lee SKim WKim HYoo K(2003)Parallizable simple authenticated key agreement protocolACM SIGOPS Operating Systems Review10.1145/769782.76978437:2(13-18)Online publication date: 1-Apr-2003
https://dl.acm.org/doi/10.1145/769782.769784
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