ログイン 新規登録
言語:

WEKO3

  • トップ
  • ランキング
To
lat lon distance
To

Field does not validate



インデックスリンク

インデックスツリー

メールアドレスを入力してください。

WEKO

One fine body…

WEKO

One fine body…

アイテム

  1. 論文誌(ジャーナル)
  2. Vol.55
  3. No.2

Adaptive Real-Time Scheduling for Soft Tasks with Varying Execution Times

https://ipsj.ixsq.nii.ac.jp/records/98525
https://ipsj.ixsq.nii.ac.jp/records/98525
bbb81168-9f8d-4c09-8068-2e653cda6756
名前 / ファイル ライセンス アクション
IPSJ-JNL5502049.pdf IPSJ-JNL5502049 (390.2 kB)
Copyright (c) 2014 by the Information Processing Society of Japan
非会員:¥660, IPSJ:学会員:¥330, 論文誌:会員:¥0, DLIB:会員:¥0
Item type Journal(1)
公開日 2014-02-15
タイトル
タイトル Adaptive Real-Time Scheduling for Soft Tasks with Varying Execution Times
タイトル
言語 en
タイトル Adaptive Real-Time Scheduling for Soft Tasks with Varying Execution Times
言語
言語 eng
キーワード
主題Scheme Other
主題 [特集:組込みシステム工学] Real-time scheduling, total bandwidth server (TBS), worst-case execution time (WCET), predictive execution time (PET)
資源タイプ
資源タイプ識別子 http://purl.org/coar/resource_type/c_6501
資源タイプ journal article
著者所属
Japan Advanced Institute of Science and Technology
著者所属(英)
en
Japan Advanced Institute of Science and Technology
著者名 Kiyofumi, Tanaka

× Kiyofumi, Tanaka

Kiyofumi, Tanaka

Search repository
著者名(英) Kiyofumi, Tanaka

× Kiyofumi, Tanaka

en Kiyofumi, Tanaka

Search repository
論文抄録
内容記述タイプ Other
内容記述 As real-time embedded systems get more diverse and more complicated, systems with different types of tasks (e.g., periodic tasks and aperiodic tasks) are prevailing. In such a system, it is important that schedulability of periodic tasks is guaranteed and at the same time response times to aperiodic requests are short enough. Total Bandwidth Server is one of convincing task scheduling algorithms for mixed task sets of periodic and aperiodic tasks. Considering a fact that in most cases tasks' execution times are much shorter than their worst-case execution times, this paper proposes a method of reducing response times of aperiodic execution by using predictive execution times instead of worst-case execution times for deadline calculations in the total bandwidth server to obtain shorter deadlines, while ensuring the integrity of periodic tasks. In the evaluation by simulation, the proposed method combined with a resource reclaiming technique improved average response times for aperiodic tasks, by up to 22% compared with the original total bandwidth server technique, and by up to 48% compared with Constant Bandwidth Server, which is another algorithm appropriate for tasks with varying execution times.

------------------------------
This is a preprint of an article intended for publication Journal of
Information Processing(JIP). This preprint should not be cited. This
article should be cited as: Journal of Information Processing Vol.22(2014) No.2 (online)
DOI http://dx.doi.org/10.2197/ipsjjip.22.152
------------------------------
論文抄録(英)
内容記述タイプ Other
内容記述 As real-time embedded systems get more diverse and more complicated, systems with different types of tasks (e.g., periodic tasks and aperiodic tasks) are prevailing. In such a system, it is important that schedulability of periodic tasks is guaranteed and at the same time response times to aperiodic requests are short enough. Total Bandwidth Server is one of convincing task scheduling algorithms for mixed task sets of periodic and aperiodic tasks. Considering a fact that in most cases tasks' execution times are much shorter than their worst-case execution times, this paper proposes a method of reducing response times of aperiodic execution by using predictive execution times instead of worst-case execution times for deadline calculations in the total bandwidth server to obtain shorter deadlines, while ensuring the integrity of periodic tasks. In the evaluation by simulation, the proposed method combined with a resource reclaiming technique improved average response times for aperiodic tasks, by up to 22% compared with the original total bandwidth server technique, and by up to 48% compared with Constant Bandwidth Server, which is another algorithm appropriate for tasks with varying execution times.

------------------------------
This is a preprint of an article intended for publication Journal of
Information Processing(JIP). This preprint should not be cited. This
article should be cited as: Journal of Information Processing Vol.22(2014) No.2 (online)
DOI http://dx.doi.org/10.2197/ipsjjip.22.152
------------------------------
書誌レコードID
収録物識別子タイプ NCID
収録物識別子 AN00116647
書誌情報 情報処理学会論文誌

巻 55, 号 2, 発行日 2014-02-15
ISSN
収録物識別子タイプ ISSN
収録物識別子 1882-7764
戻る
0
views
See details
Views

Versions

Ver.1 2025-01-20 06:47:03.411415
Show All versions

Share

Mendeley Twitter Facebook Print Addthis

Cite as

エクスポート

OAI-PMH
  • OAI-PMH JPCOAR
  • OAI-PMH DublinCore
  • OAI-PMH DDI
Other Formats
  • JSON
  • BIBTEX

Confirm


Powered by WEKO3


Powered by WEKO3