1998 IEEE/ACM International Conference on Computer-Aided Design. Digest of Technical Papers (IEEE Cat. No.98CB36287)
DOI: 10.1109/iccad.1998.743089
|View full text |Cite
|
Sign up to set email alerts
|

On-line scheduling of hard real-time tasks on variable voltage processor

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
15
0

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 12 publications
(15 citation statements)
references
References 0 publications
0
15
0
Order By: Relevance
“…They also designed the algorithm to accept the highest possible number of online tasks that can be guaranteed to meet their deadlines. 7 Shin et al proposed a power-efficient version of fixed-priority preemptive scheduling, which is widely used in hard real-time system design. 8 Their method reduces energy consumption in the processor by exploiting systeminherent slack times, as well as slack times arising from dynamic variations of execution times for the task.…”
Section: Related Workmentioning
confidence: 99%
“…They also designed the algorithm to accept the highest possible number of online tasks that can be guaranteed to meet their deadlines. 7 Shin et al proposed a power-efficient version of fixed-priority preemptive scheduling, which is widely used in hard real-time system design. 8 Their method reduces energy consumption in the processor by exploiting systeminherent slack times, as well as slack times arising from dynamic variations of execution times for the task.…”
Section: Related Workmentioning
confidence: 99%
“…[4][5][6][7][8]) and online (e.g. [9,10]) strategy. While offline techniques optimize the voltage and speed of each task at compile time, online approaches do so at runtime to reduce the system power consumption.…”
Section: Introductionmentioning
confidence: 99%
“…Heuristics for on-line scheduling of aperiodic tasks while not hurting the feasibility of offline periodic requests are proposed in [7]. Non-preemptive power-aware scheduling is investigated in [6].…”
Section: Relatedmentioning
confidence: 99%
“…However, the MCKP is known to be NPhard [18] which implies that it is very unlikely to design a fast (polynomial-time) exact method for its solution. From a practical point of view this means that exact methods, such as dynamic programming [18], Lagrange multipliers [1], mixed-integer linear programming [26] and enumeration schemes [7] , do not satisfy realistic temporal requirements for solving any reasonable size MCKP (that is, cannot generate a solution with milliseconds).…”
Section: The Optimization Problemmentioning
confidence: 99%