Learn More
We study the problem of scheduling repetitive real-time tasks with the Earliest Deadline First (EDF) policy that can guarantee the given maximal temperature constraint. We show that the traditional scheduling approach, i.e., to repeat the schedule that is feasible through the range of one hyper-period, does not apply any more. Then, we present necessary and(More)
Tremendous theoretical research efforts have been made in the past decade to address the stringent real-time constraints and soaring power consumption challenges in embedded systems. However, the experimental work that can validate and evaluate the applicability and effectiveness of these theoretical results is very limited, largely due to the lengthy and(More)
  • 1