Performance evaluation of semi-fixed-priority scheduling on prioritized SMT processors

Hiroyuki Chishiro, Nobuyuki Yamasaki

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

Abstract

Responsive Multithreaded Processor (RMTP) has the Simultaneous Multithreading (SMT) architecture with priority for distributed real-time processings, called prioritized SMT architecture. In RMTP, execution efficiencies of tasks executing in threads except the highest priority thread fluctuate by multiple combinations of tasks executing simultaneously. Therefore, it is difficult to guarantee the schedulability of tasks. Many real-time scheduling algorithms having only real-time part is not well suited to the prioritized SMT architecture. Because they cannot make use of the remaining times of threads except the highest priority thread. In contrast, semi-fixed-priority scheduling has an optional part which is a non-real-time part and improves the quality of the result so that semi-fixed-priority scheduling is well suited to the prioritized SMT architecture. This paper evaluates the performance of semi-fixed-priority scheduling on prioritized SMT processors. Experimental evaluations show that semi-fixed-priority scheduling is well suited to prioritized SMT processors.

Original languageEnglish
Title of host publicationProceedings of the 10th IASTED International Conference on Parallel and Distributed Computing and Networks, PDCN 2011
Pages75-82
Number of pages8
DOIs
Publication statusPublished - 2011
Event10th IASTED International Conference on Parallel and Distributed Computing and Networks, PDCN 2011 - Innsbruck, Austria
Duration: 2011 Feb 152011 Feb 17

Other

Other10th IASTED International Conference on Parallel and Distributed Computing and Networks, PDCN 2011
CountryAustria
CityInnsbruck
Period11/2/1511/2/17

Fingerprint

Scheduling
Scheduling algorithms
Processing

Keywords

  • Operating systems
  • Real-time and embedded systems
  • Scheduling
  • Semi-fixed-priority scheduling

ASJC Scopus subject areas

  • Computer Networks and Communications

Cite this

Chishiro, H., & Yamasaki, N. (2011). Performance evaluation of semi-fixed-priority scheduling on prioritized SMT processors. In Proceedings of the 10th IASTED International Conference on Parallel and Distributed Computing and Networks, PDCN 2011 (pp. 75-82) https://doi.org/10.2316/P.2011.719-026

Performance evaluation of semi-fixed-priority scheduling on prioritized SMT processors. / Chishiro, Hiroyuki; Yamasaki, Nobuyuki.

Proceedings of the 10th IASTED International Conference on Parallel and Distributed Computing and Networks, PDCN 2011. 2011. p. 75-82.

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

Chishiro, H & Yamasaki, N 2011, Performance evaluation of semi-fixed-priority scheduling on prioritized SMT processors. in Proceedings of the 10th IASTED International Conference on Parallel and Distributed Computing and Networks, PDCN 2011. pp. 75-82, 10th IASTED International Conference on Parallel and Distributed Computing and Networks, PDCN 2011, Innsbruck, Austria, 11/2/15. https://doi.org/10.2316/P.2011.719-026
Chishiro H, Yamasaki N. Performance evaluation of semi-fixed-priority scheduling on prioritized SMT processors. In Proceedings of the 10th IASTED International Conference on Parallel and Distributed Computing and Networks, PDCN 2011. 2011. p. 75-82 https://doi.org/10.2316/P.2011.719-026
Chishiro, Hiroyuki ; Yamasaki, Nobuyuki. / Performance evaluation of semi-fixed-priority scheduling on prioritized SMT processors. Proceedings of the 10th IASTED International Conference on Parallel and Distributed Computing and Networks, PDCN 2011. 2011. pp. 75-82
@inproceedings{7215e3259b1847a7b88c4d5f53798876,
title = "Performance evaluation of semi-fixed-priority scheduling on prioritized SMT processors",
abstract = "Responsive Multithreaded Processor (RMTP) has the Simultaneous Multithreading (SMT) architecture with priority for distributed real-time processings, called prioritized SMT architecture. In RMTP, execution efficiencies of tasks executing in threads except the highest priority thread fluctuate by multiple combinations of tasks executing simultaneously. Therefore, it is difficult to guarantee the schedulability of tasks. Many real-time scheduling algorithms having only real-time part is not well suited to the prioritized SMT architecture. Because they cannot make use of the remaining times of threads except the highest priority thread. In contrast, semi-fixed-priority scheduling has an optional part which is a non-real-time part and improves the quality of the result so that semi-fixed-priority scheduling is well suited to the prioritized SMT architecture. This paper evaluates the performance of semi-fixed-priority scheduling on prioritized SMT processors. Experimental evaluations show that semi-fixed-priority scheduling is well suited to prioritized SMT processors.",
keywords = "Operating systems, Real-time and embedded systems, Scheduling, Semi-fixed-priority scheduling",
author = "Hiroyuki Chishiro and Nobuyuki Yamasaki",
year = "2011",
doi = "10.2316/P.2011.719-026",
language = "English",
isbn = "9780889868649",
pages = "75--82",
booktitle = "Proceedings of the 10th IASTED International Conference on Parallel and Distributed Computing and Networks, PDCN 2011",

}

TY - GEN

T1 - Performance evaluation of semi-fixed-priority scheduling on prioritized SMT processors

AU - Chishiro, Hiroyuki

AU - Yamasaki, Nobuyuki

PY - 2011

Y1 - 2011

N2 - Responsive Multithreaded Processor (RMTP) has the Simultaneous Multithreading (SMT) architecture with priority for distributed real-time processings, called prioritized SMT architecture. In RMTP, execution efficiencies of tasks executing in threads except the highest priority thread fluctuate by multiple combinations of tasks executing simultaneously. Therefore, it is difficult to guarantee the schedulability of tasks. Many real-time scheduling algorithms having only real-time part is not well suited to the prioritized SMT architecture. Because they cannot make use of the remaining times of threads except the highest priority thread. In contrast, semi-fixed-priority scheduling has an optional part which is a non-real-time part and improves the quality of the result so that semi-fixed-priority scheduling is well suited to the prioritized SMT architecture. This paper evaluates the performance of semi-fixed-priority scheduling on prioritized SMT processors. Experimental evaluations show that semi-fixed-priority scheduling is well suited to prioritized SMT processors.

AB - Responsive Multithreaded Processor (RMTP) has the Simultaneous Multithreading (SMT) architecture with priority for distributed real-time processings, called prioritized SMT architecture. In RMTP, execution efficiencies of tasks executing in threads except the highest priority thread fluctuate by multiple combinations of tasks executing simultaneously. Therefore, it is difficult to guarantee the schedulability of tasks. Many real-time scheduling algorithms having only real-time part is not well suited to the prioritized SMT architecture. Because they cannot make use of the remaining times of threads except the highest priority thread. In contrast, semi-fixed-priority scheduling has an optional part which is a non-real-time part and improves the quality of the result so that semi-fixed-priority scheduling is well suited to the prioritized SMT architecture. This paper evaluates the performance of semi-fixed-priority scheduling on prioritized SMT processors. Experimental evaluations show that semi-fixed-priority scheduling is well suited to prioritized SMT processors.

KW - Operating systems

KW - Real-time and embedded systems

KW - Scheduling

KW - Semi-fixed-priority scheduling

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

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

U2 - 10.2316/P.2011.719-026

DO - 10.2316/P.2011.719-026

M3 - Conference contribution

AN - SCOPUS:79958123792

SN - 9780889868649

SP - 75

EP - 82

BT - Proceedings of the 10th IASTED International Conference on Parallel and Distributed Computing and Networks, PDCN 2011

ER -