The Banerjee-Wolfe test is one of the major data dependence tests used in automatic parallelization of sequential code. Though it is only an approximate test, its relatively high accuracy and its relatively low cost account for its great popularity. Being an approximate test, the Banerjee-Wolfe test does, however, sometimes result in a loss of parallelism. One of its potential sources of failure is the fact it does not traditionally take execution conditions into account. The purpose of the present paper is to show that the Banerjee-Wolfe test may be extended to handle simple execution conditions without significant additional cost.
CITATION STYLE
Klappholz, D., & Kong, X. (1993). Extending the Banerjee-Wolfe test to handle execution condition. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 757 LNCS, pp. 464–481). Springer Verlag. https://doi.org/10.1007/3-540-57502-2_65
Mendeley helps you to discover research relevant for your work.