24 October 1997 Approach for the determination of a Jacobi specific dataflow processor
Author Affiliations +
Abstract
In this paper, we present an approach for determining a dataflow processor which is intended for the execution of Jacobi algorithms which are found in the application domain of array processing and other real-time adaptive signal processing applications. Our approach to determine a processor for their execution is to exploit the quasi regularity property in their dependence graph representations in search for what we call the Jacobi processor. This processor emerges from an exploration iteration which takes off from a processor template and a set of Jacobi algorithms. Based on qualitative and quantitative performance analysis, both the algorithms and the processor template are restructured towards improved execution performance. To ensure the mapper is part of the emerging processor specification, the algorithm-to-processor mapping method is included in the iterative and hierarchical exploration method. The control flow in the processor exploits properties related to regularity in the structure of the algorithms; allows gentle transitions from regular to irregular levels in the algorithm hierarchy, and supports different control models for the irregular structures that appear at deeper levels in the hierarchy. Transformations aiming at reducing critical paths, increasing throughput, improving mapping efficiency and minimizing control overheads are taken into account. They include retiming, pipelining and lookahead techniques.
© (1997) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Ed F. A. Deprettere, Gerben J. Hekstra, Edwin Rypkema, "Approach for the determination of a Jacobi specific dataflow processor", Proc. SPIE 3162, Advanced Signal Processing: Algorithms, Architectures, and Implementations VII, (24 October 1997); doi: 10.1117/12.284190; https://doi.org/10.1117/12.284190
PROCEEDINGS
14 PAGES


SHARE
Back to Top