Procrastination Scheduling for Fixed-Priority Tasks with Preemption Thresholds

  • Authors:
  • Xiaochuan He;Yan Jia

  • Affiliations:
  • Institute of Network Technology and Information Security School of Computer Science, National University of Defense Technology, Changsha, China 410073;Institute of Network Technology and Information Security School of Computer Science, National University of Defense Technology, Changsha, China 410073

  • Venue:
  • NPC '08 Proceedings of the IFIP International Conference on Network and Parallel Computing
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

Dynamic Voltage Scaling (DVS), which adjusts the clock speed and supply voltage dynamically, is an effective technique in reducing the energy consumption of embedded real-time systems. However, the longer a job executes, the more energy in the leakage current the device/processor consumes for the job. Procrastination scheduling, where task execution can be delayed to maximize the duration of idle intervals by keeping the processor in a sleep/shutdown state even if there are pending tasks within the timing constraints imposed by performance requirements, has been proposed to minimize leakage energy drain. This paper targets energy-efficient fixed-priority with preemption threshold scheduling for periodic real-time tasks on a uniprocessor DVS system with non-negligible leakage power consumption. We propose a two-phase algorithm. In the first phase, the execution speed, i.e., the supply voltage of each task are determined by applying off-line algorithms, and in the second phase, the procrastination length of each task is derived by applying on-line simulated work-demand time analysis, and thus the time moment to turn on/off the system is determined on the fly. A series of simulation experiments was evaluated for the performance of our algorithms. The results show that our proposed algorithms can derive energy-efficient schedules.