Bringing real-time scheduling theory and practice closer for multimedia computing
Proceedings of the 1996 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Analysis of Cache-Related Preemption Delay in Fixed-Priority Preemptive Scheduling
IEEE Transactions on Computers
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
Power analysis of embedded operating systems
Proceedings of the 37th Annual Design Automation Conference
Cache-Conscious Limited Preemptive Scheduling
Real-Time Systems
Compiler-directed dynamic voltage/frequency scheduling for energy reduction in microprocessors
ISLPED '01 Proceedings of the 2001 international symposium on Low power electronics and design
An overview of the Rialto real-time architecture
EW 7 Proceedings of the 7th workshop on ACM SIGOPS European workshop: Systems support for worldwide applications
A Modified Least-Laxity-First Scheduling Algorithm for Real-Time Tasks
RTCSA '98 Proceedings of the 5th International Conference on Real-Time Computing Systems and Applications
Embedded Operating System Energy Analysis and Macro-Modeling
ICCD '02 Proceedings of the 2002 IEEE International Conference on Computer Design: VLSI in Computers and Processors (ICCD'02)
The Performance and Energy Consumption of Embedded Real-Time Operating Systems
IEEE Transactions on Computers
Rate monotonic vs. EDF: judgment day
Real-Time Systems
Minimizing expected energy in real-time embedded systems
Proceedings of the 5th ACM international conference on Embedded software
Scalable real-time system design using preemption thresholds
RTSS'10 Proceedings of the 21st IEEE conference on Real-time systems symposium
Variants of priority scheduling algorithms for reducing context-switches in real-time systems
ICDCN'06 Proceedings of the 8th international conference on Distributed Computing and Networking
| Hi-index | 0.00 |
Real time scheduling algorithms like RM and EDF have been analyzed extensively in the literature. Many recent works on scheduling address energy consumption as a performance metric. In this work we analyze priority scheduling algorithms RM, EDF, and LLF along with a few power-aware scheduling algorithms: MLLF, RM_RCS and EDF_RCS. Our analysis addresses the following metrics: response time, response time jitter, latency, time complexity, preemptions, and energy consumption. We extend past work in this direction by characterizing the performance of the scheduling algorithms -- theoretically as well as experimentally. Results of our analysis can be used to control design choices for real time systems.