Abstract
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.
Preview
Unable to display preview. Download preview PDF.
References
Banerjee, U., “Data Dependence in Ordinary Programs,” M.S. thesis, Univ. of Ill at Urbana-Champaign, Nov., 1976.
Banerjee, U., “Speedup of Ordinary Programs,” Ph.D. thesis, Univ. of Ill at Urbana-Champaign, 1979.
Banerjee, U., Dependence Analysis for Supercomputing, Kluwer Academic Publishers, Norwell, Mass., 1988.
Burke, M., and R. Cytron, “Interprocedural Dependence Analysis and Parallelization,” Proceedings of SIGPLAN '86 Symposium on Compiler Construction. Palo Alto, CA, June, 1986.
Ferrante, Jeanne, Karl J. Ottenstein, and Joe D. Warren, “The Program Dependence Graph and its Use in Optimization” ACM Trans. on Prog. Lang. and Systems, Vol. 9, No. 3, July, 1987.
Wolfe, Michael, “Optimizing Supercompilers for Supercomputers,” Ph.D. Thesis, Univ. of Ill. at Urbana-Champaign, Oct., 1982.
Wolfe, Michael, Optimizing Supercompilers for Supercomputers, Pitman Publishing Co., London, and MIT Press, Cambridge, Mass, 1989.
Klappholz, D., K. Psarris, and X. Kong, “On the Perfect Accuracy of an Approximate Subscript Analysis Test,” Proceedings of the International Conference on Supercomputing. Amsterdam, June 1990.
Psarris, K., “A Formal Study of Data Dependence Analysis for Parallelizing Compilers,” PhD Thesis, Stevens Institute of Technology, Hoboken, NJ, December, 1990.
Psarris, K., D. Klappholz, and X. Kong, “On the Accuracy of the Banerjee Test,” to appear in Journal of Parallel and Distributed Computing, June 1991.
Lu, L., and M. Chen, “Subdomain Dependence Test for Massive Parallelism,” in Proceedings of Supercomputing '90, NY, Nov. 1990.
Allen, J.R., “Dependence Analysis for Subscripted Variables and its Application to Program Transformations”, Ph.D. Thesis, Rice University, April, 1983
Psarris, K., D. Klappholz, and X. Kong, “On the Accuracy of the Banerjee-Wolfe Test,” technical report, Stevens Institute of Technology, Department of Electrical Engineering and Computer Science, January 1991.
Wolfe, M., and C.-W. Tseng, “The Power Test for Data Dependence,” technical report, Oregon Graduate Institute of Science and technology.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Klappholz, D., Kong, X. (1993). Extending the Banerjee-Wolfe test to handle execution conditions. In: Banerjee, U., Gelernter, D., Nicolau, A., Padua, D. (eds) Languages and Compilers for Parallel Computing. LCPC 1992. Lecture Notes in Computer Science, vol 757. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57502-2_65
Download citation
DOI: https://doi.org/10.1007/3-540-57502-2_65
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57502-3
Online ISBN: 978-3-540-48201-7
eBook Packages: Springer Book Archive