|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
| ASCII Text | x | ||
| Sebastian Siegel, Renate Merker, "Minimum Cost for Channels and Registers in Processor Arrays by Avoiding Redundancy," 2012 IEEE 23rd International Conference on Application-Specific Systems, Architectures and Processors, pp. 28-32, IEEE 17th International Conference on Application-specific Systems, Architectures and Processors (ASAP'06), 2006. | |||
| BibTex | x | ||
| @article{ 10.1109/ASAP.2006.46, author = {Sebastian Siegel and Renate Merker}, title = {Minimum Cost for Channels and Registers in Processor Arrays by Avoiding Redundancy}, journal ={2012 IEEE 23rd International Conference on Application-Specific Systems, Architectures and Processors}, volume = {0}, year = {2006}, issn = {1063-6862}, pages = {28-32}, doi = {http://doi.ieeecomputersociety.org/10.1109/ASAP.2006.46}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - CONF JO - 2012 IEEE 23rd International Conference on Application-Specific Systems, Architectures and Processors TI - Minimum Cost for Channels and Registers in Processor Arrays by Avoiding Redundancy SN - 1063-6862 SP28 EP32 A1 - Sebastian Siegel, A1 - Renate Merker, PY - 2006 KW - null VL - 0 JA - 2012 IEEE 23rd International Conference on Application-Specific Systems, Architectures and Processors ER - | |||
In the process of mapping compute-intensive algorithms onto arrays of processing elements (PEs) an efficient usage of channels between PEs and registers within PEs is crucial for achieving a significant algorithm acceleration. In this paper this problem is solved for algorithms represented as systems of uniform recurrence equations. We address an optimization problem in order to realize the algorithmic data dependencies within the processor array (PA) with minimum cost for channels and registers. There, we use a new mapping approach which allows a direct mapping of the algorithm onto the PA by a partitioning method.
In contrast to existing approaches, we consider the issue of avoiding redundant usage of channels and registers, which can appear if one instance of a variable has to be transferred from a source PE to several sink PEs. Further, a solution of the optimization problem determines the schedule for the transfer of the variable instances in the channels and their storage in registers as well as the inner schedule for the operations in the PEs. We illustrate our method on the edge detection algorithm.