Abstract
Until now, this book presented three programming flows for applications of different natures, namely sequential, parallel and SDR.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
For some algorithms and problem statements, it is possible to find a theoretical bound on the bandwidth that guarantees that an application will meet its real time constraints. Consider, for example, the unity bound (\(U=1\)) for Earliest Deadline First (EDF) or the bound \(U \approx 0.693\) for Rate Monotonic (RM) with infinite tasks [179].
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Castrillón Mazo, J., Leupers, R. (2014). Multi-Application Flow. In: Programming Heterogeneous MPSoCs. Springer, Cham. https://doi.org/10.1007/978-3-319-00675-8_8
Download citation
DOI: https://doi.org/10.1007/978-3-319-00675-8_8
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-00674-1
Online ISBN: 978-3-319-00675-8
eBook Packages: EngineeringEngineering (R0)