Knapsack problems: algorithms and computer implementations
Knapsack problems: algorithms and computer implementations
Algorithms for Scheduling Imprecise Computations
Computer - Special issue on real-time systems
Algorithms for scheduling imprecise computations with timing constraints
SIAM Journal on Computing
Image transfer: an end-to-end design
SIGCOMM '92 Conference proceedings on Communications architectures & protocols
SIGMETRICS '93 Proceedings of the 1993 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Aided and Automatic Target Recognition Based Upon Sensory Inputs From Image Forming Systems
IEEE Transactions on Pattern Analysis and Machine Intelligence
Embedded program timing analysis based on path clustering and architecture classification
ICCAD '97 Proceedings of the 1997 IEEE/ACM international conference on Computer-aided design
Power optimization of variable voltage core-based systems
DAC '98 Proceedings of the 35th annual Design Automation Conference
On-line scheduling of hard real-time tasks on variable voltage processor
Proceedings of the 1998 IEEE/ACM international conference on Computer-aided design
Power conscious fixed priority scheduling for hard real-time systems
Proceedings of the 36th annual ACM/IEEE Design Automation Conference
Improving dynamic voltage scaling algorithms with PACE
Proceedings of the 2001 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Hard real-time scheduling for low-energy using stochastic data and DVS processors
ISLPED '01 Proceedings of the 2001 international symposium on Low power electronics and design
Real-Time Systems
Intra-Task Voltage Scheduling for Low-Energy, Hard Real-Time Applications
IEEE Design & Test
IEEE Transactions on Computers
An Architectural Overview of Alpha: A Real-Time, Distributed Kernel
Proceedings of the Workshop on Micro-kernels and Other Kernel Architectures
A power-aware, satellite-based parallel signal processing scheme
Power aware computing
A scheduling model for reduced CPU energy
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Voltage-Clock-Scaling Adaptive Scheduling Techniques for Low Power in Hard Real-Time Systems
RTAS '00 Proceedings of the Sixth IEEE Real Time Technology and Applications Symposium (RTAS 2000)
A resource allocation model for QoS management
RTSS '97 Proceedings of the 18th IEEE Real-Time Systems Symposium
Practical Solutions for QoS-Based Resource Allocation
RTSS '98 Proceedings of the IEEE Real-Time Systems Symposium
Synthesis Techniques for Low-Power Hard Real-Time Systems on Variable Voltage Processors
RTSS '98 Proceedings of the IEEE Real-Time Systems Symposium
Optimal Reward-Based Scheduling of Periodic Real-Time Tasks
RTSS '99 Proceedings of the 20th IEEE Real-Time Systems Symposium
Maximizing the System Value while Satisfying Time and Energy Constraints
RTSS '02 Proceedings of the 23rd IEEE Real-Time Systems Symposium
A Fast Resource Synthesis Technique for Energy-Efficient Real-Time Systems
RTSS '02 Proceedings of the 23rd IEEE Real-Time Systems Symposium
ECRTS '01 Proceedings of the 13th Euromicro Conference on Real-Time Systems
Dynamic and Aggressive Scheduling Techniques for Power-Aware Real-Time Systems
RTSS '01 Proceedings of the 22nd IEEE Real-Time Systems Symposium
On bounding energy consumption in dynamic, embedded real-time systems
Proceedings of the 2006 ACM symposium on Applied computing
Utility Accrual Real-Time Scheduling Under the Unimodal Arbitrary Arrival Model with Energy Bounds
IEEE Transactions on Computers
Optimizing quality of service in real-time systems under energy constraints
ACM SIGOPS Operating Systems Review
Network-wide energy optimization for adaptive embedded systems
ACM SIGBED Review
| Hi-index | 0.01 |
Embedded devices designed for various real-time applications typically have three constraints that must be addressed: energy, deadlines, and reward. These constraints play important roles in the next generation of embedded systems, since they provide users with a variety of quality-of-service (QoS) tradeoffs. We propose a QoS model in which applications may have several versions, each with different time and energy requirements, while providing different levels of accuracy (reward). An optimal scheme would allow the device to run the most critical and valuable versions of applications without depleting the energy source, while still meeting all deadlines. A solution is presented for frame-based and periodic task sets. Three algorithms are devised that closely approximate the optimal solution while taking only a fraction of the runtime of an optimal solution.