Reliability-aware fixed priority energy management with shared resources in real-time system Online publication date: Wed, 15-Apr-2020
by Yiwen Zhang; Huizhen Zhang; Weixian Jiang
International Journal of Computer Applications in Technology (IJCAT), Vol. 62, No. 3, 2020
Abstract: In this paper, we focus on preemptive rate monotonic scheduling and comprehensively consider energy consumption and system reliability about scheduling periodic tasks with shared resources. Firstly, a static scheme for fixed priority periodic tasks with shared resources is proposed, which executes with a uniform speed and ignores the system reliability. Secondly, the problem of energy consumption and system reliability for scheduling fixed priority periodic tasks with shared resources is proved to be NP-hard and a maximum execution time first (MF) algorithm is proposed. Finally, a dynamic scheme for fixed priority periodic tasks with shared resources (DA) is proposed. The DA algorithm exploits the dynamic slack time to save energy while preserving the system reliability. The experimental results show that the DA algorithm saves about 19.28% energy compared with the MF algorithm.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Computer Applications in Technology (IJCAT):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com