Article

Free access

The Omega test: a fast and practical integer programming algorithm for dependence analysis

Author:

William PughAuthors Info & Claims

Supercomputing '91: Proceedings of the 1991 ACM/IEEE conference on Supercomputing

Pages 4 - 13

https://doi.org/10.1145/125826.125848

Published: 01 August 1991 Publication History

PDF eReader

References

[1]

Corinne Ancourt and Pran(jois Irigoin. Scanning polyhedra with do loops. In PPOPP '91, 1991.

Digital Library

Google Scholar

[2]

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

Digital Library

Google Scholar

[3]

J.R. Allen. Dependence Analysis for Subscripted Variables and Its Application to Program Transformations. PhD thesis, Rice University, April 1983.

Digital Library

Google Scholar

[4]

U. Banerjee. Dependence AnaIyszs }or Supercomputing. Kluwer Academic Publishers, Boston, MA, 1988.

Digital Library

Google Scholar

[5]

M. Burke and R. Cytron. Interprocedural dependence analysis and parallelization. In em Proceedings of the SIGPLAN '86 Symposium on Compiler Construction, Palo Alto, CA, July 1986.

Digital Library

Google Scholar

[6]

V. Balasundaram and K. Kennedy. A technique for summarizing data access and its use in parallelism enhancing transformations. In SIGPLAN Conference on Programming Language Design and Implementation, '89, June 1989.

Digital Library

Google Scholar

[7]

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

Crossref

Google Scholar

[8]

G. Goff, Kenn Kennedy, and Chau-Wen Tseng. Practical dependence testing. In ACM SIGPLAN'91 Conference on Programming Language Design and Implementation, 1991.

Digital Library

Google Scholar

[9]

Paul Havlak and Ken Kennedy. Experience with interprocedural analysis of array side effects. In Supercomputing '90, 1990.

Digital Library

Google Scholar

[10]

M. Haghighat and C. Polychronopoulos. Symbolic dependence analysis for high performance parallelizing compilers. In Proceedings of the Third Workshop on Language8 and Compilers for Parallel Computing, August 1990.

Google Scholar

[11]

Pranqois Irigoin, Pierre Jouvelot, and P&mi Triolet. Semantical interprocedural paxallelization: An overview of the pips project. In ICS '91, 1991.

Digital Library

Google Scholar

[12]

D. Kuck, Y. Muraoka, and S. Chen. On the number of operations simultaneously executable in FORTRAN- like programs and their resulting speedup. IEEE Transactions on Computers, 1972.

Digital Library

Google Scholar

[13]

L. Lu and M. Chen. Subdomain dependence test for massive parallelism. In Proceedings of Supercomputing '90, New York, NY, November 1990.

Digital Library

Google Scholar

[14]

A. Lichnewsky and F. Thomasset. Introducing symbolic problem solving techniques in the dependence testing phases of a vectorizer. In Proceedings of the Second International Conference on Supercomputing, St. Malo, France, July 1988.

Digital Library

Google Scholar

[15]

Z. Li and P. Yew. Some results on exact data dependence analysis. In D. Gelernter, A. Nicolau, and D. Padua, editors, Languages and Compilers for Parallel Computing. The MIT Press, 1990.

Digital Library

Google Scholar

[16]

Z. Li, P. Yew, and C. Zhu. Data dependence analysis on multi-dimensional array references. In Proceedings of the 1989 A CM International Conference on Supercomputing, June 1989.

Digital Library

Google Scholar

[17]

D. E. Maydan, J. L. Hennessy, and M. S. Lain. Efficient and exact data dependence analysis. In A CM SIGPLAN'91 Conference on Programming Language Design and Implementation, 1991.

Digital Library

Google Scholar

[18]

Y. Muraoka. Parallelism Exposure and Exploitation in Programs. PhD thesis, Dept. of Computer Science, University of Illinois at Urbana-Champaign, February 1971.

Digital Library

Google Scholar

[19]

William Pugh. Uniform methods for loop optimization. In 1991 International Conference on Supercomputing, Cologne, Germany, June 1991.

