Array resizing for scientific code debugging, maintenance and reuse

ABSTRACT

Software debugging, maintenance and reuse have to deal with many problems from Fortran scientific codes that do not fully respect the standard specification. Our study on Linpack, PerfectClub and SPEC95 benchmarks and several industrial software reveals a large number of unprecise variable declarations that prevent program analysis, verification and parallelization. Furthermore, they decrease the readability of programs and make reverse-engineering more difficult.This paper presents two different methods to compute the exact size of arrays in Fortran codes that have pointer-type \verb+REAL A(1)+ or assumed-size \verb+REAL A(*)+ declarations.The first method uses the relationship between actual and formal arguments from parameter-passing rules. New array declarations in the called procedure are computed with respect to the declarations in the calling procedures.The second approach is based on an array region analysis that gives information about the set of array elements accessed during the execution of code. This approach to array resizing could be applied to other languages without array declaration such as MATLAB and APL in order to reduce the execution overhead of dynamic test and resizing.Our two approaches are combined to yield very good results for Linpack, PerfectClub and SPEC95 benchmarks.

REFERENCES

• 1: Programming Language FORTRAN,ANSI X3.9-1978, ISO 1539-1980. American National Standard Institute, 1983.
• 2: Timothy Budd, An APL compiler, Springer-Verlag New York, Inc., New York, NY, 1988
• 3: Béatrice Creusillet , François Irigoin, Interprocedural Array Region Analyses, Proceedings of the 8th International Workshop on Languages and Compilers for Parallel Computing, p.46-60, August 10-12, 1995
• 4: Jozo J. Dujmovic , Ivo Dujmovic, Evolution and evaluation of SPEC benchmarks, ACM SIGMETRICS Performance Evaluation Review, v.26 n.3, p.2-9, Dec. 1998 [doi>10.1145/306225.306228]
• 5: Junjie Gu , Zhiyuan Li, Efficient Interprocedural Array Data-Flow Analysis for Automatic Program Parallelization, IEEE Transactions on Software Engineering, v.26 n.3, p.244-261, March 2000 [doi>10.1109/32.842950]
• 6: F. Irigoin, Interprocedural analyses for programming environments, Environments and tools for parallel scientific computing, Elsevier Science Publishers B. V., Amsterdam, The Netherlands, 1993
• 7: François Irigoin , Pierre Jouvelot , Rémi Triolet, Semantical interprocedural parallelization: an overview of the PIPS project, Proceedings of the 5th international conference on Supercomputing, p.244-251, June 17-21, 1991, Cologne, West Germany [doi>10.1145/109025.109086]
• 8: R. Keryell, C. Ancourt, F. Coelho, B. Creusile, F. Irigoin, and P. Jouvelot. PIPS: A workbench for building interprocedural parallelizers, compilers and optimizers. Technical Report A/289/CRI, Ecole des Mines de Paris, May 1996.
• 9: A. Kubota, I. Miyoshi, K. Maeyama, S. Goto, S. Mori, H. Nakashima, and S. Tomita. TINPAR: A parallelizing compiler for message passing multiprocessors. In International Symposium on Parallel and Distributed Supercomputing, pages 214-223, September 1995.
• 10: Vijay Menon , Keshav Pingali, A case for source-level transformations in MATLAB, Proceedings of the 2nd conference on Domain-specific languages, p.53-65, October 03-06, 1999, Austin, Texas, United States
• 11: Steven S. Muchnick, Advanced compiler design and implementation, Morgan Kaufmann Publishers Inc., San Francisco, CA, 1998
• 12: T. V. N. Nguyen, F. Irigoin, C. Ancourt, and R. Keryell. Efficient intraprocedural array bound checking. Technical Report A/316/CRI, Ecole des Mines de Paris, November 2000.
• 13: Yunheung Paek , Jay Hoeflinger , David Padua, Simplification of array access patterns for compiler optimizations, Proceedings of the ACM SIGPLAN 1998 conference on Programming language design and implementation, p.60-71, June 17-19, 1998, Montreal, Quebec, Canada
• 14: Alfred V. Aho , Ravi Sethi , Jeffrey D. Ullman, Compilers: principles, techniques, and tools, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1986
• 15: R. W.Hockney. The Science of Computer Benchmarking. SIAM, 1996.

INDEX TERMS

Primary Classification:
  D. Software
  D.2 SOFTWARE ENGINEERING
      D.2.5 Testing and Debugging
          Subjects: Debugging aids

Additional Classification:
  D. Software
  D.3 PROGRAMMING LANGUAGES
      D.3.2 Language Classifications

          Nouns: FORTRAN

  F. Theory of Computation
  F.3 LOGICS AND MEANINGS OF PROGRAMS
      F.3.2 Semantics of Programming Languages
          Subjects: Program analysis

General Terms:
Algorithms, Languages

Keywords:
array declaration, array region, array resizing, debug, program analysis, program comprehension, reuse, reverse-engineering