Simultaneous multithreading: maximizing on-chip parallelism
ISCA '95 Proceedings of the 22nd 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
An EDF-based Scheduling Algorithm for Multiprocessor Soft Real-Time Systems
ECRTS '05 Proceedings of the 17th Euromicro Conference on Real-Time Systems
An Upper Bound to the Lateness of Soft Real-Time Tasks Scheduled by EDF on Multiprocessors
RTSS '05 Proceedings of the 26th IEEE International Real-Time Systems Symposium
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
Fixed-priority scheduling on prioritized SMT processor
PDCS '07 Proceedings of the 19th IASTED International Conference on Parallel and Distributed Computing and Systems
| Hi-index | 0.00 |
Prioritized SMT is a technique that places a priority to each thread by hardware and preferentially allocates processor resources to the higher priority threads. This technique meets the requirements of soft real-time systems, since it has a capability of supporting real-time processing with maintaining the system throughput. This paper proposes a real-time scheduling algorithm for soft real-time systems on prioritized SMT processors. The upper bound of the tardiness of tasks is also analyzed in order to meet QoS requirements of the systems. We discuss the tightness of the tardiness bound in the evaluation with the tick-level simulation.