A new sufficient schedulability analysis for hybrid scheduling

International Journal of Applied Mathematics and Computer Science

Volume 26 (2016): Issue 3 (September 2016)

By:

Fengxiang Zhang, Yanfeng Zhai and Jianwei Liao

Open Access

|Sep 2016

Download Article

Download the full article as a PDF file.

DOI: https://doi.org/10.1515/amcs-2016-0047 | Journal eISSN: 2083-8492 | Journal ISSN: 1641-876X

Journal RSS Feed

Language: English

Page range: 683 - 692

Submitted on: May 26, 2015

Accepted on: Mar 10, 2016

Published on: Sep 29, 2016

Published by: University of Zielona Góra

In partnership with: Paradigm Publishing Services

Publication frequency: 4 issues per year

Keywords:

scheduling algorithms,

real-time systems,

schedulability analysis,

preemptive scheduling,

earliest deadline first,

Related subjects:

Applied mathematics

© 2016 Fengxiang Zhang, Yanfeng Zhai, Jianwei Liao, published by University of Zielona Góra
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.

Previous article Volume 26 (2016): Issue 3 (September 2016)Next article