TY - JOUR
T1 - On the accuracy of the Banerjee test
AU - Psarris, Kleanthis
AU - Klappholz, David
AU - Kong, Xiangyun
PY - 1991/6
Y1 - 1991/6
N2 - The Banerjee test is commonly considered to be the more accurate of the two major approximate tests used in automatic vectorization/parallelization of loops, the other being the GCD test. From its derivation, however, there is no simple explanation of why the Banerjee test should be nearly as accurate as it is given credit for. We prove a sufficient condition for the Banerjee test's accuracy and explain the test's perceived superiority by showing that under circumstances which occur extremely frequently in actual code, it is, in fact, not approximate, but perfectly accurate.
AB - The Banerjee test is commonly considered to be the more accurate of the two major approximate tests used in automatic vectorization/parallelization of loops, the other being the GCD test. From its derivation, however, there is no simple explanation of why the Banerjee test should be nearly as accurate as it is given credit for. We prove a sufficient condition for the Banerjee test's accuracy and explain the test's perceived superiority by showing that under circumstances which occur extremely frequently in actual code, it is, in fact, not approximate, but perfectly accurate.
UR - http://www.scopus.com/inward/record.url?scp=33745192514&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=33745192514&partnerID=8YFLogxK
U2 - 10.1016/0743-7315(91)90019-6
DO - 10.1016/0743-7315(91)90019-6
M3 - Article
AN - SCOPUS:33745192514
SN - 0743-7315
VL - 12
SP - 152
EP - 157
JO - Journal of Parallel and Distributed Computing
JF - Journal of Parallel and Distributed Computing
IS - 2
ER -