Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Thorsten Zitterell

dblp:35/8119 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 2010
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Energy-efficient computing · 50% Embedded and real-time systems · 25% Electronic design automation · 25%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Energy-efficient computing › energy-aware scheduling
energy-aware real-time scheduling
0.112010
A probabilistic and energy-efficient scheduling approach for online application in real-time systems · DAC 2010
Energy-efficient computing
power management
0.112010
A probabilistic and energy-efficient scheduling approach for online application in real-time systems · DAC 2010
Embedded and real-time systems
real-time scheduling
0.112010
A probabilistic and energy-efficient scheduling approach for online application in real-time systems · DAC 2010
Electronic design automation › high-level synthesis › scheduling
stochastic scheduling
0.112010
A probabilistic and energy-efficient scheduling approach for online application in real-time systems · DAC 2010

Methods — techniques the papers use, named apart from their topics

statistical execution profiles · 0.1heuristic scheduling · 0.1
YearPublicationVenuePosition
2010 A probabilistic and energy-efficient scheduling approach for online application in real-time systems
abstract
This work considers the problem of minimizing the power consumption for real-time scheduling on processors with discrete operating modes. We provide a model for determining the expected energy demand based on statistical execution profiles which considers both the current and subsequent tasks. If the load after the execution of the current task is expected to be high and slack time is conserved for subsequent tasks, we are able to derive an optimal solution to the energy minimization problem. For the remaining cases we propose a heuristic approach that also achieves a low run time overhead. In contrast to previous work, our scheduling approach is not restricted to single task scenarios, frame-based real-time systems, or pre-computed schedules. Simulations and comparisons with energy-efficient schedulers from literature demonstrate the efficiency of our approach.
Thorsten Zitterell, Christoph Scholl 0001
DAC1