(Enter summary)
Abstract: The Omega
testi
s
ani
nteger
programmi
ng
algori
thm that can
determi
ne whether a dependence
exi
sts
between two array references, and i so, under what condi7: ns. Conventi nalwi[A m holds
thati
nteger
programmiB techni:36 are far too expensi e to be used for dependence analysi6 except as a method of
last resort for si:8 ti ns that cannot be deci:A by si[976 methods. We present
evi[77B
that suggests
thiwi sdomi
s wrong, and that the Omega
testi
s
competi ti
ve
wi
th
approxi
mate
algori
thms... (Update)
Cited by: More
Analyzing Memory Accesses in x86 Binary Executables - Gogul Balakrishnan Thomas
(Correct)
A class of polynomially solvable range constraints for interval .. - Su, Wagner (2005)
(Correct)
Experiences with Enumeration of Integer.. - Verdoolaege.. (2004)
(Correct)
Similar documents (at the sentence level):
16.4%: The Omega Test: a fast and practical integer programming algorithm .. - Pugh (1993)
(Correct)
Similar documents based on text: More All
0.6: Development of a Robust Computational Design Simulator for.. - Zabaras (2002)
(Correct)
0.6: A Directionality based Location Discovery Scheme for Wireless.. - Nasipuri, Li (2002)
(Correct)
0.6: The Stochastic Inventory Routing Problem with Direct.. - Kleywegt, Nori.. (2000)
(Correct)
Related documents from co-citation: More All
21: Some efficient solution to the affine scheduling problem
- Feautrier - 1992
20: Dataflow analysis of array and scalar references
- Feautrier - 1991
19: Supercompilers for Parallel and Vector Computers (context) - Zima, Chapman - 1990
BibTeX entry: (Update)
William Pugh. The Omega Test: A Fast and Practical Integer Programming Algorithm for Dependence Analysis. Supercomputing'91, 1991. http://citeseer.ist.psu.edu/pugh92omega.html More
@inproceedings{ pugh91omega,
author = "William Pugh",
title = "The Omega test: a fast and practical integer programming algorithm for dependence analysis",
booktitle = "Supercomputing",
pages = "4-13",
year = "1991",
url = "citeseer.ist.psu.edu/pugh92omega.html" }
Citations (may not include all citations):
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.umd.edu/~pugh/): More
The Java Memory Model is Fatally Flawed - Pugh (2000)
(Correct)
Compressing Java Class Files - Pugh (1999)
(Correct)
Skip Lists: A Probabilistic Alternative to Balanced Trees - Pugh (1990)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC