Article

Free access

A framework for determining useful parallelism

Authors:

W. HsiehAuthors Info & Claims

ICS '88: Proceedings of the 2nd international conference on Supercomputing

Pages 207 - 215

https://doi.org/10.1145/55364.55385

Published: 01 June 1988 Publication History

Abstract

An approach to finding and forming parallel processes for both sequential and parallel programs is presented. The approach is presented in a framework that can create useful parallelism for a variety of parallel architectures. The framework makes use of a control dependence graph to capture maximal parallelism, a process tree to expose useful parallelism, renaming and storage segregation to reduce data dependencies, and an architecture-specific cost analyzer to evaluate the effectiveness of the potential processes. The framework is currently being implemented.

References

[1]

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

Digital Library

[2]

Fran 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 Supercomputing, Springer-Verlag, Athens,Greece, 1987. To appear in a special issue of the Journal of Parallel and Distributed Computing.

Digital Library

[3]

John R. Allen. Dependence Analysis for Subscript Variables and Its Application to Program Transformations, PhD thesis, Rice University, Houston, Texas 1983.

Digital Library

[4]

Utpal Banerjee. Speedup of Ordinary Programs, PhD thesis, University of Illinois at Urbana-Champaign, Urbana, Illinois 1979.

Digital Library

[5]

Michael Burke. An Interval Analysis Approach Toward Interprocedural Data Flow, IBM Research, 1984. Report RC10640.

[6]

Michael Burke. An Interval-Based Approach to Exhaustive and Incremental lnterprocedural Data Flow Analysis, IBM Research, August 1987. Research report RC12702, submitted to ACM Transactions on Programming Languages and Systems.

Digital Library

[7]

Michael Burke and Ron Cytron. Interprocedural Dependence Analysis and ParaUelization. Proceedings of the Sigplan "86 Symposium on Compiler Construction, 21(7):162-175, July 1986.

Digital Library

[8]

Michael Burke, Ron Cytron, Jeanne Ferrante, and Wilson Hsieh. Automatic Determination of Private and Shared Variables for Nested Processes, IBM T. J. Watson Research Center, 1987. Research Report RC 13194.

[9]

Michael Burke, Ron Cytron, Jeanne Ferrante, Wilson Hsieh, and David Shields. On the Automatic Generation of Useful Paraltelism: A Tool and an Experiment, IBM T.J. Watson Research Center, July 1988. ACM SIGPLAN Symposium on Parallel Programming: Experience with Applications, Languages, and Systems.

Digital Library

[10]

Ron Cytron and Jeanne Ferrante. What's in a Name? Or the Value of Renaming for Parallelism Detection and Storage Allocation. Proceedings of the 1987 International Conference on Parallel Processing, pages 19-27, St. Charles, IL, August 1987.

[11]

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

[12]

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

[13]

R.L. Graham. Bounds on Multiprocessing Timing Anomalies. SIAM Journal on Applied Mathematics, 17(2)'416-429, March 1969.

[14]

Wilson C. Hsieh. Extracting Parallelism from Sequential Programs, Massachusetts Institute of Technology, 1988. Master's thesis in progress.

[15]

IBM. Parallel Fortran Language and Library Reference, international Business Machines, March 1988. Pub. No. SC23-0431-0.

[16]

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

Digital Library

[17]

Vivek Sarkar. Partitioning and Scheduling Parallel Programs for Execution on Multiprocessors, PhD thesis, Stanford University, Stanford April 1987. Tech. Report CSL-TR-87-328.

Digital Library

[18]

Vivek Sarkar. Synchronization Using Counting Semaphores. 1988 International Conference on Supercomputing, Saint Malo, France, july 1988. (Also published as IBM RC 13482).

Digital Library

[19]

V. Sarkar and J. Hennessy. Partitioning Parallel Programs for Macro-Dataflow. A CM Conference on Lisp and Functional Programming, pages 202-211, Cambridge, MA, August 1986.

Digital Library

[20]

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

Digital Library

Cited By

Deiana ESuchy BWilkins MHomerding BMcMichen TDunajewski KDinda PHardavellas NCampanoni SDubach CBruening DHardekopf B(2023)Program State Element CharacterizationProceedings of the 21st ACM/IEEE International Symposium on Code Generation and Optimization10.1145/3579990.3580011(199-211)Online publication date: 17-Feb-2023
https://dl.acm.org/doi/10.1145/3579990.3580011
Czejdo DDaszczuk WGrześkowiak W(2023)Practical Approach to Introducing Parallelism in Sequential ProgramsDependable Computer Systems and Networks10.1007/978-3-031-37720-4_2(13-27)Online publication date: 11-Aug-2023
https://doi.org/10.1007/978-3-031-37720-4_2
Bubel RHähnle RHeydari Tabar A(2019)A Program Logic for Dependence AnalysisIntegrated Formal Methods10.1007/978-3-030-34968-4_5(83-100)Online publication date: 22-Nov-2019
https://doi.org/10.1007/978-3-030-34968-4_5
Show More Cited By

