Semi-partitioned scheduling of sporadic task systems on multiprocessors

Shinpei Kato, Nobuyuki Yamasaki, Yutaka Ishikawa

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

74 Citations (Scopus)

Abstract

This paper presents a new algorithm for scheduling of sporadic task systems with arbitrary deadlines on identical multiprocessor platforms. The algorithm is based on the concept of semi-partitioned scheduling, in which most tasks are fixed to specific processors, while a few tasks migrate across processors. Particularly, we design the algorithm so that tasks are qualified to migrate only if a task set cannot be partitioned any more, and such migratory tasks migrate from one processor to another processor only once in each period. The scheduling policy is then subject to Earliest Deadline First. Simulation results show that the algorithm delivers competitive scheduling performance to the state-ofthe- art, with a smaller number of context switches.

Original languageEnglish
Title of host publicationProceedings - Euromicro Conference on Real-Time Systems
Pages249-258
Number of pages10
DOIs
Publication statusPublished - 2009
Event2009 21st Euromicro Conference on Real-Time Systems, ECRTS 09 - Dublin, Ireland
Duration: 2009 Jul 12009 Jul 3

Other

Other2009 21st Euromicro Conference on Real-Time Systems, ECRTS 09
CountryIreland
CityDublin
Period09/7/109/7/3

Fingerprint

Scheduling
Switches

ASJC Scopus subject areas

  • Hardware and Architecture
  • Software

Cite this

Kato, S., Yamasaki, N., & Ishikawa, Y. (2009). Semi-partitioned scheduling of sporadic task systems on multiprocessors. In Proceedings - Euromicro Conference on Real-Time Systems (pp. 249-258). [5161520] https://doi.org/10.1109/ECRTS.2009.22

Semi-partitioned scheduling of sporadic task systems on multiprocessors. / Kato, Shinpei; Yamasaki, Nobuyuki; Ishikawa, Yutaka.

Proceedings - Euromicro Conference on Real-Time Systems. 2009. p. 249-258 5161520.

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

Kato, S, Yamasaki, N & Ishikawa, Y 2009, Semi-partitioned scheduling of sporadic task systems on multiprocessors. in Proceedings - Euromicro Conference on Real-Time Systems., 5161520, pp. 249-258, 2009 21st Euromicro Conference on Real-Time Systems, ECRTS 09, Dublin, Ireland, 09/7/1. https://doi.org/10.1109/ECRTS.2009.22
Kato S, Yamasaki N, Ishikawa Y. Semi-partitioned scheduling of sporadic task systems on multiprocessors. In Proceedings - Euromicro Conference on Real-Time Systems. 2009. p. 249-258. 5161520 https://doi.org/10.1109/ECRTS.2009.22
Kato, Shinpei ; Yamasaki, Nobuyuki ; Ishikawa, Yutaka. / Semi-partitioned scheduling of sporadic task systems on multiprocessors. Proceedings - Euromicro Conference on Real-Time Systems. 2009. pp. 249-258
@inproceedings{a6f37c9d8461486a997d536f70e79f35,
title = "Semi-partitioned scheduling of sporadic task systems on multiprocessors",
abstract = "This paper presents a new algorithm for scheduling of sporadic task systems with arbitrary deadlines on identical multiprocessor platforms. The algorithm is based on the concept of semi-partitioned scheduling, in which most tasks are fixed to specific processors, while a few tasks migrate across processors. Particularly, we design the algorithm so that tasks are qualified to migrate only if a task set cannot be partitioned any more, and such migratory tasks migrate from one processor to another processor only once in each period. The scheduling policy is then subject to Earliest Deadline First. Simulation results show that the algorithm delivers competitive scheduling performance to the state-ofthe- art, with a smaller number of context switches.",
author = "Shinpei Kato and Nobuyuki Yamasaki and Yutaka Ishikawa",
year = "2009",
doi = "10.1109/ECRTS.2009.22",
language = "English",
isbn = "9780769537245",
pages = "249--258",
booktitle = "Proceedings - Euromicro Conference on Real-Time Systems",

}

TY - GEN

T1 - Semi-partitioned scheduling of sporadic task systems on multiprocessors

AU - Kato, Shinpei

AU - Yamasaki, Nobuyuki

AU - Ishikawa, Yutaka

PY - 2009

Y1 - 2009

N2 - This paper presents a new algorithm for scheduling of sporadic task systems with arbitrary deadlines on identical multiprocessor platforms. The algorithm is based on the concept of semi-partitioned scheduling, in which most tasks are fixed to specific processors, while a few tasks migrate across processors. Particularly, we design the algorithm so that tasks are qualified to migrate only if a task set cannot be partitioned any more, and such migratory tasks migrate from one processor to another processor only once in each period. The scheduling policy is then subject to Earliest Deadline First. Simulation results show that the algorithm delivers competitive scheduling performance to the state-ofthe- art, with a smaller number of context switches.

AB - This paper presents a new algorithm for scheduling of sporadic task systems with arbitrary deadlines on identical multiprocessor platforms. The algorithm is based on the concept of semi-partitioned scheduling, in which most tasks are fixed to specific processors, while a few tasks migrate across processors. Particularly, we design the algorithm so that tasks are qualified to migrate only if a task set cannot be partitioned any more, and such migratory tasks migrate from one processor to another processor only once in each period. The scheduling policy is then subject to Earliest Deadline First. Simulation results show that the algorithm delivers competitive scheduling performance to the state-ofthe- art, with a smaller number of context switches.

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

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

U2 - 10.1109/ECRTS.2009.22

DO - 10.1109/ECRTS.2009.22

M3 - Conference contribution

AN - SCOPUS:70449572703

SN - 9780769537245

SP - 249

EP - 258

BT - Proceedings - Euromicro Conference on Real-Time Systems

ER -