Multiprocessor Online Scheduling of Hard-Real-Time Tasks
IEEE Transactions on Software Engineering
Knapsack problems: algorithms and computer implementations
Knapsack problems: algorithms and computer implementations
On-line scheduling in the presence of overload
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Scheduling for Overload in Real-Time Systems
IEEE Transactions on Computers
Online computation and competitive analysis
Online computation and competitive analysis
Competitive On-Line Scheduling of Imprecise Computations
IEEE Transactions on Computers
Real-time dynamic voltage scaling for low-power embedded operating systems
SOSP '01 Proceedings of the eighteenth ACM symposium on Operating systems principles
Computers and Intractability; A Guide to the Theory of NP-Completeness
Computers and Intractability; A Guide to the Theory of NP-Completeness
Removable Online Knapsack Problems
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Speed is as powerful as clairvoyance [scheduling problems]
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
A scheduling model for reduced CPU energy
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Overload Tolerance for Single-Processor Workloads
RTAS '98 Proceedings of the Fourth IEEE Real-Time Technology and Applications Symposium
Maximizing the System Value while Satisfying Time and Energy Constraints
RTSS '02 Proceedings of the 23rd IEEE Real-Time Systems Symposium
Maximizing rewards for real-time applications with energy constraints
ACM Transactions on Embedded Computing Systems (TECS)
Power-Aware Scheduling for Periodic Real-Time Tasks
IEEE Transactions on Computers
On Energy-Constrained Real-Time Scheduling
ECRTS '04 Proceedings of the 16th Euromicro Conference on Real-Time Systems
Hard Real-time Computing Systems: Predictable Scheduling Algorithms And Applications (Real-Time Systems Series)
Dynamic Speed Scaling to Manage Energy and Temperature
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Competitive Algorithms for Fine-Grain Real-Time Scheduling
RTSS '04 Proceedings of the 25th IEEE International Real-Time Systems Symposium
On-Line Dynamic Voltage Scaling for Hard Real-Time Systems Using the EDF Algorithm
RTSS '04 Proceedings of the 25th IEEE International Real-Time Systems Symposium
Voltage Scaling Scheduling for Periodic Real-Time Tasks in Reward Maximization
RTSS '05 Proceedings of the 26th IEEE International Real-Time Systems Symposium
Energy-Constrained Scheduling for Weakly-Hard Real-Time Systems
RTSS '05 Proceedings of the 26th IEEE International Real-Time Systems Symposium
System-Level Energy Management for Periodic Real-Time Tasks
RTSS '06 Proceedings of the 27th IEEE International Real-Time Systems Symposium
Energy efficient online deadline scheduling
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Utility Accrual Real-Time Scheduling Under the Unimodal Arbitrary Arrival Model with Energy Bounds
IEEE Transactions on Computers
Automated analysis of real-time scheduling using graph games
Proceedings of the 16th international conference on Hybrid systems: computation and control
Online algorithms for maximizing weighted throughput of unit jobs with temperature constraints
Journal of Combinatorial Optimization
Hi-index | 0.00 |
In this paper, we undertake the competitive analysis of the online real-time scheduling problems under a given hard energy constraint. Specifically, we derive worst-case performance bounds that apply to any online algorithm, when compared to an optimal algorithm that has the knowledge of the input sequence in advance. First, by focusing on uniform value-density settings, we prove that no online algorithm can achieve a competitive factor greater than $1-\frac{e_{\max}}{E}$ , where e max驴 is the upper bound on the size of any job and E is the available energy budget. Then we propose a variant of EDF algorithm, EC-EDF, that is able to achieve this upper bound. We show that a priori information about the largest job size in the actual input sequence makes possible the design of a semi-online algorithm EC-EDF 驴 which achieves a constant competitive factor of 0.5. This turns out to be the best achievable competitive factor in these settings. In non-uniform value density settings, we derive an upper bound on the competitive factor achievable by any online algorithm, as well as the competitive factors of EC-EDF and EC-EDF 驴 algorithms. We also investigate the implications of having additional constraints on the online scheduling algorithm, including non-idling and non-preemptive execution constraints. Moreover, we analyze the case where the processor can adjust its speed at run-time through Dynamic Voltage Scaling (DVS) capability.