Abstract
The Omega test is an exact, (worst case) exponential time data dependence test. The I-Test is a polynomial time test, but is not always exact. In this paper we show the fundamental relationship between the two tests under conditions in which both tests are applicable. We show that Fourier-Motzkin Variable Elimination (FMVE), upon which the Omega test is based, is equivalent to the Banerjee Bounds Test when applied to single-dimensional array reference problems. Furthermore, we show the Omega Test’s technique to refine Fourier-Motzkin Variable Elimination to integer solutions (dark shadow) is equivalent to the I-Test’s refinement of the Banerjee Bounds Test (the interval equation). Finally, under the conditions we specify, we show the I-Test delivers an inconclusive answer if and only if the Omega test would require an exhaustive search to produce an exact answer (the so-called “Omega Test Nightmare”).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Williams, H.P. (1976). Fourier-Motzkin Elimination Extension to Integer Programming Problems. Journal of Combinatorial Theory (A), 21:118–123.
Williams, H.P. (1983). A Characterisation of All Feasible Solutions to an Integer Program. Discrete Applied Mathematics, 5:147–155.
Wolfe, Michael (1996). High Performance Compilers for Parallel Computing, Redwood City, Ca.: Addison-Wesley Publishing Company.
U. Banerjee (1988). Dependence Analysis for SuperComputing, Norwell, Mass.: Kluwer Academic Publishers.
U. Banerjee (1997). Dependence Analysis, Boston, Mass.: Kluwer Academic Publishers. p. 106
Psarris, Kleanthis, David Klappholz, and Xiangyun Kong (1991). On the Accuracy of the Banerjee Test. Journal of Parallel and Distributed Computing, June, 12(2):152–158.
Kong, Xiangyun, Psarris Kleanthis, and David Klappholz (1991). The I-Test: An Improved Dependence Test for Automatic Parallelization and Vectorization. IEEE Transactions on Parallel and Distributed Systems, July, 2(3): 342–349.
Psarris, Kleanthis, Xiangyun Kong, and David Klappholz (1993). The Direction Vector I-Test. IEEE Transactions on Parallel and Distributed Systems, November, 4(11):1280–1290.
Psarris, Kleanthis, and Santosh Pande (1994). An Empirical Study of the I-Test for Exact Data Depedence. 1994 International Conference on Parallel Processing August, 1994
Pugh, William (1991) The Omega Test: A Fast and Practical Integer Programming Algorithm for Dependence Analysis. Supercomputing’ 91
Pugh, William (1992). A Practical Algorithm for Exact Array Dependence Analysis. Communications of the ACM, August, 35(8): 102–114.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Niedzielski, D., Psarris, K. (2000). An Analytical Comparison of the I-Test and Omega Test. In: Carter, L., Ferrante, J. (eds) Languages and Compilers for Parallel Computing. LCPC 1999. Lecture Notes in Computer Science, vol 1863. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44905-1_16
Download citation
DOI: https://doi.org/10.1007/3-540-44905-1_16
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67858-8
Online ISBN: 978-3-540-44905-8
eBook Packages: Springer Book Archive