By Topic

Dynamic value-density for scheduling 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
$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

2 Author(s)
Aldarmi, S.A. ; Dept. of Comput. Sci., York Univ., UK ; Burns, A.

Scheduling decisions in time-critical systems are very difficult, due to the vast number of systems' parameters and tasks' attributes involved in such decisions. Value-based scheduling heuristics have been found to experience a more graceful degradation under overload situations than various other heuristics. However, currently existing value-based heuristics utilize the tasks' static attributes, and therefore, they derive fixed scheduling priorities. In this paper, we propose value-based scheduling heuristics that utilize the tasks' dynamic attributes in order to enhance the overall system's performance under normal operating loads and to reduce performance degradation under overload situations

Published in:

Real-Time Systems, 1999. Proceedings of the 11th Euromicro Conference on

Date of Conference: