A Blocking-Aware Scheduling for Real-Time Task Synchronization Using a Leakage-Controlled Method
Author(s) -
MuYen Chen,
DaRen Chen,
Shu-Ming Hsieh
Publication year - 2014
Publication title -
international journal of distributed sensor networks
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.324
H-Index - 53
eISSN - 1550-1477
pISSN - 1550-1329
DOI - 10.1155/2014/428230
Subject(s) - computer science , priority inversion , priority ceiling protocol , scheduling (production processes) , energy consumption , real time computing , dynamic voltage scaling , computation , earliest deadline first scheduling , power saving , embedded system , distributed computing , dynamic priority scheduling , computer network , power (physics) , rate monotonic scheduling , algorithm , ecology , operations management , quality of service , physics , quantum mechanics , economics , biology
Due to the importance of power dissipation in the wireless sensor networks and embedded systems, real-time scheduling has been studied in terms of various optimization problems. Real-time tasks that synchronize to enforce mutually exclusive access to the shared resources could be blocked by lower priority tasks. While dynamic voltage scaling (DVS) is known to reduce dynamic power consumption, it causes increased blocking time due to lower priority tasks that prolong the interval over which a computation is carried out. Additionally, processor slowdown to increase execution time implies greater leakage energy consumption. In this paper, a leakage-controlled method is proposed, which decreases both priority inversion and power consumption. Based on priority ceiling protocol (PCP) and a graph reduction technique, this method can decrease more energy consumption and avoid priority inversion for real-time tasks.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom