Title
Efficient realization of data dependencies in algorithm partitioning under resource constraints
Abstract
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.
Year
DOI
Venue
2006
10.1007/11823285_125
international conference on parallel processing
Keywords
Field
DocType
efficient realization,uniform data dependency,edge detection algorithm,algorithm partitioning,optimization problem,resource constraint,processor array,mapping algorithm,modern technical product,cost-effective design,cost effectiveness,edge detection
Data dependency,Parallel algorithm,Computer science,Edge detection,Parallel computing,Communication channel,Algorithm,Integer programming,Mapping algorithm,Vector processor,Optimization problem,Distributed computing
Conference
Volume
ISSN
ISBN
4128
0302-9743
3-540-37783-2
Citations 
PageRank 
References 
0
0.34
12
Authors
2
Name
Order
Citations
PageRank
Sebastian Siegel1294.16
Renate Merker215920.59