Article

Free access

A technique for summarizing data access and its use in parallelism enhancing transformations

Authors:

V. Balasundaram,

K. KennedyAuthors Info & Claims

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

Pages 41 - 53

https://doi.org/10.1145/73141.74822

Published: 21 June 1989 Publication History

PDF eReader

References

[1]

F. Allen, M. Burke, R. Cytron, J. Ferrante, W. Hsieh, and . Sarkar. A framework for determining useful parallelism. Proceedings of the International Conference on $upercompuiing, St. Malo, France, July 1988.

Digital Library

Google Scholar

[2]

J. R. Allen and K. Kennedy. PFC: A program to convert fortran to parallel form. Technical Report MASC-TR 82-6, Dept. of Mathematical Sciences, Rice University, March 1982.

Google Scholar

[3]

U. Banerjee. Dependence Analysis for Supercompuiing. Kluwer Academic Publishers, 1988.

Digital Library

Google Scholar

[4]

M. Burke and R. Cytron. Interprocedural dependence analysis and parallelization. In Proceedings of the $IGPLAN '86 Symposium on Compiler Construction, pages 162-175, June 1986.

Digital Library

Google Scholar

[5]

D. Callahan. A Global Approach to Parallelism Detection. PhD thesis, Rice University, July 1986.

Google Scholar

[6]

D. Callahan and K. Kennedy. Analysis of interprocedural side effects in a parallel programming environment. In Proceedings of the First International Conference on Supercomputing. Athens, Greece, 1987. Available as Rice University, Department of Computer Science Technical Report TR87-57, July 1987.

Digital Library

Google Scholar

[7]

D. J. Kuck, R. H. Kuhn, B. Leasure, and M. Wolfe. The structure of an advanced vectorizer for pipelined processors. Proceedings of the 8th POPL, pages 207-218, Jan. 1981.

Google Scholar

[8]

Z. Li and P. Yew. interprocedural analysis for parallel computing. Proceedings of the International Conference on Parallel Computing, 1988.

Google Scholar

[9]

C.D. Polychronopoulos. On Program Restructuring, Scheduling and Communication for Parallel Processor Systems. PhD thesis, Univ. of Illinois at Urbana-Champaign, 1986.

Digital Library

Google Scholar

[10]

R. Triolet. Interprocedura} analysis based program restructuring with parafrase. Technical report, Universiy of Illinois, Center for Supercomputing Research and Development, 1986.

Google Scholar

[11]

M. J. Wolfe. Optimizing Supercompilers for Supercompuiers. PhD thesis, Dept. Of Computer Science, University of Illinois at Urbana- Champaign, October 1982.

Digital Library

Google Scholar

Cited By

View all

Irigoin FJouvelot PTriolet R(2014)Semantical interprocedural parallelizationACM International Conference on Supercomputing 25th Anniversary Volume10.1145/2591635.2667163(143-150)Online publication date: 10-Jun-2014
https://dl.acm.org/doi/10.1145/2591635.2667163
Upadrasta RCohen A(2013)Sub-polyhedral scheduling using (unit-)two-variable-per-inequality polyhedraACM SIGPLAN Notices10.1145/2480359.242912748:1(483-496)Online publication date: 23-Jan-2013
https://dl.acm.org/doi/10.1145/2480359.2429127
Upadrasta RCohen AGiacobazzi RCousot R(2013)Sub-polyhedral scheduling using (unit-)two-variable-per-inequality polyhedraProceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages10.1145/2429069.2429127(483-496)Online publication date: 23-Jan-2013
https://dl.acm.org/doi/10.1145/2429069.2429127
Show More Cited By

Index Terms

A technique for summarizing data access and its use in parallelism enhancing transformations

Recommendations

Enhancing channel utilization by improving media access coordination in wireless local area networks

Distributed coordination function (DCF) is the basis protocol for IEEE 802.11 standard wireless local area networks. It is based on carrier sense multiple access with collision avoidance (CSMA-CA) mechanism. DCF uses backoff process to avoid collisions ...
Irregular Coarse-Grain Data Parallelism under LPARX

