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

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.