Fixed-priority scheduling on prioritized SMT processor

Shinpei Kato, Nobuyuki Yamasaki

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

1 Citation (Scopus)

Abstract

Prioritized SMT is a technique that placess a priority to each thread in hardware and the processor resources are preferentially allocated to threads with a high priority. This paper describes real-time task scheduling on Prioritized SMT processors. We propose two algorithms, Direct Priority Mapping (DM) and Shorter Period Upper (SPU), that determine the priorities of the threads. Then the well-known Rate Monotonic (RM) algorithm is combined with the proposed algorithms for scheduling real-time tasks on Prioritized SMT processors. Also we consider a schedula-bility analysis for each algorithm. The simulation study evaluates the deadline miss ratio of the proposed algorithms with ideal-case simulations and register transfer level (RTL) simulations.

Original languageEnglish
Title of host publicationProceedings of the IASTED International Conference on Parallel and Distributed Computing and Systems
Pages116-123
Number of pages8
Publication statusPublished - 2007
Event19th IASTED International Conference on Parallel and Distributed Computing and Systems - Cambridge, MA, United States
Duration: 2007 Nov 192007 Nov 21

Other

Other19th IASTED International Conference on Parallel and Distributed Computing and Systems
CountryUnited States
CityCambridge, MA
Period07/11/1907/11/21

Fingerprint

Surface mount technology
Scheduling
Hardware

Keywords

  • Fixed-priority scheduling
  • Prioritized simultaneous multithreading
  • Real-time Systems
  • Responsive multithreaded processor
  • Schedulability analysis

ASJC Scopus subject areas

  • Software
  • Hardware and Architecture
  • Computer Networks and Communications

Cite this

Kato, S., & Yamasaki, N. (2007). Fixed-priority scheduling on prioritized SMT processor. In Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Systems (pp. 116-123)

Fixed-priority scheduling on prioritized SMT processor. / Kato, Shinpei; Yamasaki, Nobuyuki.

Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Systems. 2007. p. 116-123.

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

Kato, S & Yamasaki, N 2007, Fixed-priority scheduling on prioritized SMT processor. in Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Systems. pp. 116-123, 19th IASTED International Conference on Parallel and Distributed Computing and Systems, Cambridge, MA, United States, 07/11/19.
Kato S, Yamasaki N. Fixed-priority scheduling on prioritized SMT processor. In Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Systems. 2007. p. 116-123
Kato, Shinpei ; Yamasaki, Nobuyuki. / Fixed-priority scheduling on prioritized SMT processor. Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Systems. 2007. pp. 116-123
@inproceedings{21ee9b3f94e742918dc0ae9a9f5e37c9,
title = "Fixed-priority scheduling on prioritized SMT processor",
abstract = "Prioritized SMT is a technique that placess a priority to each thread in hardware and the processor resources are preferentially allocated to threads with a high priority. This paper describes real-time task scheduling on Prioritized SMT processors. We propose two algorithms, Direct Priority Mapping (DM) and Shorter Period Upper (SPU), that determine the priorities of the threads. Then the well-known Rate Monotonic (RM) algorithm is combined with the proposed algorithms for scheduling real-time tasks on Prioritized SMT processors. Also we consider a schedula-bility analysis for each algorithm. The simulation study evaluates the deadline miss ratio of the proposed algorithms with ideal-case simulations and register transfer level (RTL) simulations.",
keywords = "Fixed-priority scheduling, Prioritized simultaneous multithreading, Real-time Systems, Responsive multithreaded processor, Schedulability analysis",
author = "Shinpei Kato and Nobuyuki Yamasaki",
year = "2007",
language = "English",
isbn = "9780889867048",
pages = "116--123",
booktitle = "Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Systems",

}

TY - GEN

T1 - Fixed-priority scheduling on prioritized SMT processor

AU - Kato, Shinpei

AU - Yamasaki, Nobuyuki

PY - 2007

Y1 - 2007

N2 - Prioritized SMT is a technique that placess a priority to each thread in hardware and the processor resources are preferentially allocated to threads with a high priority. This paper describes real-time task scheduling on Prioritized SMT processors. We propose two algorithms, Direct Priority Mapping (DM) and Shorter Period Upper (SPU), that determine the priorities of the threads. Then the well-known Rate Monotonic (RM) algorithm is combined with the proposed algorithms for scheduling real-time tasks on Prioritized SMT processors. Also we consider a schedula-bility analysis for each algorithm. The simulation study evaluates the deadline miss ratio of the proposed algorithms with ideal-case simulations and register transfer level (RTL) simulations.

AB - Prioritized SMT is a technique that placess a priority to each thread in hardware and the processor resources are preferentially allocated to threads with a high priority. This paper describes real-time task scheduling on Prioritized SMT processors. We propose two algorithms, Direct Priority Mapping (DM) and Shorter Period Upper (SPU), that determine the priorities of the threads. Then the well-known Rate Monotonic (RM) algorithm is combined with the proposed algorithms for scheduling real-time tasks on Prioritized SMT processors. Also we consider a schedula-bility analysis for each algorithm. The simulation study evaluates the deadline miss ratio of the proposed algorithms with ideal-case simulations and register transfer level (RTL) simulations.

KW - Fixed-priority scheduling

KW - Prioritized simultaneous multithreading

KW - Real-time Systems

KW - Responsive multithreaded processor

KW - Schedulability analysis

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

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

M3 - Conference contribution

AN - SCOPUS:62449116080

SN - 9780889867048

SP - 116

EP - 123

BT - Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Systems

ER -