O. Beckmann. Interprocedural Optimisation of Regular Parallel Computations at Runtime. PhD thesis, Imperial College of Science, Technology and Medicine, University of London, Jan. 2001.  Home/Search   Document Not in Database   Summary   Related Articles

....approach is to use delayed evaluation of software components in order to re capture lost context information from within the component library at runtime. While execution is being delayed, we can build up a DAG (directed acyclic graph) representing the data flow of the computation to be performed [1]. Evaluation is eventually forced, either because we have to output result data, or because the control flow of the program becomes data dependent (in conditional expressions) Once execution is forced, we can construct an optimised execution plan at runtime, automatically and transparently ....

....for BLAS [4] and a C interface. The C interface uses operator overloading to facilitate high level, generic coding of algorithms. This paper is accompanied by a public release of this library [7] Contributions of this Paper. We have previously described the basic idea behind this library [1, 2]. The distinct contributions of this paper are as follows: 1. We demonstrate the usability of our approach by showing how a number of common iterative numerical solvers can be implemented in a high level, intuitive manner using this approach. 2. We show that the C interface, which we have not ....

[Article contains additional citation context not shown here]

O. Beckmann. Interprocedural Optimisation of Regular Parallel Computations at Runtime. PhD thesis, Imperial College of Science, Technology and Medicine, University of London, Jan. 2001.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC