2010 IEEE/ACM International Conference on Computer-Aided Design (ICCAD) 2010
DOI: 10.1109/iccad.2010.5654109
|View full text |Cite
|
Sign up to set email alerts
|

Combining optimistic and pessimistic DVS scheduling: An adaptive scheme and analysis

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
15
0

Year Published

2011
2011
2015
2015

Publication Types

Select...
6
1

Relationship

2
5

Authors

Journals

citations
Cited by 8 publications
(15 citation statements)
references
References 14 publications
0
15
0
Order By: Relevance
“…By adopting RTC models, Chen et al [2009] explored the schedulability for the online DVFS scheduling algorithms proposed in Yao et al [1995]. Combining optimistic and pessimistic DVFS scheduling, Perathoner et al [2010] presented an adaptive scheme for the scheduling of arbitrary event streams. When only considering dynamic power management (DPM), Huang et al [2009bHuang et al [ , 2011a presented an algorithm to find periodic time-driven patterns to turn on/off the processor for energy saving.…”
Section: Related Workmentioning
confidence: 99%
“…By adopting RTC models, Chen et al [2009] explored the schedulability for the online DVFS scheduling algorithms proposed in Yao et al [1995]. Combining optimistic and pessimistic DVFS scheduling, Perathoner et al [2010] presented an adaptive scheme for the scheduling of arbitrary event streams. When only considering dynamic power management (DPM), Huang et al [2009bHuang et al [ , 2011a presented an algorithm to find periodic time-driven patterns to turn on/off the processor for energy saving.…”
Section: Related Workmentioning
confidence: 99%
“…By adopting RTC models, Chen et al [6] explored the schedulability for online DVFS scheduling algorithms. Combining optimistic and pessimistic DVFS Scheduling, Perathoner et al [19] presented an adaptive scheme for the scheduling of arbitrary event streams. When only consider dynamic power management (DPM), Huang et al [10] presented a algorithm to find periodic time-driven patterns to turn on/off processor for energy saving.…”
Section: Related Workmentioning
confidence: 99%
“…Proof: By using the approximated lower bound of (11), the lower bound of end-to-end service curve β Gl i (∆) for stream S i (i = 1, ..., m) can be derived as the form of the right hand side of (19) according to Lem. 1.…”
Section: Problem Formulationmentioning
confidence: 99%
“…By using the arrival curve model [7] to abstract task arrivals into time interval domain, techniques based on dynamic frequency scaling [8], [10] and dynamic power management [5], [4] have been recently proposed for uni-processor systems. Nevertheless, how to cope with multiple processors is not yet clear.…”
Section: Related Workmentioning
confidence: 99%