By Topic

Dynamic scheduling algorithm and its schedulability analysis for certifiable dual-criticality 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)
Taeju Park ; Department of Computer Science, KAIST, Daejeon, South Korea ; Soontae Kim

Real-time embedded systems are becoming more complex to include multiple functionalities. Sharing a computing platform is a natural and effective solution to reducing the cost of those systems. However, the sharing can cause serious problems in mixed-criticality systems where applications have different levels of criticality. Certifying the mixed-criticality systems requires efficient scheduling algorithms and schedulability tests different from the ones used in single criticality systems. In this paper, we propose the first dynamic scheduling algorithm called CBEDF for certifiable mixed-criticality systems on a uniprocessor platform. We show that CBEDF dominates previously proposed algorithms OCBP. In addition, we propose a sufficient schedulability test for CBEDF. We demonstrate that the schedulability test of CBEDF out-performs that of the previously proposed algorithms by performing simulations using randomly generated instances of jobs.

Published in:

Embedded Software (EMSOFT), 2011 Proceedings of the International Conference on

Date of Conference:

9-14 Oct. 2011