Login
Register
Reset Password
Publish & Distribute
Publishing Solutions
Distribution Solutions
Subjects
Publications
Journals
Books
Proceedings
Publishers
Blog
Contact
Search
Cart
EUR
USD
GBP
English
English
Deutsch
Polski
Español
Français
Italiano
Home
Journals
International Journal of Applied Mathematics and Computer Science
Volume 25 (2015): Issue 4 (December 2015)
Open Access
Maintaining the Feasibility of Hard Real–Time Systems with a Reduced Number of Priority Levels
Muhammad Bilal Qureshi
Muhammad Bilal Qureshi
,
Saleh Alrashed
Saleh Alrashed
,
Nasro Min-Allah
Nasro Min-Allah
,
Joanna Kołodziej
Joanna Kołodziej
and
Piotr Arabas
Piotr Arabas
| Dec 30, 2015
International Journal of Applied Mathematics and Computer Science
Volume 25 (2015): Issue 4 (December 2015)
Special issue: Complex Problems in High-Performance Computing Systems, Editors: Mauro Iacono, Joanna Kołodziej
About this article
Previous Article
Next Article
Abstract
References
Authors
Articles in this Issue
Preview
PDF
Cite
Share
Published Online:
Dec 30, 2015
Page range:
709 - 722
Received:
Oct 11, 2014
DOI:
https://doi.org/10.1515/amcs-2015-0051
Keywords
real-time systems
,
feasibility analysis
,
fixed-priority scheduling
,
rate monotonic algorithm
,
online scheduling
© 2015 Muhammad Bilal Qureshi et al., published by De Gruyter Open
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.