Semi-partitioned fixed-priority scheduling on multiprocessors

Shinpei Kato, Nobuyuki Yamasaki

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

58 Citations (Scopus)

Abstract

This paper presents a new algorithm for fixed-priority scheduling of sporadic task systems on multiprocessors. The algorithm is categorized to such a scheduling class that qualifies a few tasks to migrate across processors, while most tasks are fixed to particular processors. We design the algorithm so that a task is qualified to migrate, only if it cannot be assigned to any individual processors, in such a way that it is never returned to the same processor within the same period, once it is migrated from one processor to another processor. The scheduling policy is then conformed to DeadlineMonotonic. According to the simulation results, the new algorithm significantly outperforms the traditional fixed-priority algorithms in terms of schedulability.

Original languageEnglish
Title of host publicationProceedings - 15th IEEE Real-Time and Embedded Technology and Application Symposium, RTAS 2009
Pages23-32
Number of pages10
DOIs
Publication statusPublished - 2009
Event15th IEEE Real-Time and Embedded Technology and Application Symposium, RTAS 2009 - San Francisco, CA, United States
Duration: 2009 Apr 142009 Apr 16

Publication series

NameProceedings of the IEEE Real-Time and Embedded Technology and Applications Symposium, RTAS
ISSN (Print)1545-3421

Other

Other15th IEEE Real-Time and Embedded Technology and Application Symposium, RTAS 2009
Country/TerritoryUnited States
CitySan Francisco, CA
Period09/4/1409/4/16

ASJC Scopus subject areas

  • Engineering(all)

Fingerprint

Dive into the research topics of 'Semi-partitioned fixed-priority scheduling on multiprocessors'. Together they form a unique fingerprint.

Cite this