1 / 16

Power Management for Solar-Driven Sensor Nodes

Power Management for Solar-Driven Sensor Nodes. Clemens Moser. ( joint work with D. Brunelli, L. Thiele and L. Benini ). System Model Problem Statement Lazy Scheduling Admittance Test Simulation Conclusion. Outline.

ivor-davis
Download Presentation

Power Management for Solar-Driven Sensor Nodes

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Power Management for Solar-Driven Sensor Nodes Clemens Moser ( joint work with D. Brunelli, L. Thiele and L. Benini )

  2. System Model Problem Statement Lazy Scheduling Admittance Test Simulation Conclusion Outline [1] C. Moser, D. Brunelli, L. Thiele, and L. Benini, “Real-time scheduling with regenerative energy.”, In The 18th Euromicro Conference on Real-Time Systems (ECRTS 2006), July 2006. [2] C. Moser, D. Brunelli, L. Thiele, and L. Benini, “Lazy scheduling for energy harvesting sensor nodes.”, In The Fifth IFIP Conferenceon Distributed and Parallel Embedded Systems (DIPES 2006), October 2006.

  3. S energy source PS(t) EC(t) ≤ C energy storage PD(t) D computing device J1 J2 tasks a2, e2, d2 a1, e1, d1 System Model

  4. Task Ji can be preempted arrives at time ai has deadline di needs total energy eito complete can consume power therefore, needs time S energy source PS(t) EC(t) ≤ C energy storage PD(t) D computing device J1 J2 tasks a2, e2, d2 a1, e1, d1 System Model

  5. Determine an optimal on-line scheduling algorithm: If the task set is schedulable, it determines a feasible schedule. Construct an admittance test: Determine, whether a set of event streams with a given characteristic is schedulable. Problem Statement Nothing known so far …

  6. 1 2 Problem Statement - EDF Greedy scheduling is not suited.

  7. 2 1 Problem Statement - ALAP ALAP does not work either. And what happens if the energy storage is full?

  8. Rule 1: Rule 2: Lazy Scheduling Algorithm

  9. Theorem: If the Lazy Scheduling Algorithm LSA cannot schedule a given set of tasks, then no other scheduling algorithm can schedule it. Optimality of Lazy Scheduling Algorithm

  10. Sketch of Proof E C Energy-Constrained t E C Time-Constrained t

  11. Is the scheduling of the event streams feasible with LSA ? Abstraction Event stream: delay requirement energy request per event arrival curve Energy source: energy variability Admittance Test

  12. Pmax Admittance Test Proof: The proof uses concepts of network calculus [Le Boudec, Thiran] and real-time calculus.

  13. LSA with ES LSA with εl LSA with εu EDF Simulation Results Capacity savings of ~40% measured for random task sets for LSA with εl(Δ) compared to EDF

  14. S PS(t) C PD(t) D 2 1 … J1 J2 a1, e1, d1 a2, e2, d2 Conclusions Optimal Lazy Admittance Test Simulation Results Scheduling Scenario Scheduling LSA with εl EDF

  15. Modular Real-Time Analysis The Big Picture

  16. Modular Real-Time Analysis The Big Picture

More Related