2014 3rd Mediterranean Conference on Embedded Computing (MECO) 2014
DOI: 10.1109/meco.2014.6862676
|View full text |Cite
|
Sign up to set email alerts
|

An energy-aware dynamic scheduling algorithm for hard real-time systems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4

Citation Types

0
4
0

Year Published

2015
2015
2021
2021

Publication Types

Select...
3
1

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(4 citation statements)
references
References 14 publications
0
4
0
Order By: Relevance
“…The earliest deadline first (EDF) scheduling approach has been investigated to run real-time tasks and to place processes in a priority queue. High priority is assigned for packets closest to their deadline or expiry in the queue [140][141][142]. Houben, et al [142] have considered minimizing energy depletion in real-time systems by sorting the tasks with enhanced EDF to vary the processor modes determined by supply voltage, frequency and performance requirements.…”
Section: Scheduling Algorithmsmentioning
confidence: 99%
See 1 more Smart Citation
“…The earliest deadline first (EDF) scheduling approach has been investigated to run real-time tasks and to place processes in a priority queue. High priority is assigned for packets closest to their deadline or expiry in the queue [140][141][142]. Houben, et al [142] have considered minimizing energy depletion in real-time systems by sorting the tasks with enhanced EDF to vary the processor modes determined by supply voltage, frequency and performance requirements.…”
Section: Scheduling Algorithmsmentioning
confidence: 99%
“…High priority is assigned for packets closest to their deadline or expiry in the queue [140][141][142]. Houben, et al [142] have considered minimizing energy depletion in real-time systems by sorting the tasks with enhanced EDF to vary the processor modes determined by supply voltage, frequency and performance requirements. However, several request packets in the queue can have the same deadline, and the EDF algorithm does not consider the time redundancy management of these packets, nor does it give priority to packets that come from longer distances, with more hops which causes higher energy depletion.…”
Section: Scheduling Algorithmsmentioning
confidence: 99%
“…Houben and Halan [12] have proposed a dynamic scheduling algorithm of energy aware for hard real-time systems that is based on EDF scheme. As previously mentioned, DVFS is one of the energy management techniques that it adjusts dynamically the frequency and voltage in the scheduling algorithms.…”
Section: Hard Real-time Scheduling Algorithms and Approaches For Specmentioning
confidence: 99%
“…In [12] runtime complexity of energy aware and EDF based scheduling algorithm is O(n log n) if a task is ready for execution. For the implementation of this method PEARL90 [19] has been used which has the most advanced real-time capabilities.…”
Section: Specific Scheduling Algorithmsmentioning
confidence: 99%