The ParaScope programming environment, under de velopment at Rice University, has been designed to as sist in the formulation, implementation, and debugging of parallel Fortran programs. In its implementation, ParaScope merges the technologies of automatic paral lelism detection and integrated programming environ ments. This paper discusses the issues that underlie the design of ParaScope's editor, compiler, and debugger. The editor includes mechanisms for viewing and manip ulating the program's dependence structure. The compi lation system uses information from the various tools in the programming environment to optimize entire pro grams for specific parallel architectures. The debugging system includes facilities for remote debugging on par allel machines, using information from the editor and compiler to help isolate schedule-dependent errors.
Get full access to this article
View all access options for this article.
References
1.
Allen, F., Burke, M., Charles, P., Cytron, R., and Ferrante, J.1987. An overview of the PTRAN analysis system for multiprocessing. Lecture Notes in Comput. Sci.297:194-211.
2.
Allen, J.R., Baumgartner, D., Kennedy, K., and Porterfield, A.1986. PTOOL: a semi-automatic parallel programming assistant . In Proceedings of the 1986 international conference on parallel processing. Washington, D.C.: IEEE Computer Society Press, pp. 164-170.
3.
Allen, J.R., Callahan, D., and Kennedy, K.1987. Automatic decomposition of scientific programs for parallel execution. In Conference record, 14th ACM symposium on principles of programming languages. New York: ACM, pp. 63-76.
4.
Allen, J.R., and Kennedy, K.1985. A parallel programming environment. IEEE Software2(4):21-29.
5.
Allen, J.R., and Kennedy, K.1986. Vector register allocation. TR-86-45. Houston: Rice University, Department of Computer Science.
6.
Allen, J.R., and Kennedy, K.1987. Automatic translation of Fortran programs to vector form . ACM TOPLAS9(4):491-542.
7.
Callahan, D.1987. A global approach to the detection of parallelism. Ph.D. dissertation. Houston: Rice University , Department of Computer Science.
8.
Callahan, D.1988. The program summary graph and flow-sensitive interprocedural data flow analysis. SIGPLAN Notices23(7):47-56.
9.
Callahan, D., and Kennedy, K.1987. Analysis of interprocedural side effects in a parallel programming environment. Lecture Notes in Comput. Sci.297:138-171.
10.
Callahan, D., and Subhlok, J.1988. Static analysis of low-level synchronization. TR 88-70. Houston: Rice University, Department of Computer Science.
11.
Carroll, M., and Ryder, B.G.1986. An incremental algorithm for software analysis . SIGPLAN Notices22(1):171-179.
12.
Carle, A., Cooper, K.D., Hood, R.T., Kennedy, K., Torczon, L., and Warren, S.K.1987. A practical environment for scientific programming . IEEE Computer20(11):75-89.
13.
Cooper, K.D., and Kennedy, K.1988. Interprocedural side-effect analysis in linear time. SIGPLAN Notices23(7):57-66.
14.
Cooper, K.D., Kennedy, K., and Torczon, L.1986. Interprocedural optimization: eliminating unnecessary recompilation. SIGPLAN Notices21(7):58-67.
15.
Cytron, R.1986. On the implications of parallel languages for compilers . Report RC 11723. Yorktown Heights, N.Y.: IBM T. J. Watson Research Center.
16.
Dongarra, J.J., and Sorensen, D.C.1986. SCHEDULE: tools for developing and analyzing parallel Fortran programs. TR 86. Chicago: Argonne National Laboratory, Math and Computer Science Division.
17.
Gentleman, W.M., and Hoeksma, H.1983. Hardware assisted high level debugging. SIGPLAN Notices18(8):140-145.
18.
Henderson, L.1987. The usefulness of dependency-analysis tools in parallel programming: experiences with PTOOL. TR Preprint LA-UR-87-3135. Los Alamos National Laboratory.
19.
Kuck, D.J., Kuhn, R.H., Leasure, B., Padua, D.A., and Wolfe, M.1981. Compiler transformation of dependence graphs. In Conference record, 8th ACM symposium on principles of programming languages. New York: ACM, pp. 207-218.
20.
Kuck, D.J., Kuhn, R.H., Leasure, B., and Wolfe, M.1980. The structure of an advanced vectorizer for pipelined processors. In Proceedings fourth international computer software and applications conference. Washington, D.C.: IEEE Computer Society Press, pp. 709-715.
21.
Kennedy, K.1981. A survey of data flow analysis techniques. In Program flow analysis, edited by N. D. Jones and S. S. Muchnick.Englewood Cliffs, N.J.: Prentice-Hall, pp. 5-54.
22.
Kuck, D.J.1978. The structure of computers and computations, vol. 1. New York: Wiley and Sons.
23.
Leasure, B., et al. 1988. PCF Fortran: language definition, version 1. Parallel Computing Forum draft document. Champaign, Ill.: Kuck and Associates, Inc.
24.
Miller, B.P., and Choi, J.D.1988. A mechanism for efficient debugging of parallel programs . SIGPLAN Notices23(7):135-144.
25.
Ryder, B.G.1983. Incremental data flow analysis. In Conference record, 10th ACM symposium on principles of programming languages . New York: ACM, pp. 167-176.
26.
Scarborough, R.G., and Kolsky, H.G.1986. A vectorizing Fortran compiler. IBM J. Res. Develop.30(2): 163-172.
27.
Triolet, R., Irigoin, F., and Feautrier, P.1986. Direct parallelization of call statements. SIGPLAN Notices21(7):176-185.
28.
Wolfe, M.J.1982. Optimizing supercompilers for supercomputers. Ph.D. dissertation . Champaign: University of Illinois at Champaign-Urbana, Department of Computer Science .
29.
Zadeck, F.K.1984. Incremental data flow analysis in a structured program editor. SIGPLAN Notices19(6):132-143.
