The Banerjee–Wolfe and GCD Tests on Exact Data Dependence Information

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, a sufficient condition for the accuracy of the Banerjee–Wolfe test was stated...

Full description

Saved in:
Bibliographic Details
Published in:Journal of parallel and distributed computing 1996-02, Vol.32 (2), p.119-138
Main Author: Psarris, Kleanthis
Format: Article
Language:English
Subjects:
Algorithmics. Computability. Computer arithmetics
Applied sciences
Computer science
control theory
systems
Exact sciences and technology
Programming theory
Software
Software engineering
Theoretical computing
Citations: Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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, a sufficient condition for the accuracy of the Banerjee–Wolfe test was stated and proved. In that work, we only considered the case of general data dependence, i.e., the case of data dependence without direction vector information. In this paper, we extend the previous result to the case of data dependence subject to an arbitrary direction vector. We also state and prove a sufficient condition for the accuracy of a combination of the GCD and Banerjee–Wolfe tests. Furthermore, we show that the sufficient conditions, for the accuracy of the Banerjee–Wolfe test and the accuracy of a combination of the GCD and Banerjee–Wolfe tests are necessary conditions as well. Finally, we demonstrate how these results can be used in actual practice to obtain exact data dependence information.
ISSN:0743-7315
1096-0848
DOI:10.1006/jpdc.1996.0009