Abstract
The previous two chapters addressed the problem of analysing the deadline miss ratios of applications with stochastic task execution times. In this chapter we address the complementary problem: given a multiprocessor hardware architecture and a functionality as a set of task graphs, find a task mapping and priority assignment such that the deadline miss ratios are below imposed upper bounds.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2007 Springer
About this chapter
Cite this chapter
Manolache, S., Eles, P., Peng, Z. (2007). Deadline Miss Ratio Minimisation. In: Real-Time Applications with Stochastic Task Execution Times. Springer, Dordrecht. https://doi.org/10.1007/1-4020-5509-9_6
Download citation
DOI: https://doi.org/10.1007/1-4020-5509-9_6
Publisher Name: Springer, Dordrecht
Print ISBN: 978-1-4020-5505-8
Online ISBN: 978-1-4020-5509-6
eBook Packages: EngineeringEngineering (R0)