article

Free access

Efficient and exact data dependence analysis

Authors:

Dror E. Maydan,

John L. Hennessy,

Monica S. LamAuthors Info & Claims

ACM SIGPLAN Notices, Volume 26, Issue 6

Pages 1 - 14

https://doi.org/10.1145/113446.113447

Published: 01 May 1991 Publication History

PDF eReader

References

[1]

R. Allen and K. Kennedy. Automatic translation of FORTRAN programs to vector form. ACM Transactions on Programming Languages and Systems, 9(4):491-542, October 1987.

Digital Library

Google Scholar

[2]

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

Digital Library

Google Scholar

[3]

U. Banerjee. Dependence Analysis for Supercomputing. Kluwer Academic, 1988.

Digital Library

Google Scholar

[4]

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

Digital Library

Google Scholar

[5]

G. Dantzig and B. C. Eaves. Fourier-motzkin elimination and its dual. Journal of Combinatorial Theory, A(14):288-297, 1973.

Google Scholar

[6]

M. Berry et al. The PERFECT Club benchmarks: effective performance evaluation of supercomputerso Technical Report UIUCSRD Rep. No. 827, University of Illinois Urbana-Champaign, 1989.

Digital Library

Google Scholar

[7]

R. Kannan. Minkowski's convex body theorem and integer programming. Mathematics of Operations Research, 12(3):415-440, August 1987.

Digital Library

Google Scholar

[8]

H.W. Lenstra. Integer programming with a fixed number of variables. Mathematics of Operations Research, 8(4):538-548, 1983.

Digital Library

Google Scholar

[9]

Z. Li and P. Yew. Practical methods for exact data dependency analysis. In Proceedings of the Second Workshop on Languages and Compilers for Parallel Computing, 1989.

Digital Library

Google Scholar

[10]

Z. Li, P. Yew, and C. Zhu. An efficient data dependence analysis for parallelizing compilers. IEEE Transactions on Parallel and Distributed Systems, 1 (1):26-34, Jan 1990.

Digital Library

Google Scholar

[11]

V.R. Pratt. Two easy theories whose combination is hard. Technical report, Mass institue of Technology, Sept. 1977.

Google Scholar

[12]

A. Schrijver. Theory of Linear and Integer Programming. John Wiley & Sons, 1986.

Digital Library

Google Scholar

[13]

Z. Shen, Z. Li, and P. Yew. An empirical study on array subscripts and data dependencies. In Proceedings of 1989 International Conference on Parallel Processing, pages 11-145 to 11-152, 1989.

Google Scholar

[14]

R. Shostak. Deciding linear inequalities by computing loop residues. ACM Journal, 28(4):769-779, Oct 1981.

Digital Library

Google Scholar

[15]

S. Tjiang, M. Wolf, M.S. Lam, K. Pieper, and J.L. Hennessy. An overview of the SUIF compiler system. 1990.

Google Scholar

[16]

R. Triolet. Interproceclural analysis for program restructuring with parafrase. Technical Report CSRD Rep. No. 538, University of illinois Urbana- Champaign, Dec. 1985.

Google Scholar

[17]

D. R. Wallace. Dependence of multi-dimensional array references. In Proceedings of 1988 International Conference on Parallel Processing, pages 418-428, 1988.

Digital Library

Google Scholar

[18]

M. Wolfe. Optimizing Supercompilers for Supercomputers. The MIT Press, 1989.

Digital Library

Google Scholar

Cited By

View all

Abdullah SUllah IKhan F(2024)Analyzing the Deep Learning Techniques Based on Three Way Decision Under Double Hierarchy Linguistic Information and ApplicationIEEE Access10.1109/ACCESS.2023.329233212(85880-85893)Online publication date: 2024
https://doi.org/10.1109/ACCESS.2023.3292332
Midolo ATramontana E(2023)An Automatic Transformer from Sequential to Parallel Java CodeFuture Internet10.3390/fi1509030615:9(306)Online publication date: 8-Sep-2023
https://doi.org/10.3390/fi15090306
Honorio Bde Carvalho JSkaf MAraujo G(2020)Using OpenMP to Detect and Speculate Dynamic DOALL LoopsOpenMP: Portable Multi-Level Parallelism on Modern Systems10.1007/978-3-030-58144-2_15(231-246)Online publication date: 22-Sep-2020
https://dl.acm.org/doi/10.1007/978-3-030-58144-2_15
Show More Cited By

Recommendations

On exact data dependence analysis
ICS '92: Proceedings of the 6th international conference on Supercomputing

The GCD test and the Banerjee-Wolfe test are the two tests traditionally used to determine statement data dependence, subject to direction vectors, in automatic vectorization / parallelization of loops. In an earlier study [14] a sufficient condition ...
Efficient Biclustering Algorithms for Time Series Gene Expression Data Analysis
IWANN '09: Proceedings of the 10th International Work-Conference on Artificial Neural Networks: Part II: Distributed Computing, Artificial Intelligence, Bioinformatics, Soft Computing, and Ambient Assisted Living

