Timely CPU Scheduling for Computation-intensive Status Updates

Abstract

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. Compared to constant CPU speed, numerical results show that our proposed scheme can reduce the AoI by 50\% or more, with increasing benefits under tighter power constraints. Further, for a given AoI target, the age-minimal CPU scheduling policy can reduce the energy consumption by 50\% or more, with greater AoI reductions when the task size distribution exhibits higher variance.