BTS-SRP: An Energy-Efficient Concurrency Control Protocol for Embedded Real-Time Systems

Abstract

We explored the scheduling problem of dependent real-time tasks that may access multiunit resources on a non- ideal dynamic voltage scaling (DVS) processor. Based on the stack resource policy (SRP) protocol and the earliest deadline first (EDF) algorithm, we propose an approach, called blocking-time stealing stack resource policy (BTS-SRP), for the scheduling of dependent real-time tasks. Under the BTS-SRP, tasks are executed at proper processor speeds which are calculated according to the sufficient schedulability condition of the EDF and the SRP. In order to obtain more energy saving, a blocking-time stealing method is also proposed to dynamically adjust the processor speed. Our experimental results show that the BTS-SRP outperforms pervious work. policy (BTS-SRP), is proposed so as to manage the resource sharing problem and to reduce the energy consumption of tasks without violating their timing constraints. The BTS- SRP uses the EDF for scheduling dynamic-priority tasks. Under the BTS-SRP, tasks are scheduled to be executed at proper processor speeds which are calculated according to the sufficient schedulability condition for the EDF algorithm. We also propose a blocking-time stealing method to reclaim the blocking time for slowing down the processor speed. As the results, more energy saving could be obtained. The capabilities of the BTS-SRP were evaluated by experiments. It shows that our proposed BTS-SRP outperforms previous work.