U-Link scheduling: Bounding execution time of real-time tasks with multi-case execution time on SMT processors

Shinpei Kato, Hidenori Kobayashi, Nobuyuki Yamasaki

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Citations (Scopus)

Abstract

The goal of this paper is to achieve hard real-time processing with admitting as many tasks as possible on Simultaneous Multithreaded (SMT) processors. For this goal, we propose U-Link scheduling scheme that determines the co-scheduled set that is the fixed combinations of co-scheduled tasks to bound the task execution time. Also we present practical algorithms, RR-DUP for building co-scheduled sets and UL-EDF for task scheduling. The performance evaluation shows that UL-EDF with RR-DUP outperforms the conventional scheduling algorithms, EDF-FF and EDF-US, in the point of execution time stability, task rejection ratio and deadline miss ratio.

Original languageEnglish
Title of host publicationProceedings - 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications
Pages193-197
Number of pages5
DOIs
Publication statusPublished - 2005
Event11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications - Hong Kong, China
Duration: 2005 Aug 172005 Aug 19

Other

Other11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications
CountryChina
CityHong Kong
Period05/8/1705/8/19

Fingerprint

Scheduling
Scheduling algorithms
Processing

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Kato, S., Kobayashi, H., & Yamasaki, N. (2005). U-Link scheduling: Bounding execution time of real-time tasks with multi-case execution time on SMT processors. In Proceedings - 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (pp. 193-197). [1541080] https://doi.org/10.1109/RTCSA.2005.100

U-Link scheduling : Bounding execution time of real-time tasks with multi-case execution time on SMT processors. / Kato, Shinpei; Kobayashi, Hidenori; Yamasaki, Nobuyuki.

Proceedings - 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications. 2005. p. 193-197 1541080.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Kato, S, Kobayashi, H & Yamasaki, N 2005, U-Link scheduling: Bounding execution time of real-time tasks with multi-case execution time on SMT processors. in Proceedings - 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications., 1541080, pp. 193-197, 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications, Hong Kong, China, 05/8/17. https://doi.org/10.1109/RTCSA.2005.100
Kato S, Kobayashi H, Yamasaki N. U-Link scheduling: Bounding execution time of real-time tasks with multi-case execution time on SMT processors. In Proceedings - 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications. 2005. p. 193-197. 1541080 https://doi.org/10.1109/RTCSA.2005.100
Kato, Shinpei ; Kobayashi, Hidenori ; Yamasaki, Nobuyuki. / U-Link scheduling : Bounding execution time of real-time tasks with multi-case execution time on SMT processors. Proceedings - 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications. 2005. pp. 193-197
@inproceedings{e4e6911ebbcd4ac4a7e479a1805fecf5,
title = "U-Link scheduling: Bounding execution time of real-time tasks with multi-case execution time on SMT processors",
abstract = "The goal of this paper is to achieve hard real-time processing with admitting as many tasks as possible on Simultaneous Multithreaded (SMT) processors. For this goal, we propose U-Link scheduling scheme that determines the co-scheduled set that is the fixed combinations of co-scheduled tasks to bound the task execution time. Also we present practical algorithms, RR-DUP for building co-scheduled sets and UL-EDF for task scheduling. The performance evaluation shows that UL-EDF with RR-DUP outperforms the conventional scheduling algorithms, EDF-FF and EDF-US, in the point of execution time stability, task rejection ratio and deadline miss ratio.",
author = "Shinpei Kato and Hidenori Kobayashi and Nobuyuki Yamasaki",
year = "2005",
doi = "10.1109/RTCSA.2005.100",
language = "English",
isbn = "0769523463",
pages = "193--197",
booktitle = "Proceedings - 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications",

}

TY - GEN

T1 - U-Link scheduling

T2 - Bounding execution time of real-time tasks with multi-case execution time on SMT processors

AU - Kato, Shinpei

AU - Kobayashi, Hidenori

AU - Yamasaki, Nobuyuki

PY - 2005

Y1 - 2005

N2 - The goal of this paper is to achieve hard real-time processing with admitting as many tasks as possible on Simultaneous Multithreaded (SMT) processors. For this goal, we propose U-Link scheduling scheme that determines the co-scheduled set that is the fixed combinations of co-scheduled tasks to bound the task execution time. Also we present practical algorithms, RR-DUP for building co-scheduled sets and UL-EDF for task scheduling. The performance evaluation shows that UL-EDF with RR-DUP outperforms the conventional scheduling algorithms, EDF-FF and EDF-US, in the point of execution time stability, task rejection ratio and deadline miss ratio.

AB - The goal of this paper is to achieve hard real-time processing with admitting as many tasks as possible on Simultaneous Multithreaded (SMT) processors. For this goal, we propose U-Link scheduling scheme that determines the co-scheduled set that is the fixed combinations of co-scheduled tasks to bound the task execution time. Also we present practical algorithms, RR-DUP for building co-scheduled sets and UL-EDF for task scheduling. The performance evaluation shows that UL-EDF with RR-DUP outperforms the conventional scheduling algorithms, EDF-FF and EDF-US, in the point of execution time stability, task rejection ratio and deadline miss ratio.

UR - http://www.scopus.com/inward/record.url?scp=33749065127&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33749065127&partnerID=8YFLogxK

U2 - 10.1109/RTCSA.2005.100

DO - 10.1109/RTCSA.2005.100

M3 - Conference contribution

AN - SCOPUS:33749065127

SN - 0769523463

SN - 9780769523460

SP - 193

EP - 197

BT - Proceedings - 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications

ER -