Parallel program analysis and restructuring by detection of point-to-point interaction patterns and their transformation into collective communication constructs

Science of Computer Programming

Volumn 40, Issue 2-3, 2001, Pages 235-263

  Di Martino, Beniamino ^a   Mazzeo, Antonino ^a   Mazzocca, Nicola ^a   Villano, Umberto ^b  

^a UNIVERSITY OF NAPLES FEDERICO II   (Italy)

^b UNIVERSITY OF SANNIO   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

CODES (SYMBOLS); COMPUTER SYSTEMS PROGRAMMING; DATA COMMUNICATION SYSTEMS; RESPONSE TIME (COMPUTER SYSTEMS);

POINT-TO-POINT INTERACTION PATTERNS;

PARALLEL PROCESSING SYSTEMS;

EID: 0035400796     PISSN: 01676423     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-6423(01)00017-X     Document Type: Article

References (40)

1. Allen R., Kennedy K. Automatic translation of fortran programs to vector form. ACM Trans. Programming Languages and Systems. 3(9):1987;491-542.
2. Andrews G.R. Paradigms for process interaction in distributed programs. ACM Comput. Surveys. 23(1):1991;49-89.
3. R. Aversa, B. Di Martino, N. Mazzocca, U. Villano, Reducing parallel program simulation complexity by static analysis, in: Proc. PDPTA’99 Internat. Conf. CSREA, World Scientific Eng. Soc., 1999, pp. 627-633.
4. Aversa R., Mazzocca N., Mazzeo A., Villano U. Heterogeneous system performance and analysis using PS. IEEE Concurrency. 6(3):1998;20-29.
5. Banerjee U. Dependence Analysis for Supercomputing. 1988;Kluwer Academic Publishers, Norwell, MA.
6. Bomans L., Roose D., Hempel R. The Argonne/GMD Macros in FORTRAN for portable parallel programming and their implementation on the Intel iPSC/2. Parallel Computing. 15:1990;119-132.
7. Brinch Hansen P. Model programs for computational science. a programming methodology for multicomputers Concurrency: Practice and Experience. 5(5):1993;407-423.
8. R. Butler, E. Lusk, User’s Guide to the p4 parallel programming system, Tech. Rep. ANL-92/17, Argonne National Laboratory, October 1992.
9. D. Campbell, Towards the classification of algorithmic skeletons, Tech. Rep. YCS-276, Dept. of Comp. Science, Univ. of York, 1996.
10. A. Cimitile, A. De Lucia, M. Munro, Qualifying reusable functions using symbolic execution, in: Proc. 2nd Working Conf. on Reverse Engineering, IEEE CS Press, Toronto, Canada, 1995, pp. 178-187.
11. Cole M.I. Algorithmic Skeletons: Structured Management of Parallel Computation. 1989;MIT Press, Cambridge, MA.
12. 3L language: an introduction, Tech. Rep. HPL-PSC-91-29, Hewlett-Packard Laboratories, Pisa Science Centre, 1991.
13. Darema F.et al. A single-program-multiple-data computational model for EPEX/FORTRAN. Parallel Computing. 7:1988;11-24.
14. Darlington J., Field A.J., Harrison P.G., Kelly P.H.J., Sharp D.W.N., Wu Q., Whie R.L. Parallel programming using skeleton functions. Proc. PARLE’93, Lecture Notes in Computer Science. Vol. 694:1993;146-160 Springer, Berlin.
15. Di Martino B., Mazzeo A., Mazzocca N., Villano U. Automatic detection of interaction patterns for parallel program analysis and development. Proc. IWPC’98. 1998;206-213 IEEE CS Press, Los Alamitos, CA.
16. Di Martino B., Mazzeo A., Mazzocca N., Villano U. Restructuring parallel programs by automatic transformation of point-to-point interaction patterns into collective communication. Proc. IWPC’99. 1999;84-91 IEEE CS Press, Los Alamitos, CA.
17. B. Di Martino, A. Mazzeo, N. Mazzocca, U. Villano, H. Zima, Interaction patterns detection in message passing programs to support parallel program simulation, Tech. Rep. no. 97-15, Institute for Software Technology and Parallel Systems, Univ. of Vienna, 1997.
18. Ferrante J., Ottenstein K.J., Warren J.D. The program dependence graph and its use in optimization. ACM Trans. Programming Languages Systems. 9(3):1987;319-349.
19. I. Foster, K.M. Chandy, Fortran M: a language for modular parallel programming, Tech. Rep. MCS-P327-0992, Argonne National Laboratory, 1992.
20. Foster I., Olson R., Tuecke S. Productive parallel programming. the PCN approach Scientific Programming. 1(1):1992;51-66.
21. Fox G.C.et al. Solving Problems on Concurrent Processors. 1988;Prentice-Hall, Englewood Cliffs, NJ.
22. M. Froehlich, M. Werner, The graph visualization system DaVinci - a user interface for applications, Tech. Rep. no. 5/94, Dept. of Computer Science, Univ. Bremen, 1994.
23. Geist A.et al. PVM. Parallel Virtual Machine - a Users Guide and Tutorial for Networked Parallel Computing:1994;MIT Press, Cambridge.
24. Girkar M., Polychronopoulos C.D. Automatic extraction of functional parallelism from ordinary programs. IEEE Trans. Parallel Distributed Systems. 3(2):1992;166-178.
25. W.D. Gropp, B. Smith, Chameleon parallel programming tools users nanual, Tech. Rep. ANL-93/23 Argonne National Laboratory, 1993.
26. Grosh J., Emmelmann H. A tool box for compiler construction. Lecture Notes in Computer Science. Vol. 477:1990;106-116 Springer, Berlin.
27. Hoare C.A.R. Communicating Sequential Processes. 1985;Prentice-Hall, Englewood Cliffs, NJ.
28. INMOS Ltd., OCCAM Programming Manual, Prentice-Hall, Englewood Cliffs, NJ, 1984.
29. Lamport L. The parallel execution of DO loops. Comm. ACM. 17(2):1974;83-93.
30. B. Massingill, The mesh archetype, Tech. Report CS-TR-96-25, California Institute of Technology, 1996.
31. Message Passing Interface Forum, Document for a Standard Message-Passing Interface, Tech. Rep. CS-93-214, University of Tennessee, 1994.
32. P.A. Nelson, L. Snyder, Programming Paradigms for Non-Shared Memory Parallel Computers,in: L.H. Jamieson, D. Gannon, R. Douglass (Eds.), The Characteristics of Parallel Algorithms, MIT Press, Cambridge, 1988.
33. Parasoft corp., Express version 1.0: A Communication Environment for Parallel Computers, 1988.
34. Pugh W. A practical algorithm for exact array dependence analysis. Commun. ACM. 8(35):1992;102-115.
35. Puma - A generator for the transformation of attributed trees, Compiler Generation Report no. 26, GMD Karlsruhe, 1991.
36. D.B. Skillicorn, Architecture independent parallel computation, IEEE Computer 23 (1990) 38-50.
37. Wolf M.E., Lam M. A loop transformation theory and an algorithm to maximize parallelism. IEEE Trans. Parallel Distributed Systems. 2(4):1991;452-471.
38. Wolfe M. High Performance Compilers for Parallel Computing. 1996;Addison-Wesley, Redwood City, CA.
39. Z. Xu, K. Hwang, Modeling communication overhead: MPI and MPL performance on the IBM SP2, IEEE Par. Distr. Technology (1996) 9-23.
40. Zima H., Chapman B. Supercompilers for Parallel and Vector Computers. 1990;ACM Press, New York.