Abstract
We show how efficient implementations can be derived from high-level functional specifications of numerical algorithms using automatic program transformation. We emphasize the automatic tailoring of implementations for manipulation of sparse data sets. Execution times are reported for a conjugate gradient algorithm.
This work is supported by SERC Grant GR/G 57970, by a research studentship from the Department of Education for Northern Ireland and by the Office of Scientific Computing, U.S. Department of Energy, under Contract W-31-109-Eng-38
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
A Transformational Component for Programming Language Grammar, J. M. Boyle, ANL-7690 Argonne National Laboratory, July 1970, Argonne, Illinois.
Abstract programming and program transformations — An approach to reusing programs. James M. Boyle, Editors Ted J. Biggerstaff and Alan J. Perlis in Software Reusability, Volume I, Pages 361–413, ACM Press (Addison-Wesley Publishing Company), New York, NY, 1989.
Program reusability through program transformation James M. Boyle and M. N. Muralidharan, IEEE Trans. Software Eng., 10 (5): 574–88 (Sept.) 1984.
Functional specifications for mathematical computations James M. Boyle, T. J. Harmer, Editor B. Moeller in Proc. IFIP TC2/WG2.1 Working Conf. on Construction Programs from Specifications.
Program adaption and program transformation In R. Ebert, J. Lueger and L. Goecke (editors), Practice in Software Adaption and Maintenance, pp. 3–20, North-Holland, Amsterdam.
A Practical Functional Program for the Cray X-MP, J.M. Boyle and T.J. Harmer, Journal of Functional Programming, 2(1), 1992, pp81–126.
The Construction of Numerical Mathematical Software for the AMT DAP by Program Transformation, J.M. Boyle, M. Clint, Stephen Fitzpatrick and T.J. Harmer, Proceedings of CONPAR 92-VAPP V, L Bouge, M. Cosnard, Y. Robert, D. Trystram (editors), Springer-Verlag.
Deriving Distributed MIMD Implementations from Functional Specifications, JM Boyle, M Clint, S Fitzpatrick and TJ Harmer, Proceedings of ParCo '93 pp44–48, 7–10 September 1993, Grenoble, France.
Computer program for solution of large sparse unsymmetric systems of linear equations, JE Key, Int. J. Numer. meth. Eng. 6, pp497–509.
Functional Programming using Standard ML, A. Wilström, Prentice Hall, London 1987.
Sparse Matrix Technology, Sergio Pissanetsky, Academic Press, 1984.
Parallel Algorithm Derivation and Program Transformation, editors R Paige, J Reif and R Wachter, Kluwer Publishing, 1993.
A Study of Sparse Matrix Representations for Solving Linear Systems in a Functional Language, RL Wainwright and ME Sexton, Journal of Functional Programming, 2(1), pp61–72.
Parallel Decomposition of Matrix Inversion using Quadtrees, DS Wise, Proc. Int. Conf. on Parallel Processing, 1986, pp92–99.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fitzpatrick, S., Harmer, T.J., Boyle, J.M. (1994). Deriving efficient parallel implementations of algorithms operating on general sparse matrices using automatic program transformation. In: Buchberger, B., Volkert, J. (eds) Parallel Processing: CONPAR 94 — VAPP VI. VAPP CONPAR 1994 1994. Lecture Notes in Computer Science, vol 854. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58430-7_14
Download citation
DOI: https://doi.org/10.1007/3-540-58430-7_14
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58430-8
Online ISBN: 978-3-540-48789-0
eBook Packages: Springer Book Archive