A transformation approach to derive efficient parallel implementations

IEEE Transactions on Software Engineering

Volumn 26, Issue 4, 2000, Pages 315-339

  Rauber, Thomas ^a   Rünger, Gudula ^b  

^a MARTIN LUTHER UNIVERSITY HALLE WITTENBERG   (Germany)

^b UNIVERSITY OF LEIPZIG   (Germany)

Author keywords

coordination language; data distribution types; hierarchical module structure; message passing program; mpi; scientific computing; task and data parallelism; Transformation system

Indexed keywords

COMPUTER SOFTWARE PORTABILITY; NATURAL SCIENCES COMPUTING; PARALLEL ALGORITHMS; PARALLEL PROCESSING SYSTEMS; PIPELINE PROCESSING SYSTEMS;

COORDINATION LANGUAGE; DATA PARALLELISM; MESSAGE PASSING PROGRAMS; TASK PARALLELISM; TRANSFORMATION SYSTEMS;

COMPUTER AIDED SOFTWARE ENGINEERING;

EID: 0033704556     PISSN: 00985589     EISSN: None     Source Type: Journal    
DOI: 10.1109/32.844492     Document Type: Article

References (58)

1. A. Alexandrov, M. lonescu, K.E. Schauser, and C. Scheiman, "LogGP: Incorporating Long Messages into the LogP model-One Step Closer towards a Realistic Model for Parallel Computation," Technical Report TRCS95-09, Univ. of California at Santa Barbara, 1995.
2. B. Bacci, M. Danelutto, S. Orlando, S. Pelagatti, and M. Vanneschi, "P3L: A Structured High Level Programming Language and Its Structured Support," Concurrency: Practice and Experience, vol. 7, no. 3, pp. 225-255, 1995.
3. H. Bal and M. Haines, "Approaches for Integrating Task and Data Parallelism," IEEE Concurrency, vol. 6, no. 3, pp. 74-84, July-Aug. 1998.
4. P. Banerjee, J. Chandy, M. Gupta, E. Hodge, J. Holm, A. Lain, D. Palermo, S. Ramaswamy, and E. Su, "The Paradigm Compiler for Distributed-Memory Multicomputers," Computer, vol. 28, no. 10, pp. 37-47, Oct. 1995.
5. C.J. Beckmann and C. Polychronopoulos, "Microarchitecture Support for Dynamic Scheduling of Acyclic Task Graphs," Technical Report CSRD Report 1207, Univ. of Illinois, 1992.
6. G.E. Blelloch, "Programming Parallel Algorithms," Comm. ACM, vol. 29, no. 3, pp. 85-97, Mar. 1996.
7. D. Culler, J. Singh, and A. Gupta, Parallel Computer Architecture. Morgan Kaufmann, 1998.
8. D.E. Culler, R. Karp, A. Sahay, K.E. Schauser, E. Santos, R. Subramonian, and T. von Eicken, "LogP: Towards a Realistic Model of Parallel Computation," Proc. Fourth Symp. Principles and Practice of Parallel Programming, vol. 28, no. 4, pp. 1-12, 1993.
9. J. Darlington, Y. Guo, H.W. To, and J. Yang, "Functional Skeletons for Parallel Coordination," Proc. EURO-PAR '95, pp. 55-66, 1995.
10. R. Dautray and J.-L. Lions, Mathematical Analysis and Numerical Methods for Science and Technology, vol. 4. Springer, 1990.
11. J.J. Dongarra and D.W. Walker, "Software Libraries for Linear Algebra Computations on High Performance Computers," SIAM Review, 1995.
12. M.A. Driscoll and W.R. Daasch, "Accurate Predictions of Parallel Program Execution Time," J. Parallel and Distributed Computing, vol. 25, no. 1, pp. 16-30, 1995.
13. High Performance Fortran Forum, "High Performance Fortran Language Specification," Scientific Programming, vol. 2, no. 1, 1993.
14. The MPI Forum, "MPI: A Message Passing Interface Standard," technical report, Univ. of Tennessee, Apr. 1994.
15. R. Foschia, T. Rauber, and G. Rünger, "Modeling the Communication Behavior of the Intel Paragon," Proc. Fifth Symp. Modeling, Analysis, and Simulation of Computer and Telecomm. Systems (MASCOTS '97), pp. 117-124, 1997.
16. I. Foster and K.M. Chandy, "Fortran M: A Language for Modular Parallel Programming," J. Parallel and Distributed Computing, vol. 25, no. 1, pp. 24-35, Apr. 1995.
17. I. Foster, M. Xu, B. Avalani, and A. Choudhary, "A Compilation System that Integrates High Performance Fortran and Fortran M," Proc. 1994 Scalable High Performance Computing Conf., pp. 293-300, 1994.
18. S. Ghosh, M. Martonosi, and S. Malik, "Cache Miss Equations: An Analytical Representation of Cache Misses," Proc. Int'l Conf. Supercomputing, pp. 317-324, 1997.
19. R. Graham, "Bounds on Multiprocessor Timing Anomalies," SIAM J. Applied Math., 1969.
20. E. Hairer, S.P. Norsett, and G. Wanner, Solving Ordinary Differential Equations I: Nonstiff Problems, Berlin: Springer-Verlag, 1993.
21. E. Hairer, G. Wanner, Solving Ordinary Differential Equations II. Springer, 1991.
22. P. Hanrahan, D. Salzman, and L. Aupperle, "A Rapid Hierarchical Radiosity Algorithm," Computer Graphics, vol. 25, no. 4, pp. 197-206, 1991.
23. M. Hill, W. McColl, and D. Skillicorn, "Questions and Answers about BSP," Scientific Programming, vol. 6, no. 3, pp. 249-274, 1997.
24. K. Hwang, Z. Xu, and M. Arakawa, "Benchmark Evaluation of the IBM SP2 for Parallel Signal Processing," IEEE Trans. Parallel and Distributed Systems, vol. 7, no. 5, pp. 522-536, May 1996.
25. S. Johnsson, "Performance Modeling of Distributed Memory Architecture," J. Parallel and Distributed Computing, vol. 12, pp. 300-312, 1991.
26. S. Johnsson and C. Ho, "Optimum Broadcasting and Personalized Communication in Hypercubes," IEEE Trans. Computers, vol. 38, no. 9, pp. 1,249-1,268, Sept. 1989.
27. V. Kumar, A. Grama, A. Gupta, and G. Karypis, Introduction to Parallel Computing. Benjamin/Cummings, 1993.
28. W.F. McColl, "Universal Computing," Proc. EuroPar '96, pp. 25-36, 1996.
29. M.G. Norman and P. Thanisch, "Models of Machines and Computation for Mapping in Multicomputers," ACM Computing Surveys, vol. 25, no. 3, pp. 263-302, 1993.
30. J. O'Donnell and G. Rünger, "A Methodology for Deriving Parallel Programs with a Family of Abstract Machines," Proc. Euro-Par '97, pp. 662-669, 1997.
31. S. Ramaswamy, "Simultaneous Exploitation of Task and Data Parallelism in Regular Scientific Applications," PhD thesis, Univ. of Illinois at Urbana-Champaign, 1996.
32. S. Ramaswamy and P. Banerjee, "Automatic Generation of Efficient Array Redistribution Routines for Distributed Memory Multicomputers," Proc. Frontiers '95, pp. 342-349, 1995.
33. S. Ramaswamy, S. Sapatnekar, and P. Banerjee, "A Framework for Exploiting Task and Data Parallelism on Distributed-Memory Multicomputers," IEEE Trans. Parallel and Distributed Systems, vol. 8, no. 11, pp. 1,098-1,116, Nov. 1997.
34. T. Rauber and G. Rünger, "Optimal Data Distribution for LU Decomposition," Proc. EuroPar '95, pp. 391-402, 1995.
35. T. Rauber and G. Rünger, "Parallel Solution of a Schrödinger-Poisson System," Proc. Int'l Conf. High-Performance Computing and Networking, pp. 697-702, 1995.
36. T. Rauber and G. Rünger, "Comparing Task and Data Parallel Execution Schemes for the DIIRK Method," Proc. EuroPar '96, pp. 52-61, 1996.
37. T. Rauber and G. Rünger, "Parallel Iterated Runge-Kutta Methods and Applications," Int'l J. Supercomputer Applications, vol. 10, no. 1, pp. 62-90, 1996.
38. T. Rauber and G. Rünger, "The Compiler TwoL for the Design of Parallel Implementations," Proc. Fourth Int'l Conf. Parallel Architectures and Compilation Techniques (PACT '96), pp. 292-301, 1996.
39. T. Rauber and G. Rünger, "Load Balancing Schemes for Extrapolation Methods," Concurrency: Practice and Experience, vol. 9, no. 3, pp. 181-202, 1997.
40. T. Rauber and G. Rünger, "Compiler Support for Task Scheduling in Hierarchical Execution Models," J. Systems Architecture, vol. 45, pp. 483-503, 1998.
41. T. Rauber and G. Rünger, and R. Wilhelm, "Deriving Optimal Data Distributions for Group Parallel Numerical Algorithms," Proc. Second Conf. Massively Parallel Programming Models, pp. 33-41, 1995.
42. J. Rose, "LocusRoute: A Parallel Global Router for StandardCells," Proc. 25th ACM/IEEE Design Automation Conf., pp. 189-195, 1988.
43. J. Rose, "Parallel Global Routing for Standard Cells," IEEE Trans. Computer-Aided Design, vol. 9, no. 10, 1990.
44. D. Skillicorn, "Architecture-Independent Parallel Computation," Computer, vol. 23, no. 12, pp. 38-51, 1990.
45. D. Skillicorn and D. Talia, "Models and Languages for Parallel Computation," ACM Computing Surveys, vol. 30, no. 2, pp. 123-169, 1998.
46. J. Stoer, R. Bulirsch, Introduction to Numerical Analysis. Springer, 1990.
47. J. Subhlok, "Automatic Mapping of Task and Data Parallel Programs for Efficient Execution on Multiprocessors," Technical Report CMU-CS-93-212, Carnegie Mellon Univ., 1993.
48. P. Trindler, K. Hammond, H.-W. Loidl, and S.L. Peyton Jones, "Algorithm + Strategy = Parallelism," J. Functional Programming, vol. 8, no. 1, pp. 23-60, 1998.
49. J. Turek, W. Ludwig, J. Wolf, L. Fleischer, P. Tiwari, J. Glasgow, U. Schwiegelshohn, and P. Yu, "Scheduling Parallelizable Tasks to Minimize Average Response Time," Proc. SPAA '94, pp. 200-209, 1994.
50. J. Turek, J.L. Wolf, and P.S. Yu, "Approximate Algorithms for Scheduling Parallelizable Tasks," Proc. SPAA '92, pp. 323-332, 1992.
51. L.G. Valiant, "A Bridging Model for Parallel Computation," Comm. ACM, vol. 33, no. 8, pp. 103-111, 1990.
52. P.J. van der Houwen and B.P. Sommeijer, "Parallel Iteration of High-Order Runge-Kutta Methods with Stepsize Control," J. Computational and Applied Math., vol. 29, pp. 111-127, 1990.
53. P.J. van der Houwen and B.P. Sommeijer, "Iterated Runge-Kutta Methods on Parallel Computers," SIAM J. Scientific and Statistical Computing, vol. 12, no. 5, pp. 1,000-1,028, 1991.
54. P.J. van der Houwen, B.P. Sommeijer, and W. Couzy, "Embedded Diagonally Implicit Runge-Kutta Algorithms on Parallel Computers," Math. Computation, vol. 58, no. 197, pp. 135-159, Jan. 1992.
55. M. Wolfe, High Performance Compilers for Parallel Computing. Addison-Wesley, 1996.
56. S.C. Woo, M. Ohara, E. Torrie, J.P. Singh, and A. Gupta, "The SPLASH-2 Programs: Characterization and Methodological Considerations," Proc. 22nd Ann. Int'l Symp. Computer Architecture, pp. 24-36, 1995.
57. Z. Xu and K. Hwang, "Early Prediction of MPP Performance: SP2, T3D and Paragon Experiences," Parallel Computing, vol. 22, pp. 917-942, 1996.
58. K. Yelick, L. Semenzato, G. Pike, C. Miyamoto, B. Liblit, A. Krishnamurthy, P. Hilfinger, S. Graham, D. Gay, P. Colella, and A. Aiken, "Titanium: A High-Performance Java Dialect," Concurrency: Practice and Experience, 1998.