By Topic

Value-density algorithms to handle transient overloads in scheduling

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

3 Author(s)
Mosse, D. ; Dept. of Comput. Sci., Pittsburgh Univ., PA, USA ; Pollack, M.E. ; Ronen, Y.

Systems with timing constraints have become pervasive in several disciplines, such as real-time artificial intelligence, operating systems, operations research, and local area networks. Most of the work in real-time system scheduling deals with admission control algorithms to guarantee that accepted tasks will meet their deadlines. In this paper, we compare the different algorithms, and suggest a novel algorithm that subsumes the previous ones with respect to schedulability in the case where the system may suffer from transient overloads and where tasks have precedence constraints among them. We show how our algorithm works in allocating time to competing reasoning modules in dynamic environments

Published in:

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

Date of Conference: