By Topic

Dynamic Scheduling of Skippable Periodic Tasks in Weakly-Hard Real-Time Systems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Maryline Chetto ; University of Nantes, France ; Audrey Marchand

This paper deals with dynamic scheduling in real-time systems that have quality of service requirements. We assume that tasks are periodic and may miss their deadlines, occasionally, as defined by the so-called Skip-Over model. In this paper, we present a dynamic scheduling algorithm, called RLP (Red as Late as possible), a variant of earliest deadline to make slack stealing and get better performance in terms of ratio of periodic task instances which complete before their deadline. Simulation results show that RLP outperforms the two conventional skip-over algorithms, namely RTO (Red Tasks Only) and BWP (Blue When Possible), introduced about ten years ago. Finally, we present the integration of these QoS scheduling services into CLEOPATRE, a free open-source library which offers selectable real-time facilities on shelves

Published in:

14th Annual IEEE International Conference and Workshops on the Engineering of Computer-Based Systems (ECBS'07)

Date of Conference:

26-29 March 2007