LPARX is a software development tool for implementing dynamic, irregular scientific applications, such as multilevel finite difference and particle methods, on high-performance multiple instruction multiple data (MIMD) parallel architectures. It ...
Enhancing Parallelism of Data-Intensive Bioinformatics Applications
EUROSIM '13: Proceedings of the 2013 8th EUROSIM Congress on Modelling and Simulation

Bioinformatics data-resources collected from heterogeneous and distributed sources can contain hundreds of Terra-Bytes and the efficient exploration on these large amounts of data is a critical task to enable scientists to gain new biological insight. ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

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

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

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

114
Total Citations
View Citations
677
Total Downloads

Downloads (Last 12 months)93
Downloads (Last 6 weeks)25

Reflects downloads up to 28 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Irigoin FJouvelot PTriolet R(2014)Semantical interprocedural parallelizationACM International Conference on Supercomputing 25th Anniversary Volume10.1145/2591635.2667163(143-150)Online publication date: 10-Jun-2014
https://dl.acm.org/doi/10.1145/2591635.2667163
Upadrasta RCohen A(2013)Sub-polyhedral scheduling using (unit-)two-variable-per-inequality polyhedraACM SIGPLAN Notices10.1145/2480359.242912748:1(483-496)Online publication date: 23-Jan-2013
https://dl.acm.org/doi/10.1145/2480359.2429127
Upadrasta RCohen AGiacobazzi RCousot R(2013)Sub-polyhedral scheduling using (unit-)two-variable-per-inequality polyhedraProceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages10.1145/2429069.2429127(483-496)Online publication date: 23-Jan-2013
https://dl.acm.org/doi/10.1145/2429069.2429127
Meng JMorozov VKumaran KVishwanath VUram TLathrop SCosta JKramer W(2011)GROPHECYProceedings of 2011 International Conference for High Performance Computing, Networking, Storage and Analysis10.1145/2063384.2063402(1-11)Online publication date: 12-Nov-2011
https://dl.acm.org/doi/10.1145/2063384.2063402
Guo JStiles MYi QPsarris K(2011)Enhancing the Role of Inlining in Effective Interprocedural ParallelizationProceedings of the 2011 International Conference on Parallel Processing10.1109/ICPP.2011.68(265-274)Online publication date: 13-Sep-2011
https://dl.acm.org/doi/10.1109/ICPP.2011.68
Li JMa XYoginath SKora GSamatova N(2011)Transparent runtime parallelization of the R scripting languageJournal of Parallel and Distributed Computing10.1016/j.jpdc.2010.08.01371:2(157-168)Online publication date: 1-Feb-2011
https://dl.acm.org/doi/10.1016/j.jpdc.2010.08.013
Aydonat UAbdelrahman T(2010)Parallelization of multimedia applications on the multi-level computing architectureJournal of Embedded Computing10.5555/2598884.25988854:3,4(87-106)Online publication date: 1-Jul-2010
https://dl.acm.org/doi/10.5555/2598884.2598885
Lee JKim JSeo SKim SPark JKim HDao TCho YSeo SLee SCho SSong HSuh SChoi JSalapura VGschwind MKnoop J(2010)An OpenCL framework for heterogeneous multicores with local memoryProceedings of the 19th international conference on Parallel architectures and compilation techniques10.1145/1854273.1854301(193-204)Online publication date: 11-Sep-2010
https://dl.acm.org/doi/10.1145/1854273.1854301
Lu YWang W(2009)Research on early warning system for foreign capital utilization riskJournal of Chinese Economic and Foreign Trade Studies10.1108/175444009109343512:1(62-75)Online publication date: 6-Feb-2009
https://doi.org/10.1108/17544400910934351
Bagnara RHill PZaffanella E(2009)Weakly-relational shapes for numeric abstractionsFormal Methods in System Design10.1007/s10703-009-0073-135:3(279-323)Online publication date: 1-Dec-2009
https://dl.acm.org/doi/10.1007/s10703-009-0073-1
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

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

Cited By

Index Terms

Recommendations

Enhancing channel utilization by improving media access coordination in wireless local area networks

Irregular Coarse-Grain Data Parallelism under LPARX

Enhancing Parallelism of Data-Intensive Bioinformatics Applications