A Tool for Controlling Response Time in Real-Time Systems

Authors:
Pascal Richard
Affiliations:
-
Venue:
TOOLS '02 Proceedings of the 12th International Conference on Computer Performance Evaluation, Modelling Techniques and Tools
Year:
2002

Citing 4
Cited 0

Flow and stretch metrics for scheduling continuous job streams

Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Algorithms for minimizing weighted flow time

STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Online Scheduling to Minimize Average Stretch

FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Asymptotic analysis of an on-line algorithm for the single machine completion time problem with release dates

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

In hard real-time systems, classical scheduling policies only cope with satisfaction of deadline constraints. In this paper, to every periodic task is associated a weight that models the importance of the task in terms of worst-case response time. These parameters are set off-line by the designers of the real-time software in order to control the quality of the on-line schedule. According to these weights, a set of feasible fixed-priorities are computed so that the mean weighted response time of the tasks is minimized. We propose a branch and bound algorithm to solve this problem. An example is completely detailed and numerical results on randomly generated problems are lastly presented to show the efficiency of the developed tool.