Some Results of the Earliest Deadline Scheduling Algorithm
IEEE Transactions on Software Engineering
On-Line Scheduling of Imprecise Computations to Minimize Error
SIAM Journal on Computing
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
Dynamic Power Management in Wireless Sensor Networks
IEEE Design & Test
System-Level Design Techniques for Energy-Efficient Embedded Systems
System-Level Design Techniques for Energy-Efficient Embedded Systems
Estimating the Worst-Case Energy Consumption of Embedded Software
RTAS '06 Proceedings of the 12th IEEE Real-Time and Embedded Technology and Applications Symposium
Harvesting aware power management for sensor networks
Proceedings of the 43rd annual Design Automation Conference
Design considerations for solar energy harvesting wireless embedded systems
IPSN '05 Proceedings of the 4th international symposium on Information processing in sensor networks
Adaptive duty cycling for energy harvesting systems
Proceedings of the 2006 international symposium on Low power electronics and design
Power management in energy harvesting sensor networks
ACM Transactions on Embedded Computing Systems (TECS) - Special Section LCTES'05
Real-time scheduling for energy harvesting sensor nodes
Real-Time Systems
Energy aware dynamic voltage and frequency selection for real-time systems with energy harvesting
Proceedings of the conference on Design, automation and test in Europe
Reward Maximization for Embedded Systems with Renewable Energies
RTCSA '08 Proceedings of the 2008 14th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications
Computers and Electrical Engineering
| Hi-index | 0.00 |
Real-time scheduling refers to the problem in which there is a deadline associated with the execution of a task. In this paper, we address the scheduling problem for a uniprocessor platform that is powered by a renewable energy storage unit and uses a recharging system such as photovoltaic cells. First, we describe our model where two constraints need to be studied: energy and deadlines. Since executing tasks require a certain amount of energy, classical task scheduling like earliest deadline is no longer convenient. We present an on-line scheduling scheme, called earliest deadline with energy guarantee (EDeg), that jointly accounts for characteristics of the energy source, capacity of the energy storage as well as energy consumption of the tasks, and time. In order to demonstrate the benefits of our algorithm, we evaluate it by means of simulation. We show that EDeg outperforms energy non-clairvoyant algorithms in terms of both deadline miss rate and size of the energy storage unit.