Mapping algorithms to parallel architectures efficiently is very important for a cost-effective design of many modern technical products. In this paper, we present a solution to the problem of efficiently realizing uniform data dependencies on processor arrays. In contrary to existing approaches, we formulate an optimization problem to consider the cost of both: channels and registers. Further, a solution to the optimization problem assigns which channels shall be implemented and it specifies the control for the realization of the uniform data dependencies. We illustrate our method on the edge detection algorithm. © Springer-Verlag Berlin Heidelberg 2006.
CITATION STYLE
Siegel, S., & Merker, R. (2006). Efficient realization of data dependencies in algorithm partitioning under resource constraints. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4128 LNCS, pp. 1181–1191). Springer Verlag. https://doi.org/10.1007/11823285_125
Mendeley helps you to discover research relevant for your work.