2015 IEEE 10th Jubilee International Symposium on Applied Computational Intelligence and Informatics 2015
DOI: 10.1109/saci.2015.7208251
|View full text |Cite
|
Sign up to set email alerts
|

Comparison of two loop-free decomposition methods

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2016
2016
2016
2016

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 11 publications
0
1
0
Order By: Relevance
“…DECHLS receives the task to be solved as a C code and after performing the task decomposition assigns the subtasks into component processors considering the requirements and their priority order definable by the designer. The application of the DECHLS has been illustrated and evaluated on practical examples [77,78,79].…”
Section: System Level Synthesismentioning
confidence: 99%
“…DECHLS receives the task to be solved as a C code and after performing the task decomposition assigns the subtasks into component processors considering the requirements and their priority order definable by the designer. The application of the DECHLS has been illustrated and evaluated on practical examples [77,78,79].…”
Section: System Level Synthesismentioning
confidence: 99%