Feasibility of on-line speed policies in real-time systems
Abstract 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 }%$ denotes the maximal speed...
Ausführliche Beschreibung
Gespeichert in:
| Autor*in: |
Gaujal, Bruno [verfasserIn] Girault, Alain [verfasserIn] Plassart, Stéphan [verfasserIn] |
|---|
| Format: |
E-Artikel |
|---|---|
| Sprache: |
Englisch |
| Erschienen: |
2020 |
|---|
| Schlagwörter: |
|---|
| Übergeordnetes Werk: |
Enthalten in: Real-time systems - Dordrecht [u.a.] : Springer Science + Business Media B.V, 1989, 56(2020), 3 vom: 27. Apr., Seite 254-292 |
|---|---|
| Übergeordnetes Werk: |
volume:56 ; year:2020 ; number:3 ; day:27 ; month:04 ; pages:254-292 |
| Links: |
|---|
| DOI / URN: |
10.1007/s11241-020-09347-y |
|---|
| Katalog-ID: |
SPR040369897 |
|---|
| LEADER | 01000caa a22002652 4500 | ||
|---|---|---|---|
| 001 | SPR040369897 | ||
| 003 | DE-627 | ||
| 005 | 20220111055615.0 | ||
| 007 | cr uuu---uuuuu | ||
| 008 | 201007s2020 xx |||||o 00| ||eng c | ||
| 024 | 7 | |a 10.1007/s11241-020-09347-y |2 doi | |
| 035 | |a (DE-627)SPR040369897 | ||
| 035 | |a (SPR)s11241-020-09347-y-e | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 082 | 0 | 4 | |a 004 |q ASE |
| 084 | |a 54.27 |2 bkl | ||
| 100 | 1 | |a Gaujal, Bruno |e verfasserin |4 aut | |
| 245 | 1 | 0 | |a Feasibility of on-line speed policies in real-time systems |
| 264 | 1 | |c 2020 | |
| 336 | |a Text |b txt |2 rdacontent | ||
| 337 | |a Computermedien |b c |2 rdamedia | ||
| 338 | |a Online-Ressource |b cr |2 rdacarrier | ||
| 520 | |a Abstract 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 }%$ 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 }%$ 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)}}%$ (Yao et al. in IEEE annual foundations of computer science, 1995), Average Rate %${\text{(AVR)}}%$ (Yao et al. 1995), %${\text{(BKP)}}%$ (Bansal in J ACM 54:1, 2007), and a Markovian Policy based on dynamic programming %${\text{(MP)}}%$ (Gaujal in Technical Report hal-01615835, Inria, 2017). We prove the following results:(OA)%$ {\text{(OA)}}%$ is feasible if and only if Smax≥C(hΔ-1+1)%$S_{\max } \ge C (h_{\varDelta -1}+1)%$, where hn%$h_n%$ is the n-th harmonic number (hn=∑i=1n1/i≈logn%$h_n = \sum _{i=1}^n 1/i \approx \log n%$).(AVR)%${\text{(AVR)}}%$ is feasible if and only if Smax≥ChΔ%$S_{\max } \ge C h_\varDelta %$.(BKP)%${\text{(BKP)}}%$ is feasible if and only if Smax≥eC%$S_{\max } \ge e C%$ (where e=exp(1)%$e = \exp (1)%$).(MP)%${\text{(MP)}}%$ is feasible if and only if Smax≥C%$S_{\max } \ge C%$. This is an optimal feasibility condition because when Smax<C%$S_{\max } < C%$ no policy can be feasible. This reinforces the interest of %${\text{(MP)}}%$ that is not only optimal for energy consumption (on average) but is also optimal regarding feasibility. | ||
| 650 | 4 | |a Hard real-time systems |7 (dpeaa)DE-He213 | |
| 650 | 4 | |a Feasibility |7 (dpeaa)DE-He213 | |
| 650 | 4 | |a On-line speed policy |7 (dpeaa)DE-He213 | |
| 650 | 4 | |a Markov decision process |7 (dpeaa)DE-He213 | |
| 650 | 4 | |a Dynamic voltage |7 (dpeaa)DE-He213 | |
| 650 | 4 | |a Frequency scaling |7 (dpeaa)DE-He213 | |
| 700 | 1 | |a Girault, Alain |e verfasserin |4 aut | |
| 700 | 1 | |a Plassart, Stéphan |e verfasserin |4 aut | |
| 773 | 0 | 8 | |i Enthalten in |t Real-time systems |d Dordrecht [u.a.] : Springer Science + Business Media B.V, 1989 |g 56(2020), 3 vom: 27. Apr., Seite 254-292 |w (DE-627)271351209 |w (DE-600)1480026-3 |x 1573-1383 |7 nnns |
| 773 | 1 | 8 | |g volume:56 |g year:2020 |g number:3 |g day:27 |g month:04 |g pages:254-292 |
| 856 | 4 | 0 | |u https://dx.doi.org/10.1007/s11241-020-09347-y |z lizenzpflichtig |3 Volltext |
| 912 | |a GBV_USEFLAG_A | ||
| 912 | |a SYSFLAG_A | ||
| 912 | |a GBV_SPRINGER | ||
| 912 | |a GBV_ILN_11 | ||
| 912 | |a GBV_ILN_20 | ||
| 912 | |a GBV_ILN_22 | ||
| 912 | |a GBV_ILN_23 | ||
| 912 | |a GBV_ILN_24 | ||
| 912 | |a GBV_ILN_31 | ||
| 912 | |a GBV_ILN_32 | ||
| 912 | |a GBV_ILN_39 | ||
| 912 | |a GBV_ILN_40 | ||
| 912 | |a GBV_ILN_60 | ||
| 912 | |a GBV_ILN_62 | ||
| 912 | |a GBV_ILN_63 | ||
| 912 | |a GBV_ILN_69 | ||
| 912 | |a GBV_ILN_70 | ||
| 912 | |a GBV_ILN_73 | ||
| 912 | |a GBV_ILN_74 | ||
| 912 | |a GBV_ILN_90 | ||
| 912 | |a GBV_ILN_95 | ||
| 912 | |a GBV_ILN_100 | ||
| 912 | |a GBV_ILN_101 | ||
| 912 | |a GBV_ILN_105 | ||
| 912 | |a GBV_ILN_110 | ||
| 912 | |a GBV_ILN_120 | ||
| 912 | |a GBV_ILN_138 | ||
| 912 | |a GBV_ILN_150 | ||
| 912 | |a GBV_ILN_151 | ||
| 912 | |a GBV_ILN_152 | ||
| 912 | |a GBV_ILN_161 | ||
| 912 | |a GBV_ILN_170 | ||
| 912 | |a GBV_ILN_171 | ||
| 912 | |a GBV_ILN_187 | ||
| 912 | |a GBV_ILN_213 | ||
| 912 | |a GBV_ILN_224 | ||
| 912 | |a GBV_ILN_230 | ||
| 912 | |a GBV_ILN_250 | ||
| 912 | |a GBV_ILN_281 | ||
| 912 | |a GBV_ILN_285 | ||
| 912 | |a GBV_ILN_293 | ||
| 912 | |a GBV_ILN_370 | ||
| 912 | |a GBV_ILN_602 | ||
| 912 | |a GBV_ILN_636 | ||
| 912 | |a GBV_ILN_702 | ||
| 912 | |a GBV_ILN_2001 | ||
| 912 | |a GBV_ILN_2003 | ||
| 912 | |a GBV_ILN_2004 | ||
| 912 | |a GBV_ILN_2005 | ||
| 912 | |a GBV_ILN_2006 | ||
| 912 | |a GBV_ILN_2007 | ||
| 912 | |a GBV_ILN_2008 | ||
| 912 | |a GBV_ILN_2009 | ||
| 912 | |a GBV_ILN_2010 | ||
| 912 | |a GBV_ILN_2011 | ||
| 912 | |a GBV_ILN_2014 | ||
| 912 | |a GBV_ILN_2015 | ||
| 912 | |a GBV_ILN_2020 | ||
| 912 | |a GBV_ILN_2021 | ||
| 912 | |a GBV_ILN_2025 | ||
| 912 | |a GBV_ILN_2026 | ||
| 912 | |a GBV_ILN_2027 | ||
| 912 | |a GBV_ILN_2031 | ||
| 912 | |a GBV_ILN_2034 | ||
| 912 | |a GBV_ILN_2037 | ||
| 912 | |a GBV_ILN_2038 | ||
| 912 | |a GBV_ILN_2039 | ||
| 912 | |a GBV_ILN_2044 | ||
| 912 | |a GBV_ILN_2048 | ||
| 912 | |a GBV_ILN_2049 | ||
| 912 | |a GBV_ILN_2050 | ||
| 912 | |a GBV_ILN_2055 | ||
| 912 | |a GBV_ILN_2056 | ||
| 912 | |a GBV_ILN_2057 | ||
| 912 | |a GBV_ILN_2059 | ||
| 912 | |a GBV_ILN_2061 | ||
| 912 | |a GBV_ILN_2064 | ||
| 912 | |a GBV_ILN_2065 | ||
| 912 | |a GBV_ILN_2068 | ||
| 912 | |a GBV_ILN_2088 | ||
| 912 | |a GBV_ILN_2093 | ||
| 912 | |a GBV_ILN_2106 | ||
| 912 | |a GBV_ILN_2107 | ||
| 912 | |a GBV_ILN_2108 | ||
| 912 | |a GBV_ILN_2110 | ||
| 912 | |a GBV_ILN_2111 | ||
| 912 | |a GBV_ILN_2112 | ||
| 912 | |a GBV_ILN_2113 | ||
| 912 | |a GBV_ILN_2118 | ||
| 912 | |a GBV_ILN_2122 | ||
| 912 | |a GBV_ILN_2129 | ||
| 912 | |a GBV_ILN_2143 | ||
| 912 | |a GBV_ILN_2144 | ||
| 912 | |a GBV_ILN_2147 | ||
| 912 | |a GBV_ILN_2148 | ||
| 912 | |a GBV_ILN_2152 | ||
| 912 | |a GBV_ILN_2153 | ||
| 912 | |a GBV_ILN_2188 | ||
| 912 | |a GBV_ILN_2190 | ||
| 912 | |a GBV_ILN_2232 | ||
| 912 | |a GBV_ILN_2336 | ||
| 912 | |a GBV_ILN_2446 | ||
| 912 | |a GBV_ILN_2470 | ||
| 912 | |a GBV_ILN_2472 | ||
| 912 | |a GBV_ILN_2507 | ||
| 912 | |a GBV_ILN_2522 | ||
| 912 | |a GBV_ILN_2548 | ||
| 912 | |a GBV_ILN_4035 | ||
| 912 | |a GBV_ILN_4037 | ||
| 912 | |a GBV_ILN_4046 | ||
| 912 | |a GBV_ILN_4112 | ||
| 912 | |a GBV_ILN_4125 | ||
| 912 | |a GBV_ILN_4126 | ||
| 912 | |a GBV_ILN_4242 | ||
| 912 | |a GBV_ILN_4246 | ||
| 912 | |a GBV_ILN_4249 | ||
| 912 | |a GBV_ILN_4251 | ||
| 912 | |a GBV_ILN_4305 | ||
| 912 | |a GBV_ILN_4306 | ||
| 912 | |a GBV_ILN_4307 | ||
| 912 | |a GBV_ILN_4313 | ||
| 912 | |a GBV_ILN_4322 | ||
| 912 | |a GBV_ILN_4323 | ||
| 912 | |a GBV_ILN_4324 | ||
| 912 | |a GBV_ILN_4325 | ||
| 912 | |a GBV_ILN_4326 | ||
| 912 | |a GBV_ILN_4328 | ||
| 912 | |a GBV_ILN_4333 | ||
| 912 | |a GBV_ILN_4334 | ||
| 912 | |a GBV_ILN_4335 | ||
| 912 | |a GBV_ILN_4336 | ||
| 912 | |a GBV_ILN_4338 | ||
| 912 | |a GBV_ILN_4393 | ||
| 912 | |a GBV_ILN_4700 | ||
| 936 | b | k | |a 54.27 |q ASE |
| 951 | |a AR | ||
| 952 | |d 56 |j 2020 |e 3 |b 27 |c 04 |h 254-292 | ||
| author_variant |
b g bg a g ag s p sp |
|---|---|
| matchkey_str |
article:15731383:2020----::esbltoolnsedoiisne |
| hierarchy_sort_str |
2020 |
| bklnumber |
54.27 |
| publishDate |
2020 |
| allfields |
10.1007/s11241-020-09347-y doi (DE-627)SPR040369897 (SPR)s11241-020-09347-y-e DE-627 ger DE-627 rakwb eng 004 ASE 54.27 bkl Gaujal, Bruno verfasserin aut Feasibility of on-line speed policies in real-time systems 2020 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Abstract 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 }%$ 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 }%$ 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)}}%$ (Yao et al. in IEEE annual foundations of computer science, 1995), Average Rate %${\text{(AVR)}}%$ (Yao et al. 1995), %${\text{(BKP)}}%$ (Bansal in J ACM 54:1, 2007), and a Markovian Policy based on dynamic programming %${\text{(MP)}}%$ (Gaujal in Technical Report hal-01615835, Inria, 2017). We prove the following results:(OA)%$ {\text{(OA)}}%$ is feasible if and only if Smax≥C(hΔ-1+1)%$S_{\max } \ge C (h_{\varDelta -1}+1)%$, where hn%$h_n%$ is the n-th harmonic number (hn=∑i=1n1/i≈logn%$h_n = \sum _{i=1}^n 1/i \approx \log n%$).(AVR)%${\text{(AVR)}}%$ is feasible if and only if Smax≥ChΔ%$S_{\max } \ge C h_\varDelta %$.(BKP)%${\text{(BKP)}}%$ is feasible if and only if Smax≥eC%$S_{\max } \ge e C%$ (where e=exp(1)%$e = \exp (1)%$).(MP)%${\text{(MP)}}%$ is feasible if and only if Smax≥C%$S_{\max } \ge C%$. This is an optimal feasibility condition because when Smax<C%$S_{\max } < C%$ no policy can be feasible. This reinforces the interest of %${\text{(MP)}}%$ that is not only optimal for energy consumption (on average) but is also optimal regarding feasibility. Hard real-time systems (dpeaa)DE-He213 Feasibility (dpeaa)DE-He213 On-line speed policy (dpeaa)DE-He213 Markov decision process (dpeaa)DE-He213 Dynamic voltage (dpeaa)DE-He213 Frequency scaling (dpeaa)DE-He213 Girault, Alain verfasserin aut Plassart, Stéphan verfasserin aut Enthalten in Real-time systems Dordrecht [u.a.] : Springer Science + Business Media B.V, 1989 56(2020), 3 vom: 27. Apr., Seite 254-292 (DE-627)271351209 (DE-600)1480026-3 1573-1383 nnns volume:56 year:2020 number:3 day:27 month:04 pages:254-292 https://dx.doi.org/10.1007/s11241-020-09347-y lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_SPRINGER GBV_ILN_11 GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_32 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_74 GBV_ILN_90 GBV_ILN_95 GBV_ILN_100 GBV_ILN_101 GBV_ILN_105 GBV_ILN_110 GBV_ILN_120 GBV_ILN_138 GBV_ILN_150 GBV_ILN_151 GBV_ILN_152 GBV_ILN_161 GBV_ILN_170 GBV_ILN_171 GBV_ILN_187 GBV_ILN_213 GBV_ILN_224 GBV_ILN_230 GBV_ILN_250 GBV_ILN_281 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_636 GBV_ILN_702 GBV_ILN_2001 GBV_ILN_2003 GBV_ILN_2004 GBV_ILN_2005 GBV_ILN_2006 GBV_ILN_2007 GBV_ILN_2008 GBV_ILN_2009 GBV_ILN_2010 GBV_ILN_2011 GBV_ILN_2014 GBV_ILN_2015 GBV_ILN_2020 GBV_ILN_2021 GBV_ILN_2025 GBV_ILN_2026 GBV_ILN_2027 GBV_ILN_2031 GBV_ILN_2034 GBV_ILN_2037 GBV_ILN_2038 GBV_ILN_2039 GBV_ILN_2044 GBV_ILN_2048 GBV_ILN_2049 GBV_ILN_2050 GBV_ILN_2055 GBV_ILN_2056 GBV_ILN_2057 GBV_ILN_2059 GBV_ILN_2061 GBV_ILN_2064 GBV_ILN_2065 GBV_ILN_2068 GBV_ILN_2088 GBV_ILN_2093 GBV_ILN_2106 GBV_ILN_2107 GBV_ILN_2108 GBV_ILN_2110 GBV_ILN_2111 GBV_ILN_2112 GBV_ILN_2113 GBV_ILN_2118 GBV_ILN_2122 GBV_ILN_2129 GBV_ILN_2143 GBV_ILN_2144 GBV_ILN_2147 GBV_ILN_2148 GBV_ILN_2152 GBV_ILN_2153 GBV_ILN_2188 GBV_ILN_2190 GBV_ILN_2232 GBV_ILN_2336 GBV_ILN_2446 GBV_ILN_2470 GBV_ILN_2472 GBV_ILN_2507 GBV_ILN_2522 GBV_ILN_2548 GBV_ILN_4035 GBV_ILN_4037 GBV_ILN_4046 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4242 GBV_ILN_4246 GBV_ILN_4249 GBV_ILN_4251 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4328 GBV_ILN_4333 GBV_ILN_4334 GBV_ILN_4335 GBV_ILN_4336 GBV_ILN_4338 GBV_ILN_4393 GBV_ILN_4700 54.27 ASE AR 56 2020 3 27 04 254-292 |
| spelling |
10.1007/s11241-020-09347-y doi (DE-627)SPR040369897 (SPR)s11241-020-09347-y-e DE-627 ger DE-627 rakwb eng 004 ASE 54.27 bkl Gaujal, Bruno verfasserin aut Feasibility of on-line speed policies in real-time systems 2020 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Abstract 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 }%$ 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 }%$ 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)}}%$ (Yao et al. in IEEE annual foundations of computer science, 1995), Average Rate %${\text{(AVR)}}%$ (Yao et al. 1995), %${\text{(BKP)}}%$ (Bansal in J ACM 54:1, 2007), and a Markovian Policy based on dynamic programming %${\text{(MP)}}%$ (Gaujal in Technical Report hal-01615835, Inria, 2017). We prove the following results:(OA)%$ {\text{(OA)}}%$ is feasible if and only if Smax≥C(hΔ-1+1)%$S_{\max } \ge C (h_{\varDelta -1}+1)%$, where hn%$h_n%$ is the n-th harmonic number (hn=∑i=1n1/i≈logn%$h_n = \sum _{i=1}^n 1/i \approx \log n%$).(AVR)%${\text{(AVR)}}%$ is feasible if and only if Smax≥ChΔ%$S_{\max } \ge C h_\varDelta %$.(BKP)%${\text{(BKP)}}%$ is feasible if and only if Smax≥eC%$S_{\max } \ge e C%$ (where e=exp(1)%$e = \exp (1)%$).(MP)%${\text{(MP)}}%$ is feasible if and only if Smax≥C%$S_{\max } \ge C%$. This is an optimal feasibility condition because when Smax<C%$S_{\max } < C%$ no policy can be feasible. This reinforces the interest of %${\text{(MP)}}%$ that is not only optimal for energy consumption (on average) but is also optimal regarding feasibility. Hard real-time systems (dpeaa)DE-He213 Feasibility (dpeaa)DE-He213 On-line speed policy (dpeaa)DE-He213 Markov decision process (dpeaa)DE-He213 Dynamic voltage (dpeaa)DE-He213 Frequency scaling (dpeaa)DE-He213 Girault, Alain verfasserin aut Plassart, Stéphan verfasserin aut Enthalten in Real-time systems Dordrecht [u.a.] : Springer Science + Business Media B.V, 1989 56(2020), 3 vom: 27. Apr., Seite 254-292 (DE-627)271351209 (DE-600)1480026-3 1573-1383 nnns volume:56 year:2020 number:3 day:27 month:04 pages:254-292 https://dx.doi.org/10.1007/s11241-020-09347-y lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_SPRINGER GBV_ILN_11 GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_32 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_74 GBV_ILN_90 GBV_ILN_95 GBV_ILN_100 GBV_ILN_101 GBV_ILN_105 GBV_ILN_110 GBV_ILN_120 GBV_ILN_138 GBV_ILN_150 GBV_ILN_151 GBV_ILN_152 GBV_ILN_161 GBV_ILN_170 GBV_ILN_171 GBV_ILN_187 GBV_ILN_213 GBV_ILN_224 GBV_ILN_230 GBV_ILN_250 GBV_ILN_281 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_636 GBV_ILN_702 GBV_ILN_2001 GBV_ILN_2003 GBV_ILN_2004 GBV_ILN_2005 GBV_ILN_2006 GBV_ILN_2007 GBV_ILN_2008 GBV_ILN_2009 GBV_ILN_2010 GBV_ILN_2011 GBV_ILN_2014 GBV_ILN_2015 GBV_ILN_2020 GBV_ILN_2021 GBV_ILN_2025 GBV_ILN_2026 GBV_ILN_2027 GBV_ILN_2031 GBV_ILN_2034 GBV_ILN_2037 GBV_ILN_2038 GBV_ILN_2039 GBV_ILN_2044 GBV_ILN_2048 GBV_ILN_2049 GBV_ILN_2050 GBV_ILN_2055 GBV_ILN_2056 GBV_ILN_2057 GBV_ILN_2059 GBV_ILN_2061 GBV_ILN_2064 GBV_ILN_2065 GBV_ILN_2068 GBV_ILN_2088 GBV_ILN_2093 GBV_ILN_2106 GBV_ILN_2107 GBV_ILN_2108 GBV_ILN_2110 GBV_ILN_2111 GBV_ILN_2112 GBV_ILN_2113 GBV_ILN_2118 GBV_ILN_2122 GBV_ILN_2129 GBV_ILN_2143 GBV_ILN_2144 GBV_ILN_2147 GBV_ILN_2148 GBV_ILN_2152 GBV_ILN_2153 GBV_ILN_2188 GBV_ILN_2190 GBV_ILN_2232 GBV_ILN_2336 GBV_ILN_2446 GBV_ILN_2470 GBV_ILN_2472 GBV_ILN_2507 GBV_ILN_2522 GBV_ILN_2548 GBV_ILN_4035 GBV_ILN_4037 GBV_ILN_4046 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4242 GBV_ILN_4246 GBV_ILN_4249 GBV_ILN_4251 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4328 GBV_ILN_4333 GBV_ILN_4334 GBV_ILN_4335 GBV_ILN_4336 GBV_ILN_4338 GBV_ILN_4393 GBV_ILN_4700 54.27 ASE AR 56 2020 3 27 04 254-292 |
| allfields_unstemmed |
10.1007/s11241-020-09347-y doi (DE-627)SPR040369897 (SPR)s11241-020-09347-y-e DE-627 ger DE-627 rakwb eng 004 ASE 54.27 bkl Gaujal, Bruno verfasserin aut Feasibility of on-line speed policies in real-time systems 2020 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Abstract 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 }%$ 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 }%$ 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)}}%$ (Yao et al. in IEEE annual foundations of computer science, 1995), Average Rate %${\text{(AVR)}}%$ (Yao et al. 1995), %${\text{(BKP)}}%$ (Bansal in J ACM 54:1, 2007), and a Markovian Policy based on dynamic programming %${\text{(MP)}}%$ (Gaujal in Technical Report hal-01615835, Inria, 2017). We prove the following results:(OA)%$ {\text{(OA)}}%$ is feasible if and only if Smax≥C(hΔ-1+1)%$S_{\max } \ge C (h_{\varDelta -1}+1)%$, where hn%$h_n%$ is the n-th harmonic number (hn=∑i=1n1/i≈logn%$h_n = \sum _{i=1}^n 1/i \approx \log n%$).(AVR)%${\text{(AVR)}}%$ is feasible if and only if Smax≥ChΔ%$S_{\max } \ge C h_\varDelta %$.(BKP)%${\text{(BKP)}}%$ is feasible if and only if Smax≥eC%$S_{\max } \ge e C%$ (where e=exp(1)%$e = \exp (1)%$).(MP)%${\text{(MP)}}%$ is feasible if and only if Smax≥C%$S_{\max } \ge C%$. This is an optimal feasibility condition because when Smax<C%$S_{\max } < C%$ no policy can be feasible. This reinforces the interest of %${\text{(MP)}}%$ that is not only optimal for energy consumption (on average) but is also optimal regarding feasibility. Hard real-time systems (dpeaa)DE-He213 Feasibility (dpeaa)DE-He213 On-line speed policy (dpeaa)DE-He213 Markov decision process (dpeaa)DE-He213 Dynamic voltage (dpeaa)DE-He213 Frequency scaling (dpeaa)DE-He213 Girault, Alain verfasserin aut Plassart, Stéphan verfasserin aut Enthalten in Real-time systems Dordrecht [u.a.] : Springer Science + Business Media B.V, 1989 56(2020), 3 vom: 27. Apr., Seite 254-292 (DE-627)271351209 (DE-600)1480026-3 1573-1383 nnns volume:56 year:2020 number:3 day:27 month:04 pages:254-292 https://dx.doi.org/10.1007/s11241-020-09347-y lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_SPRINGER GBV_ILN_11 GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_32 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_74 GBV_ILN_90 GBV_ILN_95 GBV_ILN_100 GBV_ILN_101 GBV_ILN_105 GBV_ILN_110 GBV_ILN_120 GBV_ILN_138 GBV_ILN_150 GBV_ILN_151 GBV_ILN_152 GBV_ILN_161 GBV_ILN_170 GBV_ILN_171 GBV_ILN_187 GBV_ILN_213 GBV_ILN_224 GBV_ILN_230 GBV_ILN_250 GBV_ILN_281 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_636 GBV_ILN_702 GBV_ILN_2001 GBV_ILN_2003 GBV_ILN_2004 GBV_ILN_2005 GBV_ILN_2006 GBV_ILN_2007 GBV_ILN_2008 GBV_ILN_2009 GBV_ILN_2010 GBV_ILN_2011 GBV_ILN_2014 GBV_ILN_2015 GBV_ILN_2020 GBV_ILN_2021 GBV_ILN_2025 GBV_ILN_2026 GBV_ILN_2027 GBV_ILN_2031 GBV_ILN_2034 GBV_ILN_2037 GBV_ILN_2038 GBV_ILN_2039 GBV_ILN_2044 GBV_ILN_2048 GBV_ILN_2049 GBV_ILN_2050 GBV_ILN_2055 GBV_ILN_2056 GBV_ILN_2057 GBV_ILN_2059 GBV_ILN_2061 GBV_ILN_2064 GBV_ILN_2065 GBV_ILN_2068 GBV_ILN_2088 GBV_ILN_2093 GBV_ILN_2106 GBV_ILN_2107 GBV_ILN_2108 GBV_ILN_2110 GBV_ILN_2111 GBV_ILN_2112 GBV_ILN_2113 GBV_ILN_2118 GBV_ILN_2122 GBV_ILN_2129 GBV_ILN_2143 GBV_ILN_2144 GBV_ILN_2147 GBV_ILN_2148 GBV_ILN_2152 GBV_ILN_2153 GBV_ILN_2188 GBV_ILN_2190 GBV_ILN_2232 GBV_ILN_2336 GBV_ILN_2446 GBV_ILN_2470 GBV_ILN_2472 GBV_ILN_2507 GBV_ILN_2522 GBV_ILN_2548 GBV_ILN_4035 GBV_ILN_4037 GBV_ILN_4046 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4242 GBV_ILN_4246 GBV_ILN_4249 GBV_ILN_4251 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4328 GBV_ILN_4333 GBV_ILN_4334 GBV_ILN_4335 GBV_ILN_4336 GBV_ILN_4338 GBV_ILN_4393 GBV_ILN_4700 54.27 ASE AR 56 2020 3 27 04 254-292 |
| allfieldsGer |
10.1007/s11241-020-09347-y doi (DE-627)SPR040369897 (SPR)s11241-020-09347-y-e DE-627 ger DE-627 rakwb eng 004 ASE 54.27 bkl Gaujal, Bruno verfasserin aut Feasibility of on-line speed policies in real-time systems 2020 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Abstract 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 }%$ 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 }%$ 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)}}%$ (Yao et al. in IEEE annual foundations of computer science, 1995), Average Rate %${\text{(AVR)}}%$ (Yao et al. 1995), %${\text{(BKP)}}%$ (Bansal in J ACM 54:1, 2007), and a Markovian Policy based on dynamic programming %${\text{(MP)}}%$ (Gaujal in Technical Report hal-01615835, Inria, 2017). We prove the following results:(OA)%$ {\text{(OA)}}%$ is feasible if and only if Smax≥C(hΔ-1+1)%$S_{\max } \ge C (h_{\varDelta -1}+1)%$, where hn%$h_n%$ is the n-th harmonic number (hn=∑i=1n1/i≈logn%$h_n = \sum _{i=1}^n 1/i \approx \log n%$).(AVR)%${\text{(AVR)}}%$ is feasible if and only if Smax≥ChΔ%$S_{\max } \ge C h_\varDelta %$.(BKP)%${\text{(BKP)}}%$ is feasible if and only if Smax≥eC%$S_{\max } \ge e C%$ (where e=exp(1)%$e = \exp (1)%$).(MP)%${\text{(MP)}}%$ is feasible if and only if Smax≥C%$S_{\max } \ge C%$. This is an optimal feasibility condition because when Smax<C%$S_{\max } < C%$ no policy can be feasible. This reinforces the interest of %${\text{(MP)}}%$ that is not only optimal for energy consumption (on average) but is also optimal regarding feasibility. Hard real-time systems (dpeaa)DE-He213 Feasibility (dpeaa)DE-He213 On-line speed policy (dpeaa)DE-He213 Markov decision process (dpeaa)DE-He213 Dynamic voltage (dpeaa)DE-He213 Frequency scaling (dpeaa)DE-He213 Girault, Alain verfasserin aut Plassart, Stéphan verfasserin aut Enthalten in Real-time systems Dordrecht [u.a.] : Springer Science + Business Media B.V, 1989 56(2020), 3 vom: 27. Apr., Seite 254-292 (DE-627)271351209 (DE-600)1480026-3 1573-1383 nnns volume:56 year:2020 number:3 day:27 month:04 pages:254-292 https://dx.doi.org/10.1007/s11241-020-09347-y lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_SPRINGER GBV_ILN_11 GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_32 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_74 GBV_ILN_90 GBV_ILN_95 GBV_ILN_100 GBV_ILN_101 GBV_ILN_105 GBV_ILN_110 GBV_ILN_120 GBV_ILN_138 GBV_ILN_150 GBV_ILN_151 GBV_ILN_152 GBV_ILN_161 GBV_ILN_170 GBV_ILN_171 GBV_ILN_187 GBV_ILN_213 GBV_ILN_224 GBV_ILN_230 GBV_ILN_250 GBV_ILN_281 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_636 GBV_ILN_702 GBV_ILN_2001 GBV_ILN_2003 GBV_ILN_2004 GBV_ILN_2005 GBV_ILN_2006 GBV_ILN_2007 GBV_ILN_2008 GBV_ILN_2009 GBV_ILN_2010 GBV_ILN_2011 GBV_ILN_2014 GBV_ILN_2015 GBV_ILN_2020 GBV_ILN_2021 GBV_ILN_2025 GBV_ILN_2026 GBV_ILN_2027 GBV_ILN_2031 GBV_ILN_2034 GBV_ILN_2037 GBV_ILN_2038 GBV_ILN_2039 GBV_ILN_2044 GBV_ILN_2048 GBV_ILN_2049 GBV_ILN_2050 GBV_ILN_2055 GBV_ILN_2056 GBV_ILN_2057 GBV_ILN_2059 GBV_ILN_2061 GBV_ILN_2064 GBV_ILN_2065 GBV_ILN_2068 GBV_ILN_2088 GBV_ILN_2093 GBV_ILN_2106 GBV_ILN_2107 GBV_ILN_2108 GBV_ILN_2110 GBV_ILN_2111 GBV_ILN_2112 GBV_ILN_2113 GBV_ILN_2118 GBV_ILN_2122 GBV_ILN_2129 GBV_ILN_2143 GBV_ILN_2144 GBV_ILN_2147 GBV_ILN_2148 GBV_ILN_2152 GBV_ILN_2153 GBV_ILN_2188 GBV_ILN_2190 GBV_ILN_2232 GBV_ILN_2336 GBV_ILN_2446 GBV_ILN_2470 GBV_ILN_2472 GBV_ILN_2507 GBV_ILN_2522 GBV_ILN_2548 GBV_ILN_4035 GBV_ILN_4037 GBV_ILN_4046 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4242 GBV_ILN_4246 GBV_ILN_4249 GBV_ILN_4251 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4328 GBV_ILN_4333 GBV_ILN_4334 GBV_ILN_4335 GBV_ILN_4336 GBV_ILN_4338 GBV_ILN_4393 GBV_ILN_4700 54.27 ASE AR 56 2020 3 27 04 254-292 |
| allfieldsSound |
10.1007/s11241-020-09347-y doi (DE-627)SPR040369897 (SPR)s11241-020-09347-y-e DE-627 ger DE-627 rakwb eng 004 ASE 54.27 bkl Gaujal, Bruno verfasserin aut Feasibility of on-line speed policies in real-time systems 2020 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Abstract 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 }%$ 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 }%$ 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)}}%$ (Yao et al. in IEEE annual foundations of computer science, 1995), Average Rate %${\text{(AVR)}}%$ (Yao et al. 1995), %${\text{(BKP)}}%$ (Bansal in J ACM 54:1, 2007), and a Markovian Policy based on dynamic programming %${\text{(MP)}}%$ (Gaujal in Technical Report hal-01615835, Inria, 2017). We prove the following results:(OA)%$ {\text{(OA)}}%$ is feasible if and only if Smax≥C(hΔ-1+1)%$S_{\max } \ge C (h_{\varDelta -1}+1)%$, where hn%$h_n%$ is the n-th harmonic number (hn=∑i=1n1/i≈logn%$h_n = \sum _{i=1}^n 1/i \approx \log n%$).(AVR)%${\text{(AVR)}}%$ is feasible if and only if Smax≥ChΔ%$S_{\max } \ge C h_\varDelta %$.(BKP)%${\text{(BKP)}}%$ is feasible if and only if Smax≥eC%$S_{\max } \ge e C%$ (where e=exp(1)%$e = \exp (1)%$).(MP)%${\text{(MP)}}%$ is feasible if and only if Smax≥C%$S_{\max } \ge C%$. This is an optimal feasibility condition because when Smax<C%$S_{\max } < C%$ no policy can be feasible. This reinforces the interest of %${\text{(MP)}}%$ that is not only optimal for energy consumption (on average) but is also optimal regarding feasibility. Hard real-time systems (dpeaa)DE-He213 Feasibility (dpeaa)DE-He213 On-line speed policy (dpeaa)DE-He213 Markov decision process (dpeaa)DE-He213 Dynamic voltage (dpeaa)DE-He213 Frequency scaling (dpeaa)DE-He213 Girault, Alain verfasserin aut Plassart, Stéphan verfasserin aut Enthalten in Real-time systems Dordrecht [u.a.] : Springer Science + Business Media B.V, 1989 56(2020), 3 vom: 27. Apr., Seite 254-292 (DE-627)271351209 (DE-600)1480026-3 1573-1383 nnns volume:56 year:2020 number:3 day:27 month:04 pages:254-292 https://dx.doi.org/10.1007/s11241-020-09347-y lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_SPRINGER GBV_ILN_11 GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_32 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_74 GBV_ILN_90 GBV_ILN_95 GBV_ILN_100 GBV_ILN_101 GBV_ILN_105 GBV_ILN_110 GBV_ILN_120 GBV_ILN_138 GBV_ILN_150 GBV_ILN_151 GBV_ILN_152 GBV_ILN_161 GBV_ILN_170 GBV_ILN_171 GBV_ILN_187 GBV_ILN_213 GBV_ILN_224 GBV_ILN_230 GBV_ILN_250 GBV_ILN_281 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_636 GBV_ILN_702 GBV_ILN_2001 GBV_ILN_2003 GBV_ILN_2004 GBV_ILN_2005 GBV_ILN_2006 GBV_ILN_2007 GBV_ILN_2008 GBV_ILN_2009 GBV_ILN_2010 GBV_ILN_2011 GBV_ILN_2014 GBV_ILN_2015 GBV_ILN_2020 GBV_ILN_2021 GBV_ILN_2025 GBV_ILN_2026 GBV_ILN_2027 GBV_ILN_2031 GBV_ILN_2034 GBV_ILN_2037 GBV_ILN_2038 GBV_ILN_2039 GBV_ILN_2044 GBV_ILN_2048 GBV_ILN_2049 GBV_ILN_2050 GBV_ILN_2055 GBV_ILN_2056 GBV_ILN_2057 GBV_ILN_2059 GBV_ILN_2061 GBV_ILN_2064 GBV_ILN_2065 GBV_ILN_2068 GBV_ILN_2088 GBV_ILN_2093 GBV_ILN_2106 GBV_ILN_2107 GBV_ILN_2108 GBV_ILN_2110 GBV_ILN_2111 GBV_ILN_2112 GBV_ILN_2113 GBV_ILN_2118 GBV_ILN_2122 GBV_ILN_2129 GBV_ILN_2143 GBV_ILN_2144 GBV_ILN_2147 GBV_ILN_2148 GBV_ILN_2152 GBV_ILN_2153 GBV_ILN_2188 GBV_ILN_2190 GBV_ILN_2232 GBV_ILN_2336 GBV_ILN_2446 GBV_ILN_2470 GBV_ILN_2472 GBV_ILN_2507 GBV_ILN_2522 GBV_ILN_2548 GBV_ILN_4035 GBV_ILN_4037 GBV_ILN_4046 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4242 GBV_ILN_4246 GBV_ILN_4249 GBV_ILN_4251 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4328 GBV_ILN_4333 GBV_ILN_4334 GBV_ILN_4335 GBV_ILN_4336 GBV_ILN_4338 GBV_ILN_4393 GBV_ILN_4700 54.27 ASE AR 56 2020 3 27 04 254-292 |
| language |
English |
| source |
Enthalten in Real-time systems 56(2020), 3 vom: 27. Apr., Seite 254-292 volume:56 year:2020 number:3 day:27 month:04 pages:254-292 |
| sourceStr |
Enthalten in Real-time systems 56(2020), 3 vom: 27. Apr., Seite 254-292 volume:56 year:2020 number:3 day:27 month:04 pages:254-292 |
| format_phy_str_mv |
Article |
| institution |
findex.gbv.de |
| topic_facet |
Hard real-time systems Feasibility On-line speed policy Markov decision process Dynamic voltage Frequency scaling |
| dewey-raw |
004 |
| isfreeaccess_bool |
false |
| container_title |
Real-time systems |
| authorswithroles_txt_mv |
Gaujal, Bruno @@aut@@ Girault, Alain @@aut@@ Plassart, Stéphan @@aut@@ |
| publishDateDaySort_date |
2020-04-27T00:00:00Z |
| hierarchy_top_id |
271351209 |
| dewey-sort |
14 |
| id |
SPR040369897 |
| language_de |
englisch |
| fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">SPR040369897</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20220111055615.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">201007s2020 xx |||||o 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s11241-020-09347-y</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)SPR040369897</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(SPR)s11241-020-09347-y-e</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">004</subfield><subfield code="q">ASE</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">54.27</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Gaujal, Bruno</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Feasibility of on-line speed policies in real-time systems</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2020</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">Computermedien</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Online-Ressource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract 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 }%$ 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 }%$ 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)}}%$ (Yao et al. in IEEE annual foundations of computer science, 1995), Average Rate %${\text{(AVR)}}%$ (Yao et al. 1995), %${\text{(BKP)}}%$ (Bansal in J ACM 54:1, 2007), and a Markovian Policy based on dynamic programming %${\text{(MP)}}%$ (Gaujal in Technical Report hal-01615835, Inria, 2017). We prove the following results:(OA)%$ {\text{(OA)}}%$ is feasible if and only if Smax≥C(hΔ-1+1)%$S_{\max } \ge C (h_{\varDelta -1}+1)%$, where hn%$h_n%$ is the n-th harmonic number (hn=∑i=1n1/i≈logn%$h_n = \sum _{i=1}^n 1/i \approx \log n%$).(AVR)%${\text{(AVR)}}%$ is feasible if and only if Smax≥ChΔ%$S_{\max } \ge C h_\varDelta %$.(BKP)%${\text{(BKP)}}%$ is feasible if and only if Smax≥eC%$S_{\max } \ge e C%$ (where e=exp(1)%$e = \exp (1)%$).(MP)%${\text{(MP)}}%$ is feasible if and only if Smax≥C%$S_{\max } \ge C%$. This is an optimal feasibility condition because when Smax<C%$S_{\max } < C%$ no policy can be feasible. This reinforces the interest of %${\text{(MP)}}%$ that is not only optimal for energy consumption (on average) but is also optimal regarding feasibility.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Hard real-time systems</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Feasibility</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">On-line speed policy</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Markov decision process</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Dynamic voltage</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Frequency scaling</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Girault, Alain</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Plassart, Stéphan</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Real-time systems</subfield><subfield code="d">Dordrecht [u.a.] : Springer Science + Business Media B.V, 1989</subfield><subfield code="g">56(2020), 3 vom: 27. Apr., Seite 254-292</subfield><subfield code="w">(DE-627)271351209</subfield><subfield code="w">(DE-600)1480026-3</subfield><subfield code="x">1573-1383</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:56</subfield><subfield code="g">year:2020</subfield><subfield code="g">number:3</subfield><subfield code="g">day:27</subfield><subfield code="g">month:04</subfield><subfield code="g">pages:254-292</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://dx.doi.org/10.1007/s11241-020-09347-y</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_SPRINGER</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_11</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_20</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_22</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_23</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_24</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_31</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_32</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_39</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_40</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_60</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_62</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_63</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_69</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_73</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_74</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_90</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_95</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_100</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_101</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_105</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_110</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_120</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_138</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_150</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_151</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_152</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_161</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_170</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_171</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_187</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_213</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_224</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_230</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_250</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_281</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_285</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_293</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_370</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_602</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_636</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_702</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2001</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2003</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2004</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2005</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2006</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2007</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2008</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2009</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2010</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2011</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2014</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2015</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2020</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2021</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2025</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2026</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2027</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2031</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2034</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2037</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2038</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2039</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2044</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2048</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2049</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2050</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2055</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2056</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2057</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2059</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2061</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2064</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2065</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2068</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2088</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2093</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2106</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2107</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2108</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2110</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2111</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2112</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2113</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2118</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2122</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2129</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2143</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2144</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2147</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2148</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2152</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2153</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2188</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2190</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2232</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2336</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2446</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2470</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2472</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2507</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2522</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2548</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4035</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4037</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4046</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4112</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4125</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4126</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4242</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4246</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4249</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4251</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4305</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4306</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4307</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4313</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4322</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4323</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4324</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4325</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4326</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4328</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4333</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4334</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4335</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4336</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4338</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4393</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4700</subfield></datafield><datafield tag="936" ind1="b" ind2="k"><subfield code="a">54.27</subfield><subfield code="q">ASE</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">56</subfield><subfield code="j">2020</subfield><subfield code="e">3</subfield><subfield code="b">27</subfield><subfield code="c">04</subfield><subfield code="h">254-292</subfield></datafield></record></collection>
|
| author |
Gaujal, Bruno |
| spellingShingle |
Gaujal, Bruno ddc 004 bkl 54.27 misc Hard real-time systems misc Feasibility misc On-line speed policy misc Markov decision process misc Dynamic voltage misc Frequency scaling Feasibility of on-line speed policies in real-time systems |
| authorStr |
Gaujal, Bruno |
| ppnlink_with_tag_str_mv |
@@773@@(DE-627)271351209 |
| format |
electronic Article |
| dewey-ones |
004 - Data processing & computer science |
| delete_txt_mv |
keep |
| author_role |
aut aut aut |
| collection |
springer |
| remote_str |
true |
| illustrated |
Not Illustrated |
| issn |
1573-1383 |
| topic_title |
004 ASE 54.27 bkl Feasibility of on-line speed policies in real-time systems Hard real-time systems (dpeaa)DE-He213 Feasibility (dpeaa)DE-He213 On-line speed policy (dpeaa)DE-He213 Markov decision process (dpeaa)DE-He213 Dynamic voltage (dpeaa)DE-He213 Frequency scaling (dpeaa)DE-He213 |
| topic |
ddc 004 bkl 54.27 misc Hard real-time systems misc Feasibility misc On-line speed policy misc Markov decision process misc Dynamic voltage misc Frequency scaling |
| topic_unstemmed |
ddc 004 bkl 54.27 misc Hard real-time systems misc Feasibility misc On-line speed policy misc Markov decision process misc Dynamic voltage misc Frequency scaling |
| topic_browse |
ddc 004 bkl 54.27 misc Hard real-time systems misc Feasibility misc On-line speed policy misc Markov decision process misc Dynamic voltage misc Frequency scaling |
| format_facet |
Elektronische Aufsätze Aufsätze Elektronische Ressource |
| format_main_str_mv |
Text Zeitschrift/Artikel |
| carriertype_str_mv |
cr |
| hierarchy_parent_title |
Real-time systems |
| hierarchy_parent_id |
271351209 |
| dewey-tens |
000 - Computer science, knowledge & systems |
| hierarchy_top_title |
Real-time systems |
| isfreeaccess_txt |
false |
| familylinks_str_mv |
(DE-627)271351209 (DE-600)1480026-3 |
| title |
Feasibility of on-line speed policies in real-time systems |
| ctrlnum |
(DE-627)SPR040369897 (SPR)s11241-020-09347-y-e |
| title_full |
Feasibility of on-line speed policies in real-time systems |
| author_sort |
Gaujal, Bruno |
| journal |
Real-time systems |
| journalStr |
Real-time systems |
| lang_code |
eng |
| isOA_bool |
false |
| dewey-hundreds |
000 - Computer science, information & general works |
| recordtype |
marc |
| publishDateSort |
2020 |
| contenttype_str_mv |
txt |
| container_start_page |
254 |
| author_browse |
Gaujal, Bruno Girault, Alain Plassart, Stéphan |
| container_volume |
56 |
| class |
004 ASE 54.27 bkl |
| format_se |
Elektronische Aufsätze |
| author-letter |
Gaujal, Bruno |
| doi_str_mv |
10.1007/s11241-020-09347-y |
| dewey-full |
004 |
| author2-role |
verfasserin |
| title_sort |
feasibility of on-line speed policies in real-time systems |
| title_auth |
Feasibility of on-line speed policies in real-time systems |
| abstract |
Abstract 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 }%$ 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 }%$ 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)}}%$ (Yao et al. in IEEE annual foundations of computer science, 1995), Average Rate %${\text{(AVR)}}%$ (Yao et al. 1995), %${\text{(BKP)}}%$ (Bansal in J ACM 54:1, 2007), and a Markovian Policy based on dynamic programming %${\text{(MP)}}%$ (Gaujal in Technical Report hal-01615835, Inria, 2017). We prove the following results:(OA)%$ {\text{(OA)}}%$ is feasible if and only if Smax≥C(hΔ-1+1)%$S_{\max } \ge C (h_{\varDelta -1}+1)%$, where hn%$h_n%$ is the n-th harmonic number (hn=∑i=1n1/i≈logn%$h_n = \sum _{i=1}^n 1/i \approx \log n%$).(AVR)%${\text{(AVR)}}%$ is feasible if and only if Smax≥ChΔ%$S_{\max } \ge C h_\varDelta %$.(BKP)%${\text{(BKP)}}%$ is feasible if and only if Smax≥eC%$S_{\max } \ge e C%$ (where e=exp(1)%$e = \exp (1)%$).(MP)%${\text{(MP)}}%$ is feasible if and only if Smax≥C%$S_{\max } \ge C%$. This is an optimal feasibility condition because when Smax<C%$S_{\max } < C%$ no policy can be feasible. This reinforces the interest of %${\text{(MP)}}%$ that is not only optimal for energy consumption (on average) but is also optimal regarding feasibility. |
| abstractGer |
Abstract 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 }%$ 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 }%$ 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)}}%$ (Yao et al. in IEEE annual foundations of computer science, 1995), Average Rate %${\text{(AVR)}}%$ (Yao et al. 1995), %${\text{(BKP)}}%$ (Bansal in J ACM 54:1, 2007), and a Markovian Policy based on dynamic programming %${\text{(MP)}}%$ (Gaujal in Technical Report hal-01615835, Inria, 2017). We prove the following results:(OA)%$ {\text{(OA)}}%$ is feasible if and only if Smax≥C(hΔ-1+1)%$S_{\max } \ge C (h_{\varDelta -1}+1)%$, where hn%$h_n%$ is the n-th harmonic number (hn=∑i=1n1/i≈logn%$h_n = \sum _{i=1}^n 1/i \approx \log n%$).(AVR)%${\text{(AVR)}}%$ is feasible if and only if Smax≥ChΔ%$S_{\max } \ge C h_\varDelta %$.(BKP)%${\text{(BKP)}}%$ is feasible if and only if Smax≥eC%$S_{\max } \ge e C%$ (where e=exp(1)%$e = \exp (1)%$).(MP)%${\text{(MP)}}%$ is feasible if and only if Smax≥C%$S_{\max } \ge C%$. This is an optimal feasibility condition because when Smax<C%$S_{\max } < C%$ no policy can be feasible. This reinforces the interest of %${\text{(MP)}}%$ that is not only optimal for energy consumption (on average) but is also optimal regarding feasibility. |
| abstract_unstemmed |
Abstract 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 }%$ 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 }%$ 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)}}%$ (Yao et al. in IEEE annual foundations of computer science, 1995), Average Rate %${\text{(AVR)}}%$ (Yao et al. 1995), %${\text{(BKP)}}%$ (Bansal in J ACM 54:1, 2007), and a Markovian Policy based on dynamic programming %${\text{(MP)}}%$ (Gaujal in Technical Report hal-01615835, Inria, 2017). We prove the following results:(OA)%$ {\text{(OA)}}%$ is feasible if and only if Smax≥C(hΔ-1+1)%$S_{\max } \ge C (h_{\varDelta -1}+1)%$, where hn%$h_n%$ is the n-th harmonic number (hn=∑i=1n1/i≈logn%$h_n = \sum _{i=1}^n 1/i \approx \log n%$).(AVR)%${\text{(AVR)}}%$ is feasible if and only if Smax≥ChΔ%$S_{\max } \ge C h_\varDelta %$.(BKP)%${\text{(BKP)}}%$ is feasible if and only if Smax≥eC%$S_{\max } \ge e C%$ (where e=exp(1)%$e = \exp (1)%$).(MP)%${\text{(MP)}}%$ is feasible if and only if Smax≥C%$S_{\max } \ge C%$. This is an optimal feasibility condition because when Smax<C%$S_{\max } < C%$ no policy can be feasible. This reinforces the interest of %${\text{(MP)}}%$ that is not only optimal for energy consumption (on average) but is also optimal regarding feasibility. |
| collection_details |
GBV_USEFLAG_A SYSFLAG_A GBV_SPRINGER GBV_ILN_11 GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_32 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_74 GBV_ILN_90 GBV_ILN_95 GBV_ILN_100 GBV_ILN_101 GBV_ILN_105 GBV_ILN_110 GBV_ILN_120 GBV_ILN_138 GBV_ILN_150 GBV_ILN_151 GBV_ILN_152 GBV_ILN_161 GBV_ILN_170 GBV_ILN_171 GBV_ILN_187 GBV_ILN_213 GBV_ILN_224 GBV_ILN_230 GBV_ILN_250 GBV_ILN_281 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_636 GBV_ILN_702 GBV_ILN_2001 GBV_ILN_2003 GBV_ILN_2004 GBV_ILN_2005 GBV_ILN_2006 GBV_ILN_2007 GBV_ILN_2008 GBV_ILN_2009 GBV_ILN_2010 GBV_ILN_2011 GBV_ILN_2014 GBV_ILN_2015 GBV_ILN_2020 GBV_ILN_2021 GBV_ILN_2025 GBV_ILN_2026 GBV_ILN_2027 GBV_ILN_2031 GBV_ILN_2034 GBV_ILN_2037 GBV_ILN_2038 GBV_ILN_2039 GBV_ILN_2044 GBV_ILN_2048 GBV_ILN_2049 GBV_ILN_2050 GBV_ILN_2055 GBV_ILN_2056 GBV_ILN_2057 GBV_ILN_2059 GBV_ILN_2061 GBV_ILN_2064 GBV_ILN_2065 GBV_ILN_2068 GBV_ILN_2088 GBV_ILN_2093 GBV_ILN_2106 GBV_ILN_2107 GBV_ILN_2108 GBV_ILN_2110 GBV_ILN_2111 GBV_ILN_2112 GBV_ILN_2113 GBV_ILN_2118 GBV_ILN_2122 GBV_ILN_2129 GBV_ILN_2143 GBV_ILN_2144 GBV_ILN_2147 GBV_ILN_2148 GBV_ILN_2152 GBV_ILN_2153 GBV_ILN_2188 GBV_ILN_2190 GBV_ILN_2232 GBV_ILN_2336 GBV_ILN_2446 GBV_ILN_2470 GBV_ILN_2472 GBV_ILN_2507 GBV_ILN_2522 GBV_ILN_2548 GBV_ILN_4035 GBV_ILN_4037 GBV_ILN_4046 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4242 GBV_ILN_4246 GBV_ILN_4249 GBV_ILN_4251 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4328 GBV_ILN_4333 GBV_ILN_4334 GBV_ILN_4335 GBV_ILN_4336 GBV_ILN_4338 GBV_ILN_4393 GBV_ILN_4700 |
| container_issue |
3 |
| title_short |
Feasibility of on-line speed policies in real-time systems |
| url |
https://dx.doi.org/10.1007/s11241-020-09347-y |
| remote_bool |
true |
| author2 |
Girault, Alain Plassart, Stéphan |
| author2Str |
Girault, Alain Plassart, Stéphan |
| ppnlink |
271351209 |
| mediatype_str_mv |
c |
| isOA_txt |
false |
| hochschulschrift_bool |
false |
| doi_str |
10.1007/s11241-020-09347-y |
| up_date |
2024-07-03T15:33:12.955Z |
| _version_ |
1803572523022942208 |
| fullrecord_marcxml |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">SPR040369897</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20220111055615.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">201007s2020 xx |||||o 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s11241-020-09347-y</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)SPR040369897</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(SPR)s11241-020-09347-y-e</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">004</subfield><subfield code="q">ASE</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">54.27</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Gaujal, Bruno</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Feasibility of on-line speed policies in real-time systems</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2020</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">Computermedien</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Online-Ressource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract 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 }%$ 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 }%$ 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)}}%$ (Yao et al. in IEEE annual foundations of computer science, 1995), Average Rate %${\text{(AVR)}}%$ (Yao et al. 1995), %${\text{(BKP)}}%$ (Bansal in J ACM 54:1, 2007), and a Markovian Policy based on dynamic programming %${\text{(MP)}}%$ (Gaujal in Technical Report hal-01615835, Inria, 2017). We prove the following results:(OA)%$ {\text{(OA)}}%$ is feasible if and only if Smax≥C(hΔ-1+1)%$S_{\max } \ge C (h_{\varDelta -1}+1)%$, where hn%$h_n%$ is the n-th harmonic number (hn=∑i=1n1/i≈logn%$h_n = \sum _{i=1}^n 1/i \approx \log n%$).(AVR)%${\text{(AVR)}}%$ is feasible if and only if Smax≥ChΔ%$S_{\max } \ge C h_\varDelta %$.(BKP)%${\text{(BKP)}}%$ is feasible if and only if Smax≥eC%$S_{\max } \ge e C%$ (where e=exp(1)%$e = \exp (1)%$).(MP)%${\text{(MP)}}%$ is feasible if and only if Smax≥C%$S_{\max } \ge C%$. This is an optimal feasibility condition because when Smax<C%$S_{\max } < C%$ no policy can be feasible. This reinforces the interest of %${\text{(MP)}}%$ that is not only optimal for energy consumption (on average) but is also optimal regarding feasibility.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Hard real-time systems</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Feasibility</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">On-line speed policy</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Markov decision process</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Dynamic voltage</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Frequency scaling</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Girault, Alain</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Plassart, Stéphan</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Real-time systems</subfield><subfield code="d">Dordrecht [u.a.] : Springer Science + Business Media B.V, 1989</subfield><subfield code="g">56(2020), 3 vom: 27. Apr., Seite 254-292</subfield><subfield code="w">(DE-627)271351209</subfield><subfield code="w">(DE-600)1480026-3</subfield><subfield code="x">1573-1383</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:56</subfield><subfield code="g">year:2020</subfield><subfield code="g">number:3</subfield><subfield code="g">day:27</subfield><subfield code="g">month:04</subfield><subfield code="g">pages:254-292</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://dx.doi.org/10.1007/s11241-020-09347-y</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_SPRINGER</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_11</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_20</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_22</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_23</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_24</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_31</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_32</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_39</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_40</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_60</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_62</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_63</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_69</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_73</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_74</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_90</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_95</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_100</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_101</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_105</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_110</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_120</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_138</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_150</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_151</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_152</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_161</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_170</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_171</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_187</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_213</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_224</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_230</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_250</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_281</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_285</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_293</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_370</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_602</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_636</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_702</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2001</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2003</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2004</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2005</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2006</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2007</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2008</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2009</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2010</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2011</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2014</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2015</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2020</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2021</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2025</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2026</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2027</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2031</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2034</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2037</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2038</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2039</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2044</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2048</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2049</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2050</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2055</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2056</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2057</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2059</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2061</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2064</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2065</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2068</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2088</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2093</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2106</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2107</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2108</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2110</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2111</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2112</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2113</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2118</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2122</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2129</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2143</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2144</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2147</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2148</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2152</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2153</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2188</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2190</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2232</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2336</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2446</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2470</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2472</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2507</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2522</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2548</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4035</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4037</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4046</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4112</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4125</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4126</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4242</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4246</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4249</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4251</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4305</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4306</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4307</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4313</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4322</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4323</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4324</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4325</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4326</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4328</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4333</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4334</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4335</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4336</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4338</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4393</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4700</subfield></datafield><datafield tag="936" ind1="b" ind2="k"><subfield code="a">54.27</subfield><subfield code="q">ASE</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">56</subfield><subfield code="j">2020</subfield><subfield code="e">3</subfield><subfield code="b">27</subfield><subfield code="c">04</subfield><subfield code="h">254-292</subfield></datafield></record></collection>
|
| score |
7.399701 |