The DOI matches its Crossref record; 15 of the 15 references it cites were found in a registry or an index.
Power-aware scheduling for periodic real-time tasks
Abstract
We address power-aware scheduling of periodic tasks to reduce CPU energy consumption in hard real-time systems through dynamic voltage scaling. Our intertask voltage scheduling solution includes three components: 1) a static (offline) solution to compute the optimal speed, assuming worst-case workload for each arrival, 2) an online speed reduction mechanism to reclaim energy by adapting to the actual workload, and 3) 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 our reclaiming algorithm alone outperforms other recently proposed intertask voltage scheduling schemes. Our speculative techniques are shown to provide additional gains, approaching the theoretical lower-bound by a margin of 10 percent.
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
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
Scheduling for Reduced CPU Energy
Weiser, M., Welch, B., Demers, A., & Shenker, S. (2007) · The Kluwer International Series in Engineering and Computer Science · doi:10.1007/978-0-585-29603-6_17 · Cited by 1,181
Real-time dynamic voltage scaling for low-power embedded operating systems
Pillai, P., & Shin, K. G. (2001) · Proceedings of the eighteenth ACM symposium on Operating systems principles · doi:10.1145/502034.502044 · Cited by 1,138
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
ECOSystem: managing energy as a first class operating system resource
Zeng, H., Ellis, C. S., Lebeck, A. R., & Vahdat, A. (2002) · Proceedings of the 10th international conference on Architectural support for programming languages and operating systems · doi:10.1145/605397.605411 · Cited by 375
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
Hard real-time scheduling for low-energy using stochastic data and DVS processors
Gruian, F. (2001) · Proceedings of the 2001 international symposium on Low power electronics and design - ISLPED '01 · doi:10.1145/383082.383092 · Cited by 245
Practical voltage-scaling for fixed-priority rt-systems
Saewong, S., & Rajkumar, R. (2004) · IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS) · doi:10.1109/rttas.2003.1203042 · Cited by 184
Cited by
Buyya, R., Beloglazov, A., & Abawajy, J. (2010) · doi:10.48550/arxiv.1006.0308 · Cited by 440
Scalable Computing: Practice and Experience
(2013) · Scalable Computing Practice and Experience · doi:10.12694/issn.1895-1767 · Cited by 280
A Double Deep Q-Learning Model for Energy-Efficient Edge Scheduling
Zhang, Q., Lin, M., Yang, L. T., Chen, Z., Khan, S. U., & Li, P. (2019) · IEEE Transactions on Services Computing · doi:10.1109/tsc.2018.2867482 · Cited by 158
Metadata
- Authors
- Aydin, H., Melhem, R., Mosse, D., & Mejia-Alvarez, P.
- Venue
- IEEE Transactions on Computers
- Published
- 2004-05
- Volume
- 53
- Issue
- 5
- Pages
- 584-600
- ISSN
- 0018-9340 (ISSN-L)
- OpenAlex
- W2125381034
- Cited by
- 484
- References
- 15
- FWCI
- 45.89
- Type
- journal article
- 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: Power-aware scheduling for periodic real-time tasks. https://app.cochat.ai/papers/10.1109/tc.2004.1275298
- The paper
- Aydin, H., Melhem, R., Mosse, D., & Mejia-Alvarez, P. (2004). Power-aware scheduling for periodic real-time tasks. IEEE Transactions on Computers. https://doi.org/10.1109/tc.2004.1275298
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.