Deterministic Task Scheduling for Embedded Real-Time Operating Systems

Sun-Jin OH; Jeong-Nyeo KIM; Yeong-Rak SEONG; Cheol-Hoon LEE

Deterministic Task Scheduling for Embedded Real-Time Operating Systems

Sun-Jin OH, Jeong-Nyeo KIM, Yeong-Rak SEONG, Cheol-Hoon LEE

Full Text Views

0

Cite this

Summary :

In recent years, there has been a rapid and widespread proliferation of non-traditional embedded computing platforms such as digital camcorders, cellular phones, and portable medical devices. As applications become increasingly sophisticated and processing power increases, the application designer has to rely on the services provided by the real-time operating systems (RTOSs). These RTOSs must not only provide predictable services but must also be efficient and small in size. Kernel services should also be deterministic by specifying how long each service call will take to execute. Having this information allows the application designers to better plan their real-time application software so as not to miss the deadline of each task. In this paper, we propose a generalized deterministic scheduling algorithm that makes the task scheduling time constant irrespective of the number of tasks created in an application. The proposed algorithm eliminates the restriction on the maximum number of task priorities imposed on the existing ones, without additional memory overhead.

Publication: IEICE TRANSACTIONS on Information Vol.E87-D No.2 pp.472-474

Publication Date: 2004/02/01

Publicized

Online ISSN

DOI

Type of Manuscript: LETTER

Category: Software Systems

Cite this

Copy

Sun-Jin OH, Jeong-Nyeo KIM, Yeong-Rak SEONG, Cheol-Hoon LEE, "Deterministic Task Scheduling for Embedded Real-Time Operating Systems" in IEICE TRANSACTIONS on Information, vol. E87-D, no. 2, pp. 472-474, February 2004, doi: .
Abstract: In recent years, there has been a rapid and widespread proliferation of non-traditional embedded computing platforms such as digital camcorders, cellular phones, and portable medical devices. As applications become increasingly sophisticated and processing power increases, the application designer has to rely on the services provided by the real-time operating systems (RTOSs). These RTOSs must not only provide predictable services but must also be efficient and small in size. Kernel services should also be deterministic by specifying how long each service call will take to execute. Having this information allows the application designers to better plan their real-time application software so as not to miss the deadline of each task. In this paper, we propose a generalized deterministic scheduling algorithm that makes the task scheduling time constant irrespective of the number of tasks created in an application. The proposed algorithm eliminates the restriction on the maximum number of task priorities imposed on the existing ones, without additional memory overhead.
URL: https://global.ieice.org/en_transactions/information/10.1587/e87-d_2_472/_p

Copy

@ARTICLE{e87-d_2_472,
author={Sun-Jin OH, Jeong-Nyeo KIM, Yeong-Rak SEONG, Cheol-Hoon LEE, },
journal={IEICE TRANSACTIONS on Information},
title={Deterministic Task Scheduling for Embedded Real-Time Operating Systems},
year={2004},
volume={E87-D},
number={2},
pages={472-474},
abstract={In recent years, there has been a rapid and widespread proliferation of non-traditional embedded computing platforms such as digital camcorders, cellular phones, and portable medical devices. As applications become increasingly sophisticated and processing power increases, the application designer has to rely on the services provided by the real-time operating systems (RTOSs). These RTOSs must not only provide predictable services but must also be efficient and small in size. Kernel services should also be deterministic by specifying how long each service call will take to execute. Having this information allows the application designers to better plan their real-time application software so as not to miss the deadline of each task. In this paper, we propose a generalized deterministic scheduling algorithm that makes the task scheduling time constant irrespective of the number of tasks created in an application. The proposed algorithm eliminates the restriction on the maximum number of task priorities imposed on the existing ones, without additional memory overhead.},
keywords={},
doi={},
ISSN={},
month={February},}

Copy

TY - JOUR
TI - Deterministic Task Scheduling for Embedded Real-Time Operating Systems
T2 - IEICE TRANSACTIONS on Information
SP - 472
EP - 474
AU - Sun-Jin OH
AU - Jeong-Nyeo KIM
AU - Yeong-Rak SEONG
AU - Cheol-Hoon LEE
PY - 2004
DO -
JO - IEICE TRANSACTIONS on Information
SN -
VL - E87-D
IS - 2
JA - IEICE TRANSACTIONS on Information
Y1 - February 2004
AB - In recent years, there has been a rapid and widespread proliferation of non-traditional embedded computing platforms such as digital camcorders, cellular phones, and portable medical devices. As applications become increasingly sophisticated and processing power increases, the application designer has to rely on the services provided by the real-time operating systems (RTOSs). These RTOSs must not only provide predictable services but must also be efficient and small in size. Kernel services should also be deterministic by specifying how long each service call will take to execute. Having this information allows the application designers to better plan their real-time application software so as not to miss the deadline of each task. In this paper, we propose a generalized deterministic scheduling algorithm that makes the task scheduling time constant irrespective of the number of tasks created in an application. The proposed algorithm eliminates the restriction on the maximum number of task priorities imposed on the existing ones, without additional memory overhead.
ER -