The DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
Dynamic and aggressive scheduling techniques for power-aware real-time systems
Abstract
In this paper we address power-aware scheduling of periodic hard real-time tasks using dynamic voltage scaling. Our solution includes three parts: (a) a static (off-line) solution to compute the optimal speed, assuming worst-case workload for each arrival, (b) an on-line speed reduction mechanism to reclaim energy by adapting to the actual workload, and (c) an online, adaptive and speculative speed adjustment mechanism to anticipate early completions of future executions by using the average-case workload information. All these solutions still guarantee that all deadlines are met. Our simulation results show that the reclaiming algorithm saves a striking 50% of the energy, over the static algorithm. Further our speculative techniques allow for an additional approximately 20% savings over the reclaiming algorithm. In this study, we also establish that solving an instance of the static power-aware scheduling problem is equivalent to solving an instance of the reward-based scheduling problem [1, 4] with concave reward functions.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Scheduling algorithms for multiprogramming in a hard-real-time environment
Liu, C. L., & Layland, J. W. (1973) · Journal of the ACM · doi:10.1145/321738.321743 · Cited by 8,433
Linear and nonlinear programming.
(1986) · Mathematics and Computers in Simulation · doi:10.1016/0378-4754(86)90092-3 · Cited by 4,805
A scheduling model for reduced CPU energy
Yao, F., Demers, A. J., & Shenker, S. J. (2002) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1995.492493 · Cited by 1,457
Algorithms for scheduling imprecise computations
Liu, J. W. S., Lin, K.-Y., Shih, W.-K., Yu, A., Chung, J.-Y., & Zhao, W. (1991) · Computer · doi:10.1109/2.76287 · Cited by 524
A resource allocation model for QoS management
Rajkumar, R., Lee, C., Lehoczky, J. P., & Siewiorek, D. P. (2002) · IEEE Real-Time Systems Symposium (RTSS) · doi:10.1109/real.1997.641291 · Cited by 486
Improving dynamic voltage scaling algorithms with PACE
Lorch, J. R., & Smith, A. J. (2001) · Proceedings of the 2001 ACM SIGMETRICS international conference on Measurement and modeling of computer systems · doi:10.1145/378420.378429 · Cited by 386
Power conscious fixed priority scheduling for hard real-time systems
Shin, Y., & Choi, K. (1999) · ACM/IEEE Design Automation Conference (DAC) · doi:10.1145/309847.309901 · Cited by 350
Dynamic voltage scaling on a low-power microprocessor
Pouwelse, J., Langendoen, K., & Sips, H. (2001) · Proceedings of the 7th annual international conference on Mobile computing and networking · doi:10.1145/381677.381701 · Cited by 343
Optimal reward-based scheduling for periodic real-time tasks
Aydın, H., Melhem, R., Mossé, D., & Mejía-Álvarez, P. (2001) · IEEE Transactions on Computers · doi:10.1109/12.908988 · Cited by 144
Self-citationDey, J. K., Kurose, J., & Towsley, D. (1996) · IEEE Transactions on Computers · doi:10.1109/12.508319 · Cited by 87
Cited by
A survey on techniques for improving the energy efficiency of large-scale distributed systems
Orgerie, A.-C., Assuncao, M. D. D., & Lefevre, L. (2014) · ACM Computing Surveys · doi:10.1145/2532637 · Cited by 340
Software Architecture Optimization Methods: A Systematic Literature Review
Aleti, A., Buhnova, B., Grunske, L., Koziolek, A., & Meedeniya, I. (2013) · IEEE Transactions on Software Engineering · doi:10.1109/tse.2012.64 · Cited by 293
Metadata
- Authors
- Aydin, H., Melhem, R., Mosse, D., & Mejia-Alvarez, P.
- Venue
- Proceedings 22nd IEEE Real-Time Systems Symposium (RTSS 2001) (Cat. No.01PR1420)
- Publisher
- IEEE Comput. Soc
- Published
- 2005-08-24
- Pages
- 95-105
- ISSN
- 1052-8725 (ISSN-L)
- OpenAlex
- W2005456951
- Cited by
- 481
- References
- 10
- FWCI
- 38.33
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Dynamic and aggressive scheduling techniques for power-aware real-time systems. https://app.cochat.ai/papers/10.1109/real.2001.990600
- The paper
- Aydin, H., Melhem, R., Mosse, D., & Mejia-Alvarez, P. (2005). Dynamic and aggressive scheduling techniques for power-aware real-time systems. Proceedings 22nd IEEE Real-Time Systems Symposium (RTSS 2001) (Cat. No.01PR1420). https://doi.org/10.1109/real.2001.990600
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.
