Liliana Cucu-Grosjean
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Liliana Cucu-Grosjean has a total of 23 co-authors. Here are the top co-authors by number of shared publications:
- Robert Ian Davis
University of York, York, UK
3 shared publications - George Lima
Institute of Computing, Federal University of Bahia, Salvador, Brazil
2 shared publications - Sebastian Altmeyer
University of Amsterdam
2 shared publications - Adriana Gogonel
StatInf, Paris, France
1 shared publication - Avner Bar-Hen
INRIA Paris, Paris, France
1 shared publication - Benjamin Lesage
University of York
1 shared publication
Latest Publications
- 31 December 2023
- Published by Springer Nature in Design Automation for Embedded Systems
- Vol. 27 (4) , 275-302
On the impact of hardware-related events on the execution of real-time programs
- 31 December 2023
- Published by Springer Nature in Design Automation for Embedded Systems
- Vol. 27 (4) , 275-302
On the impact of hardware-related events on the execution of real-time programs
- 17 October 2023
- Published by Springer Nature in Design Automation for Embedded Systems
- Vol. 28 (1) , 1-21
On vulnerabilities in EVT-based timing analysis: an experimental investigation on a multi-core architecture
- 17 October 2023
- Published by Springer Nature in Design Automation for Embedded Systems
- Vol. 28 (1) , 1-21
On vulnerabilities in EVT-based timing analysis: an experimental investigation on a multi-core architecture
- 3 October 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 72 (1) , 3-14
Response Time Stochastic Analysis for Fixed-Priority Stable Real-Time Systems
In this paper, we prove that a mean system utilization smaller than one is a necessary condition for the feasibility of real-time systems. Such systems are defined as stable . Stable systems have two distinct states: a transient state, followed by a steady-state where the same distribution of response times is repeated infinitely for each task. We prove that the Liu and Layland theorem holds for stable probabilistic real-time systems with implicit deadlines, we provide an analytical approximation of response times for each of those two states and a bound of the instant when a real-time system becomes steady.
- 3 October 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 72 (1) , 3-14
Response Time Stochastic Analysis for Fixed-Priority Stable Real-Time Systems
In this paper, we prove that a mean system utilization smaller than one is a necessary condition for the feasibility of real-time systems. Such systems are defined as stable . Stable systems have two distinct states: a transient state, followed by a steady-state where the same distribution of response times is repeated infinitely for each task. We prove that the Liu and Layland theorem holds for stable probabilistic real-time systems with implicit deadlines, we provide an analytical approximation of response times for each of those two states and a bound of the instant when a real-time system becomes steady.
- 1 March 2022
- Published by Elsevier in Journal of Systems Architecture
- Vol. 124
Graph reductions and partitioning heuristics for multicore DAG scheduling
- 1 March 2022
- Published by Elsevier in Journal of Systems Architecture
- Vol. 124
Graph reductions and partitioning heuristics for multicore DAG scheduling
- 11 June 2021
- Published by Springer Nature in Real-Time Systems
- Vol. 57 (3) , 265-267
Guest editorial: Special issue on Real-Time Systems Symposium (RTSS)
- 11 June 2021
- Published by Springer Nature in Real-Time Systems
- Vol. 57 (3) , 265-267
Guest editorial: Special issue on Real-Time Systems Symposium (RTSS)
- 1 July 2018
- Published by Springer Nature in Real-Time Systems
- Vol. 54 (3) , 605-606
Guest editorial: special issue on real time and network systems
- 1 July 2018
- Published by Springer Nature in Real-Time Systems
- Vol. 54 (3) , 605-606
Guest editorial: special issue on real time and network systems
- Open Access
- 18 December 2017
- Published by Springer Nature in Real-Time Systems
- Vol. 54 (2) , 307-388
On the analysis of random replacement caches using static probabilistic timing methods for multi-path programs
- 18 December 2017
- Published by Springer Nature in Real-Time Systems
- Vol. 54 (2) , 307-388
Open AccessOn the analysis of random replacement caches using static probabilistic timing methods for multi-path programs
- 27 June 2016
- Published by Springer Nature in Real-Time Systems
- Vol. 52 (6) , 808-832
Periodicity of real-time schedules for dependent periodic tasks on identical multiprocessor platforms
- 27 June 2016
- Published by Springer Nature in Real-Time Systems
- Vol. 52 (6) , 808-832
Periodicity of real-time schedules for dependent periodic tasks on identical multiprocessor platforms
- Open Access
- 30 April 2015
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Embedded Computing Systems
- Vol. 14 (3) , 1-30
A Probabilistic Calculus for Probabilistic Real-Time Systems
Challenges within real-time research are mostly in terms of modeling and analyzing the complexity of actual real-time embedded systems. Probabilities are effective in both modeling and analyzing embedded systems by increasing the amount of information for the description of elements composing the system. Elements are tasks and applications that need resources, schedulers that execute tasks, and resource provisioning that satisfies the resource demand. In this work, we present a model that considers component-based real-time systems with component interfaces able to abstract both the functional and nonfunctional requirements of components and the system. Our model faces probabilities and probabilistic real-time systems unifying in the same framework probabilistic scheduling techniques and compositional guarantees varying from soft to hard real time. We provide an algebra to work with the probabilistic notation developed and form an analysis in terms of sufficient probabilistic schedulability conditions for task systems with either preemptive fixed-priority or earliest deadline first scheduling paradigms.
- 30 April 2015
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Embedded Computing Systems
- Vol. 14 (3) , 1-30
Open AccessA Probabilistic Calculus for Probabilistic Real-Time Systems
Challenges within real-time research are mostly in terms of modeling and analyzing the complexity of actual real-time embedded systems. Probabilities are effective in both modeling and analyzing embedded systems by increasing the amount of information for the description of elements composing the system. Elements are tasks and applications that need resources, schedulers that execute tasks, and resource provisioning that satisfies the resource demand. In this work, we present a model that considers component-based real-time systems with component interfaces able to abstract both the functional and nonfunctional requirements of components and the system. Our model faces probabilities and probabilistic real-time systems unifying in the same framework probabilistic scheduling techniques and compositional guarantees varying from soft to hard real time. We provide an algebra to work with the probabilistic notation developed and form an analysis in terms of sufficient probabilistic schedulability conditions for task systems with either preemptive fixed-priority or earliest deadline first scheduling paradigms.