By Topic

New Schedulability Conditions for Real-Time Multiframe 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
$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

4 Author(s)
Wan-Chen Lu ; National Tsing Hua University, Taiwan ; Kwei-Jay Lin ; Hsin-Wen Wei ; Wei-Kuan Shih

The real-time multiframe task model first studied by Mok and Chen assumes that the computation times of a periodic task vary instance by instance. They have derived an utilization bound for verifying the schedulability of multiframe task sets. Their schedulability test has since been improved by other researchers. In this paper we use the information about the relative period ratios between tasks in a system to derive a new schedulability condition. By considering the smallest and the largest period values in a system, we can show that the RM schedulability bound can be improved significantly. This method also can be applied to other test methods studied earlier to improve the schedulability of real-time multiframe systems.

Published in:

19th Euromicro Conference on Real-Time Systems (ECRTS'07)

Date of Conference:

4-6 July 2007