2014 International Conference on Embedded Computer Systems: Architectures, Modeling, and Simulation (SAMOS XIV) 2014
DOI: 10.1109/samos.2014.6893191
|View full text |Cite
|
Sign up to set email alerts
|

Combining application adaptivity and system-wide Resource Management on multi-core platforms

Abstract: To better exploit the capabilities offered by multi-core high-end embedded systems, new parallel programming paradigms, such as OpenCL, combined with effective resource management should be adopted. However, dealing with mixed workloads and time varying scenarios is still an open problem. This paper addresses such challenges by exploiting the synergy between Design Space Exploration and Run-Time Resource Management to achieve effective and flexible system-wide application adaptivity. The proposed approach and … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2016
2016
2020
2020

Publication Types

Select...
3
1

Relationship

1
3

Authors

Journals

citations
Cited by 4 publications
(3 citation statements)
references
References 14 publications
0
3
0
Order By: Relevance
“…Ascia et al [16] were one of the first to propose multiobjective mapping generation, using evolutionary algorithms to find Pareto-optimal points. Approaches such as [3], [17]- [19] use heuristics for efficient exploration of Pareto-optimal configurations, while others such as [4], [20] use evolutionary algorithms. The amount of considered configuration can be also reduced by exploiting system symmetries [21], [22].…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…Ascia et al [16] were one of the first to propose multiobjective mapping generation, using evolutionary algorithms to find Pareto-optimal points. Approaches such as [3], [17]- [19] use heuristics for efficient exploration of Pareto-optimal configurations, while others such as [4], [20] use evolutionary algorithms. The amount of considered configuration can be also reduced by exploiting system symmetries [21], [22].…”
Section: Related Workmentioning
confidence: 99%
“…Ykman-Couvreur et al [5], for instance, propose a fast heuristic, which expresses the resource demands of operating points as a single value, and then use a greedy algorithm to solve the MMKP. This heuristic underlies the solutions proposed in [17], [20]. Wildermann et al [6], [23] solve the problem by applying a Lagrangian relaxation method.…”
Section: Related Workmentioning
confidence: 99%
“…Given the size of the solution space in fact, the time needed to find good solutions, can be often too long for considering the execution of the policy at run-time. The BarbequeRTRM allows us to perform this exploration and insert the set of mapping solutions found into a specific file, called recipe [20]. This file is used to specify both the per-task requirements and, optionally, a set of resource mapping solutions that the resource manager should consider at run-time.…”
Section: Hierarchical Policy Definition and Updatementioning
confidence: 99%