Computing Optimal Schedules of Battery Usage in Embedded Systems
| Autor: | M.R. Jongerden, Joost-Pieter Katoen, Henrik Bohnenkamp, Boudewijn R. Haverkort, Alexandru Mereacre |
|---|---|
| Jazyk: | angličtina |
| Rok vydání: | 2010 |
| Předmět: |
Rate-monotonic scheduling
Schedule Computer science Distributed computing Embedded systems Mobile computing Processor scheduling 02 engineering and technology Dynamic priority scheduling Fair-share scheduling Scheduling (computing) Batteries 0202 electrical engineering electronic engineering information engineering Electrical and Electronic Engineering Job shop scheduling business.industry Scheduling 020206 networking & telecommunications lifetime optimization 020202 computer hardware & architecture Computer Science Applications Control and Systems Engineering Embedded system Two-level scheduling business Mobile device Information Systems |
| Zdroj: | IEEE transactions on industrial informatics, 6(3), 276-286. IEEE Computer Society |
| ISSN: | 1551-3203 |
| Popis: | The use of mobile devices is often limited by the battery lifetime. Some devices have the option to connect an extra battery, or to use smart battery-packs with multiple cells to extend the lifetime. In these cases, scheduling the batteries or battery cells over the load to exploit the recovery properties of the batteries helps to extend the overall systems lifetime. Straightforward scheduling schemes, like round-robin or choosing the best battery available, already provide a big improvement compared to a sequential discharge of the batteries. In this paper, we compare these scheduling schemes with the optimal scheduling scheme produced with two different modeling approaches: an approach based on a priced-timed automaton model (implemented and evaluated in Uppaal Cora), as well as an analytical approach (partly formulated as nonlinear optimization problem) for a slightly adapted scheduling problem. We show that in some cases the results of the simple scheduling schemes (round-robin, and best-first) are close to optimal. However, the optimal schedules, computed according to both methods, also clearly show that in a variety of scenarios, the simple schedules are far from optimal. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|