Zobrazeno 1 - 4
of 4
pro vyhledávání: '"Stéphan Plassart"'
Publikováno v:
SoftwareX, Vol 27, Iss , Pp 101882- (2024)
Time-sensitive networks, as in the context of IEEE-TSN and IETF-Detnet, require bounds on worst-case delays. Various network analysis tools compute such bounds; these tools are based on different methods and provide delay bounds that are all valid bu
Externí odkaz:
https://doaj.org/article/fcab8b993a85499b8154b3aff14738a5
Publikováno v:
Real-Time Systems
Real-Time Systems, Springer Verlag, 2020, ⟨10.1007/s11241-020-09347-y⟩
Real-Time Systems, 2020, ⟨10.1007/s11241-020-09347-y⟩
Real-Time Systems, Springer Verlag, 2020, ⟨10.1007/s11241-020-09347-y⟩
Real-Time Systems, 2020, ⟨10.1007/s11241-020-09347-y⟩
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 ∆ respectively. Furthermore, S max deno
Publikováno v:
EBCCSP 2020-6th International Conference on Event-Based Control, Communication, and Signal Processing
EBCCSP 2020-6th International Conference on Event-Based Control, Communication, and Signal Processing, Sep 2020, Krakow, Poland. pp.1-8, ⟨10.1109/EBCCSP51266.2020.9291353⟩
EBCCSP
EBCCSP 2020-6th International Conference on Event-Based Control, Communication, and Signal Processing, Sep 2020, Krakow, Poland. pp.1-8, ⟨10.1109/EBCCSP51266.2020.9291353⟩
EBCCSP
International audience; This paper presents a discrete time Markov Decision Process (MDP) to compute the optimal speed scaling policy to minimize the energy consumption of a single processor executing a finite set of jobs with real-time constraints.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::daad4b4f9285d99cb6a448ec3eb1903f
https://hal.archives-ouvertes.fr/hal-03020330/file/EBCCSP_2020.pdf
https://hal.archives-ouvertes.fr/hal-03020330/file/EBCCSP_2020.pdf
Publikováno v:
Journal of Scheduling
Journal of Scheduling, Springer Verlag, 2020, pp.1-25. ⟨10.1007/s10951-020-00660-9⟩
Journal of Scheduling, 2020, pp.1-25. ⟨10.1007/s10951-020-00660-9⟩
Journal of Scheduling, Springer Verlag, 2020, pp.1-25. ⟨10.1007/s10951-020-00660-9⟩
Journal of Scheduling, 2020, pp.1-25. ⟨10.1007/s10951-020-00660-9⟩
International audience; This paper proposes a Discrete Time Markov Decision Process (MDP) approach to compute the optimal on-line speed scaling policy to minimize the energy consumption of a single processor executing a finite or infinite set of jobs
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2edfc3b958824251d72ce94eedd24743
https://hal.inria.fr/hal-02888573/file/DynamicSpeedScalingMinimizingEnergy.pdf
https://hal.inria.fr/hal-02888573/file/DynamicSpeedScalingMinimizingEnergy.pdf