Multiprocessor Online Scheduling of Hard-Real-Time Tasks
IEEE Transactions on Software Engineering
ISCA '96 Proceedings of the 23rd annual international symposium on Computer architecture
MediaBench: a tool for evaluating and synthesizing multimedia and communicatons systems
MICRO 30 Proceedings of the 30th annual ACM/IEEE international symposium on Microarchitecture
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
Symbiotic jobscheduling for a simultaneous mutlithreading processor
ACM SIGPLAN Notices
Symbiotic jobscheduling with priorities for a simultaneous multithreading processor
SIGMETRICS '02 Proceedings of the 2002 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Deadline-based scheduling of periodic task systems on multiprocessors
Information Processing Letters
Soft Real- Time Scheduling on Simultaneous Multithreaded Processors
RTSS '02 Proceedings of the 23rd IEEE Real-Time Systems Symposium
Architectural support for real-time task scheduling in SMT processors
Proceedings of the 2005 international conference on Compilers, architectures and synthesis for embedded systems
Virtual multiprocessor: an analyzable, high-performance architecture for real-time computing
Proceedings of the 2005 international conference on Compilers, architectures and synthesis for embedded systems
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
Predictable Performance in SMT Processors: Synergy between the OS and SMTs
IEEE Transactions on Computers
| Hi-index | 0.00 |
Several software or hardware approaches have been proposed to reduce the execution time variability of SMT processors. Software solutions rely on profiling the schedulable tasks to determine the effects of resource sharing over their performance, while the hardware approaches consider a fixed small number of tasks, avoiding the global system-scheduling problem. Both approaches lack of generality or do not take into account architectural details. This work targets the scheduling of soft real-time tasks on an explicit resource allocation processor, where the system is able to enforce hardware allocation decisions. We propose a simple extension to the Earliest Deadline First scheduler: Resource Aware EDF. RA-EDF uses resource allocation mechanisms to ensure at least the minimum amount of resources needed by a task to meet its deadline. It yields improvements on every case when compared to previous task schedulers: 8% better on average and up to 18%, requiring no additional profiling.