Abstract
In this chapter1 we discuss the problem of scheduling soft aperiodic tasks and hard periodic tasks under dynamic priority assignments. In particular, different service methods are introduced, whose objective is to reduce the average response time of aperiodic requests without compromising the schedulability of hard periodic tasks. Periodic tasks are scheduled by the Earliest Deadline First (EDF) algorithm.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 1997 Kluwer Academic Publishers
About this chapter
Cite this chapter
(1997). Dynamic priority servers. In: Hard real-time computing systems. The Springer International Series in Engineering and Computer Science, vol 416. Springer, Boston, MA. https://doi.org/10.1007/978-0-585-28005-9_6
Download citation
DOI: https://doi.org/10.1007/978-0-585-28005-9_6
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-7923-9994-0
Online ISBN: 978-0-585-28005-9
eBook Packages: Springer Book Archive