A Compilation Strategy for Numerical Programs Based on Partial Evaluation

Title: en_US A Compilation Strategy for Numerical Programs Based on Partial Evaluation
Creator: en_US Berlin, Andrew A.
Date: 2004-10-20T20:12:09Z
Date Available: 2004-10-20T20:12:09Z
Date Issued: en_US 1989-02-01
Identifier: en_US AITR-1144
uri: http://hdl.handle.net/1721.1/6981
Abstract: en_US This work demonstrates how partial evaluation can be put to practical use in the domain of high-performance numerical computation. I have developed a technique for performing partial evaluation by using placeholders to propagate intermediate results. For an important class of numerical programs, a compiler based on this technique improves performance by an order of magnitude over conventional compilation techniques. I show that by eliminating inherently sequential data-structure references, partial evaluation exposes the low-level parallelism inherent in a computation. I have implemented several parallel scheduling and analysis programs that study the tradeoffs involved in the design of an architecture that can effectively utilize this parallelism. I present these results using the 9- body gravitational attraction problem as an example.
Extent: 7397665 bytes; 2736044 bytes
Format: application/postscript; application/pdf
Language: en_US
Relation: en_US AITR-1144