2011 IEEE 17th International Conference on Parallel and Distributed Systems 2011
DOI: 10.1109/icpads.2011.31
|View full text |Cite
|
Sign up to set email alerts
|

Automatic Extraction of Pipeline Parallelism for Embedded Software Using Linear Programming

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
7
0

Year Published

2013
2013
2018
2018

Publication Types

Select...
4
2
2

Relationship

0
8

Authors

Journals

citations
Cited by 18 publications
(7 citation statements)
references
References 20 publications
0
7
0
Order By: Relevance
“…Subhlok et al considered a model where every task can be perfectly parallelized on homogeneous processors and provided mapping solutions for opti mizing throughput [9] as well as solutions for latency throughput trade-offs [10] . Recently, Kudlur et al and Cordes et al used integer linear programming to extract data parallelism from streaming pipelines [11], [12]. While they considered replication, they all assumed that the work of replicated stages should be evenly divided and assigned to replicas.…”
Section: Related Workmentioning
confidence: 99%
“…Subhlok et al considered a model where every task can be perfectly parallelized on homogeneous processors and provided mapping solutions for opti mizing throughput [9] as well as solutions for latency throughput trade-offs [10] . Recently, Kudlur et al and Cordes et al used integer linear programming to extract data parallelism from streaming pipelines [11], [12]. While they considered replication, they all assumed that the work of replicated stages should be evenly divided and assigned to replicas.…”
Section: Related Workmentioning
confidence: 99%
“…One of the possible solutions to deal with the heterogeneity of the underlying platform is to use a model that to consider different execution times for loop iterations of the program. Thus, these execution times are taken into account to select the processing units according to its performance characteristics, as well as, to determine the number of processing units that are used simultaneously . An efficient and economical way of using computational resources is to adopt policies and approaches for deciding the task granularity at run time based on computational resource utilisation constraints, quality of service requirements, and the average task deployment metrics .…”
Section: Future Research Directionsmentioning
confidence: 99%
“…In [21], an ILP formulation is utilized to search a smaller design space and find an appropriate configuration for ASIPs, with the objective of minimizing the system area and satisfying system runtime constraints in pipelined processors. An ILP-based mapping approach is presented in [22] to minimize the most expensive path in a pipeline under the constraints of program dependency and the maximal number of concurrently executed components. In summary, the aforementioned methods do not significantly consider the discussed two factors (cyclic task dependency and communication overhead) in software pipeline.…”
Section: Related Workmentioning
confidence: 99%