Parallel and Distributed Processing Symposium, International (2008)
Miami, FL, USA
Apr. 14, 2008 to Apr. 18, 2008
Stefan Frank , Heinz Nixdorf Institute, University Paderborn, Fürstenallee 11, 33102, Germany
Simon Oberthur , Heinz Nixdorf Institute, University Paderborn, Fürstenallee 11, 33102, Germany
Florian Dittmann , Heinz Nixdorf Institute, University Paderborn, Fürstenallee 11, 33102, Germany
Designing reconfigurable systems that beneficially exploit the spatial and temporal domain is a cumbersome task hardly supported by current design methods. In particular, if we aim to bridge the gap between application and reconfigurable substrate, we require concrete concepts that allow for utilizing the inherent parallelism and adaptiveness of reconfigurable devices. We propose algorithmic skeletons as sophisticated technique therefore. Algorithmic skeletons are programming templates for the parallel computing domain and therefore separate the structure of a computation from the computation itself. Hence, they offer a seminal means to extract temporal and spatial characteristics of an application, which can be used to make reconfigurability explicit. In this work, we show the conceptual background as well as a concrete implementation means of the method.
Stefan Frank, Simon Oberthur, Florian Dittmann, "Algorithmic skeletons for the design of partially reconfigurable systems", Parallel and Distributed Processing Symposium, International, vol. 00, no. , pp. 1-8, 2008, doi:10.1109/IPDPS.2008.4536509