2010 11th International Symposium on Quality Electronic Design (ISQED) 2010
DOI: 10.1109/isqed.2010.5450497
|View full text |Cite
|
Sign up to set email alerts
|

Power-yield optimization in MPSoC task scheduling under process variation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
12
0

Year Published

2010
2010
2018
2018

Publication Types

Select...
6
1

Relationship

1
6

Authors

Journals

citations
Cited by 12 publications
(12 citation statements)
references
References 12 publications
0
12
0
Order By: Relevance
“…This work extends our previous work [11] in the field of MPSoC task scheduling and binding for power maximization by adding the ability of switching between different power modes to each processor. It can be shown that by adding the flexibility of dynamically choosing different power modes for each processor to task scheduling process, total power of an MPSoC is effectively reduced.…”
Section: Introductionmentioning
confidence: 68%
See 1 more Smart Citation
“…This work extends our previous work [11] in the field of MPSoC task scheduling and binding for power maximization by adding the ability of switching between different power modes to each processor. It can be shown that by adding the flexibility of dynamically choosing different power modes for each processor to task scheduling process, total power of an MPSoC is effectively reduced.…”
Section: Introductionmentioning
confidence: 68%
“…Note that to find the dynamic power of each task, the allocated processor's power should be determined by examining the first part of the current chromosome (Algorithm 3, line 3). Then, the idle energy consumption is determined for all resources in the MPSoC as the sum of product of each processor's idle power and the sum of its idle intervals (Algorithm 3, line [9][10][11][12][13][14]. It is assumed that the processors only consume leakage power in their idle intervals, because in idle mode all internal clocking are stopped.…”
Section: Proposed Task Scheduling and Power Mode Selection Algorithmmentioning
confidence: 99%
“…In [4], the authors optimize the energy consumption in multiprocessor systems considering process variation but their approach is not a statistical optimization and they have considered the effect of variation as known values. In [5] the employed optimization algorithm is a meta-heuristic approach, which cannot guarantee convergence to the optimal solution while their execution time is also rather high. In this work we present an Integer Linear Programming (ILP) formulation for the problem of statistical task scheduling on an MPSoC and demonstrate its advantages to traditional worst-case based techniques by providing experimental results on public domain benchmarks [6].…”
Section: Introductionmentioning
confidence: 99%
“…They further extended their work to considered not only performance differences of multiple cores, but also physical link differences in NoC as well. Momtazpour et al [15] considered a similar task graph mapping problem on a multi-core NoC architecture, with the goal to maximize the percentage of manufactured chips that can meet power constraints for a given application. These statistical approaches try to optimize results in a probabilistic manner.…”
Section: Introductionmentioning
confidence: 99%