Index Terms

A framework for determining useful parallelism

Recommendations

A Framework for Exploiting Task and Data Parallelism on Distributed Memory Multicomputers

Distributed Memory Multicomputers (DMMs), such as the IBM SP-2, the Intel Paragon, and the Thinking Machines CM-5, offer significant advantages over shared memory multiprocessors in terms of cost and scalability. Unfortunately, the utilization of all ...
Implicitly-threaded parallelism in Manticore
ICFP '08

The increasing availability of commodity multicore processors is making parallel computing available to the masses. Traditional parallel languages are largely intended for large-scale scientific computing and tend not to be well-suited to programming ...
Work-first and help-first scheduling policies for async-finish task parallelism
IPDPS '09: Proceedings of the 2009 IEEE International Symposium on Parallel&Distributed Processing

Multiple programming models are emerging to address an increased need for dynamic task parallelism in applications for multicore processors and shared-address-space parallel computing. Examples include OpenMP 3.0, Java Concurrency Utilities, Microsoft ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

ICS '88: Proceedings of the 2nd international conference on Supercomputing

June 1988

679 pages

ISBN:0897912721

DOI:10.1145/55364

Editor:
J. Lenfant
Rennes

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

SIGARCH: ACM Special Interest Group on Computer Architecture

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 June 1988

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Acceptance Rates

Overall Acceptance Rate 629 of 2,180 submissions, 29%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

52
Total Citations
View Citations
519
Total Downloads

Downloads (Last 12 months)45
Downloads (Last 6 weeks)14

Reflects downloads up to 30 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Deiana ESuchy BWilkins MHomerding BMcMichen TDunajewski KDinda PHardavellas NCampanoni SDubach CBruening DHardekopf B(2023)Program State Element CharacterizationProceedings of the 21st ACM/IEEE International Symposium on Code Generation and Optimization10.1145/3579990.3580011(199-211)Online publication date: 17-Feb-2023
https://dl.acm.org/doi/10.1145/3579990.3580011
Czejdo DDaszczuk WGrześkowiak W(2023)Practical Approach to Introducing Parallelism in Sequential ProgramsDependable Computer Systems and Networks10.1007/978-3-031-37720-4_2(13-27)Online publication date: 11-Aug-2023
https://doi.org/10.1007/978-3-031-37720-4_2
Bubel RHähnle RHeydari Tabar A(2019)A Program Logic for Dependence AnalysisIntegrated Formal Methods10.1007/978-3-030-34968-4_5(83-100)Online publication date: 22-Nov-2019
https://doi.org/10.1007/978-3-030-34968-4_5
Khatamifard SAkturk IKarpuzcu U(2018)On Approximate Speculative Lock ElisionIEEE Transactions on Multi-Scale Computing Systems10.1109/TMSCS.2017.27734884:2(141-151)Online publication date: 1-Apr-2018
https://doi.org/10.1109/TMSCS.2017.2773488
Agrawal AChoi JGopalakrishnan KGupta SNair ROh JPrener DShukla SSrinivasan VSura Z(2016)Approximate computing: Challenges and opportunities2016 IEEE International Conference on Rebooting Computing (ICRC)10.1109/ICRC.2016.7738674(1-8)Online publication date: Oct-2016
https://doi.org/10.1109/ICRC.2016.7738674
Li Z(2014)Array privatization for parallel execution of loopsACM International Conference on Supercomputing 25th Anniversary Volume10.1145/2591635.2667166(173-182)Online publication date: 10-Jun-2014
https://dl.acm.org/doi/10.1145/2591635.2667166
Renganarayana LSrinivasan VNair RPrener DBlack AD'Hondt TKimelman DRinard MUngar D(2012)Programming with relaxed synchronizationProceedings of the 2012 ACM workshop on Relaxing synchronization for multicore and manycore scalability10.1145/2414729.2414737(41-50)Online publication date: 21-Oct-2012
https://dl.acm.org/doi/10.1145/2414729.2414737
Garcia SJeon DLouie CTaylor MHall MPadua D(2011)KremlinProceedings of the 32nd ACM SIGPLAN Conference on Programming Language Design and Implementation10.1145/1993498.1993553(458-469)Online publication date: 4-Jun-2011
https://dl.acm.org/doi/10.1145/1993498.1993553
Garcia SJeon DLouie CTaylor M(2011)KremlinACM SIGPLAN Notices10.1145/1993316.199355346:6(458-469)Online publication date: 4-Jun-2011
https://dl.acm.org/doi/10.1145/1993316.1993553
Schelle GGrunwald DSchmit HWilton S(2005)CUSPProceedings of the 2005 ACM/SIGDA 13th international symposium on Field-programmable gate arrays10.1145/1046192.1046224(246-257)Online publication date: 20-Feb-2005
https://dl.acm.org/doi/10.1145/1046192.1046224
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

Figures

Tables

Media

View Table of Conten