By Topic

Execution Overrun Management for Fixed-Priority Preemptive Scheduling of Sporadic Graph Tasks

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
$31 $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

4 Author(s)

In this paper, we consider a real-time application composed of graphs of subtasks. We present a mechanism for execution-overrun management in realtime systems. A subtask exceeding its prescribed execution duration can result in multiple failures (cascading effect). Yet, a task execution overrun does not necessarily lead to a deadline miss. Indeed, a system with enough free resources can self-stabilize without compromising the timeliness constraints of the subtasks in the system. We propose a mechanism based on the notion of allowance that enables to cope with execution overruns before a deadline miss. The task allowance depends on free resources. We show how to determine the maximum allowance duration a subtask can be allowed to proceed with it execution without compromising the real-time constraints of all the subtasks. We show how to determine the maximum allowance of a subtask from the feasibility conditions of sporadic graphs of subtasks scheduled with a preemptive fixed priority scheduling

Published in:

Emerging Technologies and Factory Automation, 2006. ETFA '06. IEEE Conference on

Date of Conference:

20-22 Sept. 2006