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 26 (2016): Issue 3 (September 2016)
Open Access
A new sufficient schedulability analysis for hybrid scheduling
Fengxiang Zhang
Fengxiang Zhang
,
Yanfeng Zhai
Yanfeng Zhai
and
Jianwei Liao
Jianwei Liao
| Sep 29, 2016
International Journal of Applied Mathematics and Computer Science
Volume 26 (2016): Issue 3 (September 2016)
About this article
Previous Article
Next Article
Abstract
References
Authors
Articles in this Issue
Preview
PDF
Cite
Share
Published Online:
Sep 29, 2016
Page range:
683 - 692
Received:
May 26, 2015
Accepted:
Mar 10, 2016
DOI:
https://doi.org/10.1515/amcs-2016-0047
Keywords
scheduling algorithms
,
real-time systems
,
schedulability analysis
,
preemptive scheduling
,
earliest deadline first
,
fixed priority
© 2016 Fengxiang Zhang et al., published by De Gruyter Open
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.
Fengxiang Zhang
School of Computer and Information Science, Southwest University, Beibei District, Chongqing, China
Yanfeng Zhai
School of Computer and Information Science, Southwest University, Beibei District, Chongqing, China
Jianwei Liao
School of Computer and Information Science, Southwest University, Beibei District, Chongqing, China