Performance Estimation Based Multicriteria Partitioning Approach for Dynamic Dataflow Programs

The problem of partitioning a dataflow program onto a target architecture is a difficult challenge for any application design. In general, since the problem is NP-complete, it consists of looking for high quality solutions in terms of maximizing the achievable data throughput. The difficulty is give...

Full description

Saved in:
Bibliographic Details
Published in:Journal of electrical and computer engineering 2016-01, Vol.2016 (2016), p.1-15
Main Authors: Michalska, Małgorzata, Mattavelli, Marco, Zufferey, Nicolas
Format: Article
Language:English
Subjects:
Algorithms
Capital punishment
Communication
Design engineering
Dynamics
Exploration
Extreme values
Mathematical models
Methodology
Methods
Partitioning
Platforms
Quality
Scheduling
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The problem of partitioning a dataflow program onto a target architecture is a difficult challenge for any application design. In general, since the problem is NP-complete, it consists of looking for high quality solutions in terms of maximizing the achievable data throughput. The difficulty is given by the exploration of the design space which results in being extremely large for parallel platforms. The paper describes a heuristic partitioning methodology applicable to dynamic dataflow programs. The methodology is based on two elements: an execution model of the dynamic dataflow program which is used as estimation of the performance for the exploration of the large design space and several partitioning algorithms competing to lead to specific high quality solutions. Experimental results are validated with executions on a virtual platform.
ISSN:2090-0147
2090-0155
DOI:10.1155/2016/8536432