Digital Library

Google Scholar

[20]

R. Shostak. Deciding linear inequalities by computing loop residues. Journal of the A CM, 28(4):769-779, October 1981.

Digital Library

Google Scholar

[21]

R. Triolet. Interprocedural analysis for program restructuring with Parafrase. CSRD Rpt. 538, Dept. of Computer Science, University of Illinois at Urbana- Champaign, December 1985.

Google Scholar

[22]

D. Wallace. Dependence of multi-dimensional array references. In Proceedings of the Second International Conference on Supercomputing, St. Malo, France, July 1988.

Digital Library

Google Scholar

[23]

M.J. Wolfe. Optimzzing SupercompiIers for Supercomputers. PhD thesis, Dept. of Computer Science, University of Illinois at Urbana-Champaign, October 1982.

Digital Library

Google Scholar

[24]

Michael Wolfe. Optimizing Supercompilers for Supercomputers. Pitman Publishing, London, 1989.

Digital Library

Google Scholar

[25]

Michael Wolfe. The tiny loop restructuring research tool. In Proc of 1991 International Conference on Parallel Processing, 1991.

Google Scholar

[26]

Michael Wolfe and Chau-Wen Tseng. The power test for data dependence. Technical Report CS/E 90-015, Oregon Graduate Institute, August 1990.

Google Scholar

Cited By

View all

Gorius JRokicki SDerrien SRodríguez GSadayappan PSukumaran-Rajam A(2024)A Unified Memory Dependency Framework for Speculative High-Level SynthesisProceedings of the 33rd ACM SIGPLAN International Conference on Compiler Construction10.1145/3640537.3641581(13-25)Online publication date: 17-Feb-2024
https://dl.acm.org/doi/10.1145/3640537.3641581
Hsiao SHu J(2024)Decision-Making on Power Bank Design with Human-Generated Power Using Fuzzy Theory2024 IEEE 7th Eurasian Conference on Educational Innovation (ECEI)10.1109/ECEI60433.2024.10510800(382-387)Online publication date: 26-Jan-2024
https://doi.org/10.1109/ECEI60433.2024.10510800
Akshay SChakraborty SGoharshady AGovind RMotwani HVaranasi S(2024)Practical Approximate Quantifier Elimination for Non-linear Real ArithmeticFormal Methods10.1007/978-3-031-71162-6_6(111-130)Online publication date: 11-Sep-2024
https://doi.org/10.1007/978-3-031-71162-6_6
Show More Cited By

Index Terms

The Omega test: a fast and practical integer programming algorithm for dependence analysis

Recommendations

Fast Integer Sorting in Linear Space
STACS '00: Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science

We present a fast deterministic algorithm for integer sorting in linear space. Our algorithm sorts n integers in linear space in O(n(log log n)^1:5) time. This improves the O(n(log log n)²) time bound given in [11]. This result is obtained by combining ...
Improved Fast Integer Sorting in Linear Space

