Fixed-priority scheduling on prioritized SMT processor

Authors:
Shinpei Kato;Nobuyuki Yamasaki
Affiliations:
Keio University, Yokohama, Japan;Keio University, Yokohama, Japan
Venue:
PDCS '07 Proceedings of the 19th IASTED International Conference on Parallel and Distributed Computing and Systems
Year:
2007

Citing 12
Cited 1

Exploiting choice: instruction fetch and issue on an implementable simultaneous multithreading processor

ISCA '96 Proceedings of the 23rd annual international symposium on Computer architecture
The case for a single-chip multiprocessor

Proceedings of the seventh international conference on Architectural support for programming languages and operating systems
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

Journal of the ACM (JACM)
Symbiotic jobscheduling for a simultaneous multithreaded processor

ASPLOS IX Proceedings of the ninth international conference on Architectural support for programming languages and operating systems
Simultaneous Multithreading: A Platform for Next-Generation Processors

IEEE Micro
Priority-Driven Scheduling of Periodic Task Systems on Multiprocessors

Real-Time Systems
Area and System Clock Effects on SMT/CMP Throughput

IEEE Transactions on Computers
Real-Time Task Scheduling for SMT Systems

RTCSA '05 Proceedings of the 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications
U-Link Scheduling: Bounding Execution Time of Real-Time Tasks with Multi-Case Execution Time on SMT Processors

RTCSA '05 Proceedings of the 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications
Extended U-Link Scheduling to Increase the Execution Efficiency for SMT Real-Time Systems

RTCSA '06 Proceedings of the 12th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications
Multiprocessor Scheduling with Few Preemptions

RTCSA '06 Proceedings of the 12th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications
Prioritized SMT Architecture with IPC Control Method for Real-Time Processing

RTAS '07 Proceedings of the 13th IEEE Real Time and Embedded Technology and Applications Symposium

Soft real-time scheduling with tardiness bounds on prioritized SMT processors

PDCN '08 Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Networks

Quantified Score

Hi-index	0.00

Visualization

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.