Abstract
In this paper, we are interested by the integration ofprecedence and resources sharing constraints in the real time scheduling of periodic and aperiodic tasks. We also treat the problem of dynamic voltage scaling of the processor in the same context. Many dynamic voltage scaling algorithms have been proposed in the literature. However, these algorithms do not consider the constraints of precedence and shared resources on the scheduling of periodic and aperiodic tasks. In this case, we propose two algorithms with the constraints cited above. Experimental results show that the proposed algorithms reduce the energy consumption under earliest deadline firstscheduling policy and the stack resource policy.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
