The automated transformation of abstract specifications of numerical algorithms into efficient array processor implementations

Science of Computer Programming

Volumn 28, Issue 1, 1997, Pages 1-41

  Fitzpatrick, Stephen ^a   Harmer, Terence J ^a   Stewart, Alan ^a   Clint, Maurice ^a   Boyle, James M ^b  

^a QUEEN'S UNIVERSITY BELFAST   (United Kingdom)

^b ARGONNE NATIONAL LABORATORY   (United States)

Author keywords

AMT DAP array processor; Functional specification; Normal forms; Program derivation; Program transformation

Indexed keywords

ALGEBRA; COMPUTER PROGRAMMING LANGUAGES; EIGENVALUES AND EIGENFUNCTIONS; MATHEMATICAL MODELS; PARALLEL PROCESSING SYSTEMS;

FUNCTIONAL SPECIFICATION; NORMAL FORMS; PROGRAM DERIVATION; PROGRAM TRANSFORMATIONS;

PARALLEL ALGORITHMS;

EID: 0030834770     PISSN: 01676423     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0167-6423(96)00015-9     Document Type: Article

References (73)

1. AMT, Fortran-Plus Language Enhanced, AMT Ltd., 1988.
2. L. Augustsson and T. Johnsson, The Chalmers lazy-ML compiler, Comput. J. 32 (2) (1989) 127-141.
3. R. Backhouse, An exploration of the Bird-Meertens formalism, Technical Report CS8810, Department of Mathematics and Computing Science, University of Groningen, 1988.
4. S. Benker et al., Vienna Fortran-90, in: R. Voigt and J. Saltz, eds., Proc. Scalable High-Performance Computing Conf. (IEEE Computer Society Press, Silver Spring, MD, 1992) 51-59.
5. R.S. Bird, Algebraic identities for program calculation, Comput. J. 32 (2) (1989) 122-126.
6. R.S. Bird and J. Hughes, The Alpha-Beta algorithm: An exercise in program transformation, Inform. Process. Lett. 24 (1987) 53-57.
7. R.S. Bird and P. Wadler, Introduction to Functional Programming (Prentice-Hall, Englewood Cliffs, NJ, 1988).
8. A. Bloss, P. Hudak and J. Young, An optimizing compiler for a modern functional language, Comput. J. 32 (2) (1989) 152-161.
9. E.A. Boiten, Improving recursive functions by inverting the order of evaluation, Sci. Comput. Programming 18 (1992) 139-179.
10. J.M. Boyle, A transformational component for programming language grammar, ANL-7690, Argonne National Laboratory, July 1970.
11. J.M. Boyle, Program adaptation and program transformation, in: R. Ebert, J. Lueger and L. Goecke, eds., Practice in Software Adaptation and Maintenance (North-Holland, Amsterdam, 1980) 3-20.
12. J.M. Boyle and M.N. Muralidharan, Program reusability through program transformation, IEEE Trans. Software Engrg. SE-10 (5) (1984) 574-588.
13. J.M. Boyle and T.J. Harmer, Functional specifications for mathematical computations, in: B. Möller, ed., Proc. IFIP TC2/WG2.1 Working Conf. on Constructing Programs from Specifications, Pacific Grove, CA, 13-16 May 1991 (North-Holland, Amsterdam, 1991) 205-224.
14. J.M. Boyle, Abstract programming and program transformations - An approach to reusing programs, in: T.J. Biggerstaff and A.J. Perlis, eds., Software Reusability, Vol. I (ACM Press (Addison-Wesley), New York, NY, 1989) 361-413.
15. J.M. Boyle and T.J. Harmer, A practical functional program for the CRAY X-MP, J. Funct. Programming 2 (1992) 81-126.
16. J.M. Boyle, Towards automatic synthesis of linear algebra programs, in: M.A. Hennell and L.M. Delves, eds., Production and Assessment of Numerical Software (Academic Press, New York, 1980) 223-245.
17. J.M. Boyle, Automatic, self-adaptive control of unfold transformations, Presented at PROCOMET '94, IFIP Working Conf. on Programming Concepts, Methods and Calculi, San Miniato, Italy, 6-10 June 1994, Proceedings to be published by North-Holland.
18. R.M. Burstall and J. Darlington, A transformation system for developing recursive programs, ACM J. 24 (1977) 44-67.
19. M. Clint et al., Towards the construction of an eigenvalue engine, Parallel Comput. 8 (1988) 127-132.
20. M. Clint et al., A comparison of two parallel algorithms for the symmetric eigenproblem, Internat. J. Comput. Math. 15 (1984) 291-302.
21. M. Clint, J.S. Weston and C.W. Bleakney, Comparison of parallel Fortran environments on the AMT DAP 510 for a linear algebra application, Concurrency: Practice and Experience 6 (1994) 193-204.
22. CM Fortran Reference Manual, TMC, Thinking Machines Corporation, Cambridge, MA, 1991.
23. M. Cole, Algorithmic Skeletons: Structured Management of Parallel Computation (MIT Press, Cambridge, MA, 1989).
24. A. Contessa et al., MaRS, a combinator graph reduction multiprocessor, in: E. Odijk, M. Rem and J.C. Syre, eds., PARLE '89 Parallel Architectures and Languages Europe, Vol. I, Lecture Notes in Computer Science, Vol. 365 (Springer, Berlin, 1989) 176-192.
25. M.S. Feather, A system for assisting program transformation, ACM Programming Languages 4 (1982) 1-20.
26. J.T. Feo, D. Cann and R.R. Oldehoeft, A report on the SISAL language project, J. Parallel Distributed Comput. 10 (4) (1990) 349-366.
27. J. Darlington et al., A functional programming environment supporting execution, partial execution and transformation, in: E. Odijk, M. Rem and J.C. Syre, eds., PARLE '89 Parallel Architectures and Languages Europe, I, Lecture Notes in Computer Science, Vol. 365 (Springer, Berlin, 1989) 286-305.
28. J. Darlington et al., Parallel programming using skeletons, in: A. Bode, M. Reeve and G. Wolf, eds., PARLE'93: Parallel Architectures and Languages Europe, Lecture Notes in Computer Science, Vol. 694 (Springer, Berlin, 1993).
29. J. Darlington, Yi-ke Guo and Hing Wing To, Structured parallel programming: Theory meets practice, Draft paper obtained from the first author, January 1995.
30. A.J. Field and P.G. Harrison, Functional Programming (Addison-Wesley, Reading, MA, 1988).
31. I. Foster et al., Productive parallel programming: The PCN approach, Scientific Programming 1 (1) (1992) 51-66.
32. G. Fox et al., Fortran D language specification, Research Report, Rice University, January 1992.
33. R. Gabriel and J. McCarthy, QLISP, in: Parallel Computation and Computers for AI (Kluwer Academic Publishers, Dordrecht, 1988) 63-89.
34. A. Giacalone et al., Facile: a symmetric integration of concurrent and functional programming, J. Parallel Comput. 18 (2) (1989) 121-160.
35. A. Gill et al., A short cut to deforestation, in: FPCA '93, Conf. on Functional Programming Languages and Computer Architecture (ACM Press, New York, 1993) 223-232.
36. G. Hains and L.M.R. Mullin, Parallel functional programming with arrays, Comput. J. 36 (3) (1993) 238-245.
37. R.H. Halstead, Parallel computing using multilisp, in: J.S. Kowalik, eds., Parallel Computation and Computers for AI (Kluwer Academic Publishers, Dordrecht, 1987) 21-40.
38. P.G. Harrison and M. Reeve, The parallel graph reductions machine ALICE, in: J.H. Fasel and R.M. Keller, eds., Graph Reduction, Lecture Notes in Computer Science, Vol. 279 (Springer, Berlin, 1986) 181-202.
39. P.G. Harrison and H. Khoshnevisan, Algebraic transformation techniques for functional languages, Comput. J. 31 (1988) 229-242.
40. L.O. Hertzberger and W.G. Vree, A coarse grain parallel architecture for functional languages, in: E. Odijk, M. Rem and J.C. Syre, eds., PARLE '89 Parallel Architectures and Languages Europe, I, Lecture Notes in Computer Science, Vol. 365 (Springer, Berlin, 1989) 269-285.
41. High Performance Fortran Language Specification, Version 1.1, High Performance Fortran Forum, November 1994.
42. D. Hildum and J. Cohen, A language for specifying program transformations, IEEE Trans. Software Engrg. 16 (6) (1990) 630-638.
43. C.A.R. Hoare et al., Normal form approach to compiler design, Acta Inform. 30 (8) (1993) 701-739.
44. J. Hughes, Why functional programming matters, Computer J. 32 (2) (1989) 98.
45. S. Hwang and D. Rushall, The nu-STG machine: a parallelized spineless tagless graph reduction machine in a distributed memory architecture, in: Proc. 4th Internat. Workshop on the Parallel Implementation of Functional Languages, 1992.
46. O. Kaser et al., On the conversion of indirect to direct recursion, ACM Lett. Programming Languages Systems 2 (1993) 151-164.
47. E.W. Karlsen et al., The PROSPECTRA system: A unified development framework, in: M. Nivat, C. Rattray, T. Rus and G. Scollo, eds., Algebraic Methodology and Software Technology (AMAST '91) (Springer, Berlin, 1991) 421-433.
48. J.A. Keane, An overview of the flagship system, J. Funct. Programming 4 (1) (1994) 19-45.
49. D.A. Krantz, R.H. Halstead and E. Mohr, MulT: a high-performance parallel Lisp, ACM SIGPLAN Notices 24 (7) (1989) 81-90.
50. A. Maaßen, Parallel programming with data structures and higher order functions, Sci. Comput. Programming (1992) 1-38.
51. J. Magee et al., An overview of the REX software architecture, 2nd IEEE Computer Society Workshop on Future Trends of Distributed Computing Systems, 1990.
52. G. Malcolm, Data structures and program transformations, Sci. Comput. Programming 14 (1990) 255-279.
53. Shogo Matsui et al., SYNAPSE: a multi-microprocessor lisp machine with parallel garbage collector, in: Parallel Algorithms and Architectures, Lecture Notes in Computer Science, Vol. 269 (Springer, Berlin, 1987) 131-137.
54. C. McCrosky, Intermediate container removal, Comput. Languages 16 (2) (1991) 179-195.
55. P.F. McGehearty and E.J. Krall, Potentials for parallel execution of common lisp programs, in: K. Hwang, S.M. Jacobs and E.E. Swartzlander, eds., Proc. 1986 Internat. Conf. on Parallel Processing (Computer Society Press, 1986) 696-702.
56. L. Meertens, Constructing a calculus of programs, in: Mathematics of Program Construction, Lecture Notes in Computer Science, Vol. 375 (Springer, Berlin, 1989) 66-90.
57. M. Metcalf and J. Reid, Fortran 90 Explained (Oxford University Press, Oxford Science Publications, 1990).
58. J.J. Modi, Parallel Algorithms and Matrix Computations (Oxford University Press, Oxford, 1988).
59. D. Parkinson and J. Litt, eds., Massively Parallel Computing with the DAP, Research Monographs in Parallel and Distributed Computing (MIT Press, Cambridge, MA, 1990).
60. H. Partsch and R. Steinbrüggen, Program transformation systems, ACM Comput. Surveys 15 (3) (1983) 199-236.
61. S. Pelagatti, A methodology for the development and support of massively parallel programs, Ph.D. Thesis, Universita Delgi Studi di Pisa, 1993.
62. A. Pettorossi and R.M. Burstall, Deriving very efficient algorithms for evaluating linear recurrence relations using the program transformation technique, Acta Inform. 18 (1982) 181-206.
63. S.L. Peyton-Jones, The Implementation of Functional Programming Languages (Prentice-Hall, New York, 1987).
64. S.L. Peyton Jones et al., High-performance parallel graph reduction, in: E. Odijk and J.-C. Syre, eds., PARLE Parallel Architectures and Languages Europe, I, Lecture Notes in Computer Science, Vol. 365 (Springer, Berlin, 1989) 193-206.
65. D.B. Skillicorn, Architecture-independent parallel computation, IEEE Comput. 23 (12) (1990) 38-50.
66. D.R. Smith, KIDS: A semiautomatic program development system, IEEE Trans. Software Engrg. 16 (9) (1990) 1024-1043.
67. G.L. Steele, Common Lisp (Digital Press, Belford, MA, 1986).
68. P. Wadler, Deforestation: transforming programs to eliminate trees, J. Theoret. Comput. Sci. 73 (1990) 231-248.
69. A. Wilström, Functional Programming using Standard ML (Prentice-Hall, London, 1987).
70. J. Weston and M. Clint, Two algorithms for the parallel computation of eigenvalues and eigenvectors of large symmetric matrices using the ICL DAP, Parallel Comput. 13 (1990) 281-288.
71. J. Weston et al., The parallel computation of eigenvalues and eigenvectors of large Hermitian matrices using the AMT DAP 510, Concurrency: Practice and Experience 3 (3) (1991) 179-185.
72. J.A. Yang and Young-il Choo, Parallel-program transformation using a metalanguage, ACM SIGPLAN Notices 26 (7) (1991) 11-20.
73. H. Zima and B. Chapman, Supercompilers for Parallel and Vector Computers, Frontier Series (ACM, New York, 1990).