| Index | Publications | edac92 | nasecode92 | spe92 | Thesis | Implementing HPF | A HPF implementation framework | A design strategy for instrumentation amplifiers | A generalized Forall |
Techniques for local set enumeration provide the basis for constructing local iteration sets and communication sets. It is shown that both local set enumeration and local storage schemes can be derived from the same equation. Local set enumeration and local storage schemes are shown to be orthogonal, i.e. they can be freely combined. Moreover, for linear access sequences generated by our enumeration methods, the local address calculations can be moved out of the enumeration loop, yielding efficient local memory address generation.
The local set enumeration methods are implemented by using a relatively simple general transformation rule for absorbing ownership tests. This transformation rule can be be repeatedly applied to absorb multiple ownership tests. Performance figures are presented for local iteration overhead, a simple communication pattern, and storage efficiency.
CP-96-001.pdf, PDF document (463K)
CP-96-001.ps.gz, gzip compressed PostScript (151K)
Last modified Friday 23 February 2007 13:45:50 UT by Kees van Reeuwijk.