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
T3 - Proceedings of the 10th IASTED International Conference on Parallel and Distributed Computing and Networks, PDCN 2011
SP - 75
EP - 82
BT - Proceedings of the 10th IASTED International Conference on Parallel and Distributed Computing and Networks, PDCN 2011
T2 - 10th IASTED International Conference on Parallel and Distributed Computing and Networks, PDCN 2011
Y2 - 15 February 2011 through 17 February 2011
ER -