Exploiting Maximum Value and Energy Awareness in Real-Time Scheduling

The maximum power budget on electronic devices is limited by the rechargeable electrochemical batteries, so the energy awareness and high performance has been an important issue for the embedded systems. We present a scheduling algorithm that maximizes the value for the multiple task sets by applying dynamically at run time to cope with changes in the execution environment. In order to apply the scheduling algorithm to each task set when it goes out from a queue, we modified REWpack and REW-unpack algorithms, and also investigated the admission algorithm of a task set to decide whether or not a new task set is accepted to go into the system.