We present a fast deterministic algorithm for integer sorting in linear space. Our algorithm sorts n integers in the range {0, 1, 2, , m 1} in linear space in O(n log log n log log log n) time. When log m log2+ n, >0, we can further achieve O(n log log ...
Parallel integer sorting and simulation amongst CRCW models
Abstract
In this paper a general technique for reducing processors in simulation without any increase in time is described. This results in an O(√logn) time algorithm for simulating one step of PRIORITY on TOLERANT with processor-time product of O(n log ...

Comments

Information & Contributors

Information

Published In

Supercomputing '91: Proceedings of the 1991 ACM/IEEE conference on Supercomputing

August 1991

920 pages

ISBN:0897914597

DOI:10.1145/125826

Conference Chair:
Ray Elliott

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 August 1991

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

SC '91

Sponsor:

SIGARCH
IEEE-CS

SC '91: International Conference for High Performance Computing, Networking, Storage and Analysis

November 18 - 22, 1991

New Mexico, Albuquerque, USA

Acceptance Rates

Supercomputing '91 Paper Acceptance Rate 83 of 215 submissions, 39%;

Overall Acceptance Rate 1,516 of 6,373 submissions, 24%

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

388
Total Citations
View Citations
3,420
Total Downloads

Downloads (Last 12 months)883
Downloads (Last 6 weeks)240

Reflects downloads up to 06 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Gorius JRokicki SDerrien SRodríguez GSadayappan PSukumaran-Rajam A(2024)A Unified Memory Dependency Framework for Speculative High-Level SynthesisProceedings of the 33rd ACM SIGPLAN International Conference on Compiler Construction10.1145/3640537.3641581(13-25)Online publication date: 17-Feb-2024
https://dl.acm.org/doi/10.1145/3640537.3641581
Hsiao SHu J(2024)Decision-Making on Power Bank Design with Human-Generated Power Using Fuzzy Theory2024 IEEE 7th Eurasian Conference on Educational Innovation (ECEI)10.1109/ECEI60433.2024.10510800(382-387)Online publication date: 26-Jan-2024
https://doi.org/10.1109/ECEI60433.2024.10510800
Akshay SChakraborty SGoharshady AGovind RMotwani HVaranasi S(2024)Practical Approximate Quantifier Elimination for Non-linear Real ArithmeticFormal Methods10.1007/978-3-031-71162-6_6(111-130)Online publication date: 11-Sep-2024
https://doi.org/10.1007/978-3-031-71162-6_6
Murphy CKincaid Z(2024)Quantified Linear Arithmetic Satisfiability via Fine-Grained Strategy ImprovementComputer Aided Verification10.1007/978-3-031-65627-9_5(89-109)Online publication date: 26-Jul-2024
https://doi.org/10.1007/978-3-031-65627-9_5
Habermehl PHavlena VHečko MHolík LLengál O(2024)Algebraic Reasoning Meets Automata in Solving Linear Integer ArithmeticComputer Aided Verification10.1007/978-3-031-65627-9_3(42-67)Online publication date: 24-Jul-2024
https://dl.acm.org/doi/10.1007/978-3-031-65627-9_3
Amat NDal Zilio SLe Botlan D(2024)Project and Conquer: Fast Quantifier Elimination for Checking Petri Net ReachabilityVerification, Model Checking, and Abstract Interpretation10.1007/978-3-031-50524-9_5(101-123)Online publication date: 15-Jan-2024
https://dl.acm.org/doi/10.1007/978-3-031-50524-9_5
Mastoras AYzelman AChen QHuang ZSi M(2023)Studying the expressiveness and performance of parallelization abstractions for linear pipelinesProceedings of the 14th International Workshop on Programming Models and Applications for Multicores and Manycores10.1145/3582514.3582522(29-38)Online publication date: 25-Feb-2023
https://dl.acm.org/doi/10.1145/3582514.3582522
Sundararajah KSaumya CKulkarni M(2022)UniRec: a unimodular-like framework for nested recursions and loopsProceedings of the ACM on Programming Languages10.1145/35633336:OOPSLA2(1264-1290)Online publication date: 31-Oct-2022
https://dl.acm.org/doi/10.1145/3563333
Shah NMisra AMiné AVenkat RUpadrasta R(2022) BullsEye : Scalable and Accurate Approximation Framework for Cache Miss CalculationACM Transactions on Architecture and Code Optimization10.1145/355800320:1(1-28)Online publication date: 17-Nov-2022
https://dl.acm.org/doi/10.1145/3558003
Tang SZhai JWang HJiang LZheng LYuan ZZhang CJhala RDillig I(2022)FreeTensor: a free-form DSL with holistic optimizations for irregular tensor programsProceedings of the 43rd ACM SIGPLAN International Conference on Programming Language Design and Implementation10.1145/3519939.3523448(872-887)Online publication date: 9-Jun-2022
https://dl.acm.org/doi/10.1145/3519939.3523448
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

Fast Integer Sorting in Linear Space

Improved Fast Integer Sorting in Linear Space

Parallel integer sorting and simulation amongst CRCW models