On porting sequential programs to parallel machines

We address a significant problem in parallel processing research, namely, how to port existing sequential programs to run efficiently on parallel machines (the "dusty deck" problem). Conventional domain-independent techniques are inadequate for solving this problem because they miss significant opportunities of parallelism. We present experimental evidence to support our claim, analyze why current techniques are inadequate, and propose a knowledge-based reverse engineering approach for attacking this problem.<<ETX>>

[1]  Atul Prakash,et al.  A Framework for Source Code Search Using Program Patterns , 1994, IEEE Trans. Software Eng..

[2]  Elliot Soloway,et al.  PROUST: Knowledge-Based Program Understanding , 1984, IEEE Transactions on Software Engineering.

[3]  Dan I. Moldovan,et al.  Parallel processing - from applications to systems , 1993 .

[4]  J. D. Brett. Hodges.  Knowledge-Based Program Understanding and Testing Assistant (KBPUTA). , 1994 .

[5]  Ken Kennedy,et al.  Parascope:a Parallel Programming Environment , 1988 .

[6]  Wojtek Kozaczynski,et al.  Program Concept Recognition and Transformation , 1992, IEEE Trans. Software Eng..

[7]  Rudolf Eigenmann,et al.  Performance Analysis of Parallelizing Compilers on the Perfect Benchmarks Programs , 1992, IEEE Trans. Parallel Distributed Syst..

[8]  Christopher W. Pidgeon,et al.  TMM: Software Maintenance by Transformation , 1986, IEEE Software.

[9]  Yoichi Muraoka,et al.  Measurements of parallelism in ordinary FORTRAN programs , 1974, Computer.

[10]  Almerico Murli,et al.  Practical parallel computing : status and prospects , 1991 .

[11]  Paul Messina,et al.  Parallel computing in the 1980s - one person's view , 1991, Concurr. Pract. Exp..

[12]  Utpal Banerjee,et al.  Loop Transformations for Restructuring Compilers: The Foundations , 1993, Springer US.

[13]  Milind Girkar,et al.  Parafrase-2: an Environment for Parallelizing, Partitioning, Synchronizing, and Scheduling Programs on Multiprocessors , 1989, Int. J. High Speed Comput..

[14]  Linda M. Wills.  Automated Program Recognition: A Feasibility Demonstration , 1990, Artif. Intell..

[15]  Ken Kennedy,et al.  Automatic translation of FORTRAN programs to vector form , 1987, TOPL.

[16]  Jack Dongarra,et al.  Environments and Tools for Parallel Scientific Computing , 1993 .

[17]  Charles Rich.  A Formal Representation For Plans In The Programmer's Apprentice , 1982, On Conceptual Modelling.

[18]  E Bush,et al.  The automatic restructuring of COBOL , 1986 .

[19]  Swarn P. Kumar,et al.  Portable tools for Fortran parallel programming , 1991, Concurr. Pract. Exp..

[20]  Constantine D. Polychronopoulos,et al.  The structure of parafrase-2: an advanced parallelizing compiler for C and FORTRAN , 1990 .

[21]  Dean Allemang,et al.  Understanding programs as devices , 1990 .