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 19th IASTED International Conference on Parallel and Distributed Computing and Systems
Pages116-123
Number of pages8
Publication statusPublished - 2007 Dec 1
Event19th IASTED International Conference on Parallel and Distributed Computing and Systems - Cambridge, MA, United States
Duration: 2007 Nov 192007 Nov 21

Publication series

NameProceedings of the IASTED International Conference on Parallel and Distributed Computing and Systems
ISSN (Print)1027-2658

Other

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

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

Fingerprint Dive into the research topics of 'Fixed-priority scheduling on prioritized SMT processor'. Together they form a unique fingerprint.

  • Cite this

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