Abstract
In this paper, a new loop transformation is proposed that can exploit parallelism in loops which cannot be found by tradtional methods. Then the method is extended to show how to achieve maximum speedup of loops if there are infinite processors and how to balance the workload of parallel sections in loops if there is fixed number of processors.
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.References
Allen J, Kennedy K. Automatic translation of Fortran programs to vector form.ACM Trans. Programming Languages and Systems, 1987, 9(4).
Wolfe M J. Optimizing supercompilers for supercomputers. Ph.D. thesis, UIUC, 1982.
Pugh W. A practical algorithm for exact array dependence analysis.CACM, 1992, 35(8).
Banerjee U. Unimodular Transformations of Double Loops. InAdvances in Languages and Compilers for Parallel Processing, Cambridge, MA: MIT Press, 1991.
Polychronopoulos C D. Parallel Programming and Compilers. Kluwer Academic Publishers, 1988.
Padua D, Wolfe M. Advanced compiler optimization for supercomputers.CACM, 1986, 29(2).
Li Z. Array privatization for parallel execution of loops. InProc. Int. Conf. on Supercomputing, July, 1992.
Chen D K. MaxPar: An execution driven simulation for studying parallel systems. Technical Report 917, CSRD UIUC, Oct. 1989.
Blume B, Eigenmann Ret al. The next generation in parallelizing compilers. InSeventh Annual Workshop on Languages and Compilers for Parallel Computing, Cornell University, Aug. 1994.
Kennedy K, McKinley K S. Loop distribution with arbitrary control flow. InProc. Supercomputing’90, IEEE Computer Society. Press, Nov. 1990.
Banerjee U, Eigenmann R, Nicolau A, Padua D. Automatic program parallelization. InProceedings of the IEEE, 1993, 81(2)
Padua D. Multiprocessors discussion of some theoretical and practical problem. Ph.D. thesis, UIUC, Nov. 1979.
Author information
Authors and Affiliations
Additional information
Supported by National Natural Science Foundation of China, National ‘863’ High-Tech Programme and the Climbing Program.
Tang Weiyu received his B.S. degree in 1993 and M.S. degree in 1996 both in computer science from Fufan University. From fall 1996, he is a Ph.D. candidate in computer science at University of California, Irvine. His research interests include compilers, parallel processing and programming language.
Shi Wu received his B.S. degree in 1993 and M.S. degree in 1996 both in computer science from Fufan University. In the fall 1996, he became an Assistant Lecturer in Institute of Parallel Processing, Fudan University. His research interests are parallel processing and program analysis compiler.
Zang Binyu received his B.S. degree in 1987 and M.S. degree in 1990 both in computer science from Fufan University. He is currently a Lecturer in Institute of Parallel Processing, Fudan University. His research interests include compilers, parallel processing and algorithm.
Zhu Chuanqi received his B.S. degree in mathematics from Fufan University in 1965. From 1982 to 1988 he was a member of the Academic Staff at the Center for Supercomputing Research and Development at the University of Illinois at Urbana-Champaign. He is now a Professor of computer science in Fudan University and the Director of Institute of Parallel Processing, Fudan University. His research interests are interconnection networks, parallel processing, and computer architecture.
Rights and permissions
About this article
Cite this article
Tang, W., Shi, W., Zang, B. et al. Exploiting loop parallelism with redundant execution. J. of Comput. Sci. & Technol. 12, 105–112 (1997). https://doi.org/10.1007/BF02951329
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02951329