Abstract
In fixed-task-priority (FTP) scheduling algorithms, each task is assigned a distinct priority and all the jobs generated by a task inherit the priority of the task. FTP algorithms are therefore a special case of fixed-job-priority (FJP) scheduling algorithms: all FTP algorithms are also FJP algorithms, while not all FJP algorithms are FTP algorithms.
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
Author information
Authors and Affiliations
Corresponding author
Sources
Sources
The derivation of the speedup bound for RM, and algorithm RM-US\((\xi)\) as well as the derivation of its utilization bound, may be found in [4, 6]. As stated above, the improved utilization bound in Theorem 9.5 is from [59]. Some important ideas and insights into global multiprocessor scheduling are to be found in [7–10].
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Baruah, S., Bertogna, M., Buttazzo, G. (2015). Global Fixed-Task-Priority (FTP) Scheduling of L&L Tasks. In: Multiprocessor Scheduling for Real-Time Systems. Embedded Systems. Springer, Cham. https://doi.org/10.1007/978-3-319-08696-5_9
Download citation
DOI: https://doi.org/10.1007/978-3-319-08696-5_9
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-08695-8
Online ISBN: 978-3-319-08696-5
eBook Packages: EngineeringEngineering (R0)