LAUSR

We consider a real-time system where a single processor with variable speed executes an infinite sequence of sporadic and independent jobs. We assume that job sizes and relative deadlines are bounded by C and $$\varDelta $$ Δ respectively. Furthermore, $$S_{\max }$$ S max denotes the maximal speed of the processor. In such a real-time system, a speed selection policy dynamically chooses ( i.e. , on-line) the speed of the processor to execute the current, not yet finished, jobs. We say that an on-line speed policy is feasible if it is able to execute any sequence of jobs while meeting two constraints: the processor speed is always below $$S_{\max }$$ S max and no job misses its deadline. In this paper, we compare the feasibility region of four on-line speed selection policies in single-processor real-time systems, namely Optimal Available $${\text{(OA)}}$$ (OA) (Yao et al. in IEEE annual foundations of computer science, 1995), Average Rate $${\text{(AVR)}}$$ (AVR) (Yao et al. 1995), $${\text{(BKP)}}$$ (BKP) (Bansal in J ACM 54:1, 2007), and a Markovian Policy based on dynamic programming $${\text{(MP)}}$$ (MP) (Gaujal in Technical Report hal-01615835, Inria, 2017). We prove the following results: $$ {\text{(OA)}}$$ (OA) is feasible if and only if $$S_{\max } \ge C (h_{\varDelta -1}+1)$$ S max ≥ C ( h Δ - 1 + 1 ) , where $$h_n$$ h n is the n -th harmonic number ( $$h_n = \sum _{i=1}^n 1/i \approx \log n$$ h n = ∑ i = 1 n 1 / i ≈ log n ). $${\text{(AVR)}}$$ (AVR) is feasible if and only if $$S_{\max } \ge C h_\varDelta $$ S max ≥ C h Δ . $${\text{(BKP)}}$$ (BKP) is feasible if and only if $$S_{\max } \ge e C$$ S max ≥ e C (where $$e = \exp (1)$$ e = exp ( 1 ) ). $${\text{(MP)}}$$ (MP) is feasible if and only if $$S_{\max } \ge C$$ S max ≥ C . This is an optimal feasibility condition because when $$S_{\max } < C$$ S max < C no policy can be feasible. This reinforces the interest of $${\text{(MP)}}$$ (MP) that is not only optimal for energy consumption (on average) but is also optimal regarding feasibility.