EUVIMEDEUVIMED entdecken
Crossref

Timely CPU Scheduling for Computation-Intensive Status Updates

Mengqiu Zhou, Meng Zhang, Howard H. Yang, Roy D. Yates

IEEE Transactions on Information Theory · 2026-08 · 72 (8) · 6164-6188

DOI: 10.1109/tit.2026.3689716 ↗

Kurz gefasst

Fachartikel in der Zeitschrift IEEE Transactions on Information Theory, 2026-08. Verfasst von Mengqiu Zhou und 3 weiteren Autor:innen. Die Arbeit nennt 77 Literaturangaben. Gefördert von: National Natural Science Foundation of China, National Science Foundation.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

The proliferation of mobile devices and real-time status updating applications has motivated the optimization of data freshness in the context of age of information (AoI). Meanwhile, increasing computational demands have inspired research on CPU scheduling. Since prior CPU scheduling strategies have ignored data freshness and prior age-minimization strategies have considered only constant CPU speed, we formulate the first CPU scheduling problem as a constrained semi-Markov decision process (SMDP) problem with uncountable space, which aims to minimize the long-term average age of information, subject to an average CPU power constraint. We optimize strategies that specify when the CPU sleeps and adapt the CPU speed (clock frequency) during the execution of update-processing tasks. We consider the age-minimal CPU scheduling problem for both predictable task size (PTS) and unpredictable task size (UTS) cases, where the task size is realized at the start (PTS) or at the completion (UTS) of the task, respectively. To address the non-convex objective, we employ Dinkelbach’s fractional programming method to transform our problem into an average cost SMDP. We develop a value-iteration-based algorithm and prove its convergence to obtain optimal policies and structural results for both the PTS and UTS systems.

Förderung

  • National Natural Science Foundation of China
  • National Science Foundation

Zitieren

APA

Zhou, M., Zhang, M., Yang, H. H., & Yates, R. D. (2026). Timely CPU Scheduling for Computation-Intensive Status Updates. IEEE Transactions on Information Theory, 72(8), 6164-6188. https://doi.org/10.1109/tit.2026.3689716

Vancouver

Zhou M, Zhang M, Yang HH, Yates RD. Timely CPU Scheduling for Computation-Intensive Status Updates. IEEE Transactions on Information Theory. 2026;72(8):6164-6188. doi:10.1109/tit.2026.3689716

BibTeX
@article{Zhou2026,
  author = {Zhou, Mengqiu and Zhang, Meng and Yang, Howard H. and Yates, Roy D.},
  title = {Timely CPU Scheduling for Computation-Intensive Status Updates},
  journal = {IEEE Transactions on Information Theory},
  year = {2026},
  volume = {72},
  number = {8},
  pages = {6164--6188},
  doi = {10.1109/tit.2026.3689716}
}
Kostenlos starten →