Abstract
This paper descrives the design and implementation of the automatic vectorizing and paralellizing compiler named V-Pascal Version 3. The compiler is designed as a workbench on which various vectorizing and parallelizing techniques are evaluated. Now this compiler has the ability of vectorizing/parallelizing multiply-nested loops as reduced single loops, vectorizing while-loops and recursive calls, analyzing aliases caused by pointers, detecting dynamic data-structures such as linkedlists and so on. These special techniques can be applied not only for Pascal.
Preview
Unable to display preview. Download preview PDF.
References
T. Tsuda and Y. Kunieda, “V-Pascal: An Automatic Vectorizing Compiler for Pascal with No Language Extensions,” Journal of Supercomputing, 4: 251–275, 1990.
T. Tsuda, “Design and Implementation of a Vectorizing Compiler for the BlockStructured Language Pascal,” Supercomputer, 46 (VIII-6): 12–21, 1991.
Cooper, K.D. Analyzing Aliases of Reference Formal Parameters, Conf. Rec. Twelfth ACM Symposium on Principles of Programming Languages (Jan.), pp. 281–290. 1985.
A. Matsumoto, Han D.S., and T. Tsuda, ”Alias Analysis of Pointers in Pascal and Fortran 90, Part I. Dependence Analysis between Pointer References,” in press for Acta Informatica, 1995.
Pugh, W., “The Omega Test: a fast and practical integer programming algorithm for dependence analysis”, Proceedings of Supercomputing '91, pp.4–13.
I. Mizunuma, T. Uehara, Y. Okabe, Y. Kunieda and T. Tsuda, “Data-Dependence Analysis of Nested Loops Containing Symbolics and Nonlinear Expressions,” Proc. of the 9th National Convention of Japan Society for Software Science and Technology ] (Fujisawa, Sept. 1992), pp. 485–488, 1992 (in Japanese).
Uehara, T. and Tsuda, T., Benchmarking Vector Indirect LoadlStore Instructions, Workshop on Benchmarking and Performance Evalutation in High Performance Computing (Tokyo, Japan), pp.16–25, 1993.
Hockney, R. W. and Jesshope, C. R., “Parallel Computers 2”, Adam Hilger, 1988.
M.Wolfe, “Optimizing Supercompilers for Supercomputers”, MIT Press, 1989.
K. Suehiro and T. Tsuda, “Automatic Vectorization/Parallelization of WHILE Loops,” Proc. 45th Annual Convention IPS Japan (Tokushima, Nov. 1992), pp. 5–51 & 52, 1992 (in Japanese).
H.Murai, K.Suehiro, Y.Okabe, K.Kunieda, T.Tsuda, “Vectorizing while loops by loop interchange”, Proc. of the 11th National Convention of Japan Society for Software Science and Technology (Osaka, Mar. 1994), pp.65–68, 1994 (in Japanese).
M. Nakamura and T. Tsuda, “A Fast Algorithm for First Order Recurrences on Vector Supercomputers”, Transactios of Information Processing Society of Japan, Vol.36, No.3, pp. 669–680, 1995 (in Japanese).
K. Umeda, T. Uehara and T. Tsuda, “An Automatic Parallelizing Compiler for Distributed Memory Parallel Computer V-Pascal/DM,” Proc. 48th Annual Convention IPS Japan (Kashiwa, March 1994), paper 5G-1, 1994 (in Japanese).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Uehara, T., Kunieda, Y., Tsuda, T. (1997). An automatic vectorizing/parallelizing Pascal compiler V-Pascal ver. 3. In: Polychronopoulos, C., Joe, K., Araki, K., Amamiya, M. (eds) High Performance Computing. ISHPC 1997. Lecture Notes in Computer Science, vol 1336. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0024217
Download citation
DOI: https://doi.org/10.1007/BFb0024217
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63766-0
Online ISBN: 978-3-540-69644-5
eBook Packages: Springer Book Archive