Open Access Open Access  Restricted Access Subscription or Fee Access

The System Energy Minimization for Weakly Hard Real Time System Using (m,k) Variables

Ruchika Gupta, Pallavi Sharma, Amit Kumar, A.N. Pathak

Abstract


Energy consumption and quality of service (QoS) are the two primary concerns in the development of today’s pervasive computing systems. While most of the current research in energy-aware real-time scheduling has been focused on Hard Real-time Systems, a large number of practical applications and systems exhibit more weakly hard real-time. Weakly Hard Real-time Systems can tolerate some occasional deadline misses. This feature provides a unique opportunity to reduce system’s energy.
Our goal is to minimize the system energy (energy required by frequency dependent and independent component) rather than minimization of processor energy only. We use the term frequency dependent component to refer a processor and frequency independent for memory or peripheral devices. We aim to minimize the system energy for weakly hard real time systems modeled with constraint using a combination of Dynamic voltage scaling (DVS) and Dyanamic power down (DPD). The QoS requirements are deterministically quantified with imprecise concept or by (m, k) model, while energy minimization is done in two phases, in the first phase the feasibility and energy reduction at the task level is achieved while further reduction in the energy consumption is accomplished in the improvement (second) phase at the job level. We propose a new portioning strategy to decide a job to be mandatory or optional with speed assignment for each task is done based on the greedy speed assignment technique in phase 1. While in the second phase we adopt the preemption control technique by delaying the higher priority jobs without missing its deadline. Experiments were performed and it was found that our proposed techniques improve significantly in terms of both the energy minimization as well as QoS over the existing one and over wide range of parameter including variation of m & k.


Keywords


Dynamic voltage scaling (DVS) and Dyanamic power down (DPD).

Full Text:

PDF

References


Hamdaoui, M., and P. Ramanathan. "A dynamic priority assignment technique for streams with (m, k)-firm deadlines." (IEEE Trans. Compute.) 44 (Dec. 1995).

X. Huang and A. M. K. Cheng, ―Applying Imprecise Algorithms to Real-Time Image and Video Transmission‖, Real-Time Technology and Applications Symposium, Chicago, IL, USA pp. 96-101, 15-17 May 1995

Xiao Chen and Albert Mo Kim Cheng, ―An Imprecise Algorithm for Real-Time Compressed Image and Video Transmission‖ Sixth International Conference on HYPERLINK "http://ieeexplore.ieee.org/xpl/RecentCon.jsp?punumber=4912" Computer Communications and Networks, Proceedings, Las Vegas, NV, USA , pp. 390-397

L. Niu., G. Quan, ―Energy minimization for real time systems with (m, k)- guarantee‖ IEEE Tans. On Very large scale integrated (VLSI) systems, vol. 14, no. 7 July 2006.

Quan, G., and X. Hu. "Enhanced fixed-priority scheduling with (m,k)-firm guarantee." (in Proc. RTSS) 2000.

L. Niu and G. Quan, ―System-wide dynamic power management for multimedia portable devices‖, accepted by IEEE International Symposium on Multimedia (ISM’06), 2006

Koren, G., and D. Shasha. "Skip-over: Algorithms and omplexity for overloaded systems that allow skips." (in Proc. RTSS) 1995.

H. Aydin, R. Melhem, D. Mosse, and P. Alvarez. "Determining optimal processor speeds for periodic real-time tasks with different power characteristics." (ECRTSS01) June 2001.

M. Weiser, B. Welch, A. Demers and S. Shenker., ―Scheduling for Reduced CPU energy‖, USENIX Symposium on Operating Systems Design and Implementation, 1994.

H. Aydin, V. Devadas, D. Zhu, ―System-level Energy Management for Periodic Real-Time Tasks‖ Proceedings of the 27th IEEE International Real-Time Systems Symposium (RTSS'06).

G. Bernat and A. Burns, ―Combining (n;m)-hard deadlines and dual priority scheduling,‖ in Proc. RTSS, Dec. 1997, pp. 46–57.


Refbacks

  • There are currently no refbacks.


Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.