Automating multiple program realizations. [Single and double precision, real and complex arithmetic, etc. , versions of one basic routine].
- Summary
- The problem of reducing the cost of developing, validating, and maintaining packages of numerical subroutines is a topic currently under investigation. Where such packages are to be made available in versions tailored to run on several different manufacturers' computers, the problem has been attacked by taking advantage of commonality; that is, the number of routines to be handled (and hence the cost) is reduced by creating a kind of prototype for each routine which can be processed automatically to produce the several required machine-tailored versions of that routine. It is shown here how these costs can often be further reduced by taking a more general view of commonality. Packages frequently contain several subroutines which are the same program realized in different modes. The potential economies of commonality can be achieved by employing a program manipulation system which permits one to describe (and to automate) the construction of different realizations of the same prototype program. The capabilities of one such system are illustrated by considering in detail a program realization which trades structure for efficiency in some implementations: namely, the realization of prototype programs which call the Hanson, Krogh, and Lawson Basic Linear Algebra Modules, as programs with these calls replaced by in-line code. The analysis of this realization and the specification of transformations which guide the manipulation system in constructing it are described. Finally, some of the problems involved in trying to demonstrate the correctness of this automated realization are considered briefly. 15 figures.
- Report Numbers
- CONF-760471-1
- Other Subject(s)
- Collection
- U.S. Atomic Energy Commission depository collection.
- Note
- OSTI Identifier 7361171
Research organization: Argonne National Lab., Ill. (USA).
View MARC record | catkey: 43930135