Applying Dynamic Priority Scheduling Scheme to Static Systems of Pinwheel Task Model in Power-Aware Scheduling
Power-aware scheduling reduces CPU energy consumption in hard real-time systems through dynamic voltage scaling (DVS). In this paper, we deal with pinwheel task model which is known as static and predictable task model and could be applied to various embedded or ubiquitous systems. In pinwheel task...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2014-01-01
|
| Series: | The Scientific World Journal |
| Online Access: | http://dx.doi.org/10.1155/2014/587321 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832551835195408384 |
|---|---|
| author | Ye-In Seol Young-Kuk Kim |
| author_facet | Ye-In Seol Young-Kuk Kim |
| author_sort | Ye-In Seol |
| collection | DOAJ |
| description | Power-aware scheduling reduces CPU energy consumption in hard real-time systems through dynamic voltage scaling (DVS). In this paper, we deal with pinwheel task model which is known as static and predictable task model and could be applied to various embedded or ubiquitous systems. In pinwheel task model, each task’s priority is static and its execution sequence could be predetermined. There have been many static approaches to power-aware scheduling in pinwheel task model. But, in this paper, we will show that the dynamic priority scheduling results in power-aware scheduling could be applied to pinwheel task model. This method is more effective than adopting the previous static priority scheduling methods in saving energy consumption and, for the system being still static, it is more tractable and applicable to small sized embedded or ubiquitous computing. Also, we introduce a novel power-aware scheduling algorithm which exploits all slacks under preemptive earliest-deadline first scheduling which is optimal in uniprocessor system. The dynamic priority method presented in this paper could be applied directly to static systems of pinwheel task model. The simulation results show that the proposed algorithm with the algorithmic complexity of O(n) reduces the energy consumption by 10–80% over the existing algorithms. |
| format | Article |
| id | doaj-art-cfb151a47bff465c8717b52ce6893bd6 |
| institution | Kabale University |
| issn | 2356-6140 1537-744X |
| language | English |
| publishDate | 2014-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | The Scientific World Journal |
| spelling | doaj-art-cfb151a47bff465c8717b52ce6893bd62025-02-03T06:00:29ZengWileyThe Scientific World Journal2356-61401537-744X2014-01-01201410.1155/2014/587321587321Applying Dynamic Priority Scheduling Scheme to Static Systems of Pinwheel Task Model in Power-Aware SchedulingYe-In Seol0Young-Kuk Kim1Green Energy Institute, Sangmyung University, Seoul 110-743, Republic of KoreaDeptartment of Computer Science & Engineering, Chungnam Nat’l University, Daejeon 305-764, Republic of KoreaPower-aware scheduling reduces CPU energy consumption in hard real-time systems through dynamic voltage scaling (DVS). In this paper, we deal with pinwheel task model which is known as static and predictable task model and could be applied to various embedded or ubiquitous systems. In pinwheel task model, each task’s priority is static and its execution sequence could be predetermined. There have been many static approaches to power-aware scheduling in pinwheel task model. But, in this paper, we will show that the dynamic priority scheduling results in power-aware scheduling could be applied to pinwheel task model. This method is more effective than adopting the previous static priority scheduling methods in saving energy consumption and, for the system being still static, it is more tractable and applicable to small sized embedded or ubiquitous computing. Also, we introduce a novel power-aware scheduling algorithm which exploits all slacks under preemptive earliest-deadline first scheduling which is optimal in uniprocessor system. The dynamic priority method presented in this paper could be applied directly to static systems of pinwheel task model. The simulation results show that the proposed algorithm with the algorithmic complexity of O(n) reduces the energy consumption by 10–80% over the existing algorithms.http://dx.doi.org/10.1155/2014/587321 |
| spellingShingle | Ye-In Seol Young-Kuk Kim Applying Dynamic Priority Scheduling Scheme to Static Systems of Pinwheel Task Model in Power-Aware Scheduling The Scientific World Journal |
| title | Applying Dynamic Priority Scheduling Scheme to Static Systems of Pinwheel Task Model in Power-Aware Scheduling |
| title_full | Applying Dynamic Priority Scheduling Scheme to Static Systems of Pinwheel Task Model in Power-Aware Scheduling |
| title_fullStr | Applying Dynamic Priority Scheduling Scheme to Static Systems of Pinwheel Task Model in Power-Aware Scheduling |
| title_full_unstemmed | Applying Dynamic Priority Scheduling Scheme to Static Systems of Pinwheel Task Model in Power-Aware Scheduling |
| title_short | Applying Dynamic Priority Scheduling Scheme to Static Systems of Pinwheel Task Model in Power-Aware Scheduling |
| title_sort | applying dynamic priority scheduling scheme to static systems of pinwheel task model in power aware scheduling |
| url | http://dx.doi.org/10.1155/2014/587321 |
| work_keys_str_mv | AT yeinseol applyingdynamicpriorityschedulingschemetostaticsystemsofpinwheeltaskmodelinpowerawarescheduling AT youngkukkim applyingdynamicpriorityschedulingschemetostaticsystemsofpinwheeltaskmodelinpowerawarescheduling |