We present a summary of a PhD thesis proposing efficient biclustering algorithms for time series gene expression data analysis, able to discover important aspects of gene regulation as anticorrelation and time-lagged relationships, and a scoring method ...
Outlier analysis and top scoring pair for integrated data analysis and biomarker discovery

Pathway deregulation has been identified as a key driver of carcinogenesis, with proteins in signaling pathways serving as primary targets for drug development. Deregulation can be driven by a number of molecular events, including gene mutation, ...

Comments

Information & Contributors

Information

Published In

ACM SIGPLAN Notices Volume 26, Issue 6

June 1991

352 pages

ISSN:0362-1340

EISSN:1558-1160

DOI:10.1145/113446

Editor:
Richard L. Wexelblat
IDA/CSED, Alexandria, VA

Issue’s Table of Contents

PLDI '91: Proceedings of the ACM SIGPLAN 1991 conference on Programming language design and implementation
May 1991
356 pages
ISBN:0897914287
DOI:10.1145/113445
Chairman:
David S. Wise
Indiana Univ., Bloomington

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: 01 May 1991

Published in SIGPLAN Volume 26, Issue 6

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

194
Total Citations
View Citations
1,616
Total Downloads

Downloads (Last 12 months)207
Downloads (Last 6 weeks)34

Reflects downloads up to 26 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Abdullah SUllah IKhan F(2024)Analyzing the Deep Learning Techniques Based on Three Way Decision Under Double Hierarchy Linguistic Information and ApplicationIEEE Access10.1109/ACCESS.2023.329233212(85880-85893)Online publication date: 2024
https://doi.org/10.1109/ACCESS.2023.3292332
Midolo ATramontana E(2023)An Automatic Transformer from Sequential to Parallel Java CodeFuture Internet10.3390/fi1509030615:9(306)Online publication date: 8-Sep-2023
https://doi.org/10.3390/fi15090306
Honorio Bde Carvalho JSkaf MAraujo G(2020)Using OpenMP to Detect and Speculate Dynamic DOALL LoopsOpenMP: Portable Multi-Level Parallelism on Modern Systems10.1007/978-3-030-58144-2_15(231-246)Online publication date: 22-Sep-2020
https://dl.acm.org/doi/10.1007/978-3-030-58144-2_15
Sun MGerchick M(2019)The scales of (algorithmic) justiceAI Matters10.1145/3340470.33404785:2(30-40)Online publication date: 5-Aug-2019
https://dl.acm.org/doi/10.1145/3340470.3340478
Zhang YYang MBaghdadi RKamil SShun JAmarasinghe S(2018)GraphIt: a high-performance graph DSLProceedings of the ACM on Programming Languages10.1145/32764912:OOPSLA(1-30)Online publication date: 24-Oct-2018
https://dl.acm.org/doi/10.1145/3276491
Arabnejad HBispo JBarbosa JCardoso J(2018)AutoPar-ClavaProceedings of the 9th Workshop and 7th Workshop on Parallel Programming and RunTime Management Techniques for Manycore Architectures and Design Tools and Architectures for Multicore Embedded Computing Platforms10.1145/3183767.3183770(13-19)Online publication date: 23-Jan-2018
https://dl.acm.org/doi/10.1145/3183767.3183770
Srinivasan VSharma TReps T(2016)Speeding up machine-code synthesisACM SIGPLAN Notices10.1145/3022671.298400651:10(165-180)Online publication date: 19-Oct-2016
https://dl.acm.org/doi/10.1145/3022671.2984006
Srinivasan VSharma TReps TVisser ESmaragdakis Y(2016)Speeding up machine-code synthesisProceedings of the 2016 ACM SIGPLAN International Conference on Object-Oriented Programming, Systems, Languages, and Applications10.1145/2983990.2984006(165-180)Online publication date: 19-Oct-2016
https://dl.acm.org/doi/10.1145/2983990.2984006
Grégoire TChlipala A(2016)Mostly Automated Formal Verification of Loop Dependencies with Applications to Distributed Stencil AlgorithmsInteractive Theorem Proving10.1007/978-3-319-43144-4_11(167-183)Online publication date: 7-Aug-2016
https://doi.org/10.1007/978-3-319-43144-4_11
Malazgirt GYurdakul ANiar S(2015)Customizing VLIW processors from dynamically profiled execution tracesMicroprocessors & Microsystems10.1016/j.micpro.2015.09.00539:8(656-673)Online publication date: 1-Nov-2015
https://dl.acm.org/doi/10.1016/j.micpro.2015.09.005
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

On exact data dependence analysis

Efficient Biclustering Algorithms for Time Series Gene Expression Data Analysis

Outlier analysis and top scoring pair for integrated data analysis and biomarker discovery