publications
2023
-
Soft Real-Time Gang SchedulingIn Proceedings of the 44th IEEE Real-Time Systems Symposium, 2023to appear
-
Holistically Budgeting Processing GraphsIn Proceedings of the 44th IEEE Real-Time Systems Symposium, 2023to appear
-
Optimal Multiprocessor Locking Protocols Under FIFO SchedulingIn Proceedings of the 35th Euromicro Conference on Real-Time Systems, 2023
2022
-
Overrun-Resilient Multiprocessor Real-Time LockingIn Proceedings of the 34th Euromicro Conference on Real-Time Systems, 2022
-
Exact Response-Time Bounds of Periodic DAG Tasks under Server-Based Global SchedulingIn Proceedings of the 43rd IEEE Real-Time Systems Symposium, 2022
-
r-Gatherings on a star and uncertain r-gatherings on a lineDiscrete Mathematics, Algorithms and Applications, 2022
2021
-
Tight Tardiness Bounds for Pseudo-Harmonic Tasks Under Global-EDF-Like SchedulersIn Proceedings of the 33th Euromicro Conference on Real-Time Systems, 2021
-
Simultaneous Multithreading in Mixed-Criticality Real-Time SystemsIn Proceedings of the 27th IEEE Real-Time and Embedded Technology and Applications Symposium, 2021
2020
-
A Soft-Real-Time-Optimal Semi-Clustered Scheduler with a Constant Tardiness BoundIn Proceedings of the 26th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications, 2020
-
Exploiting Simultaneous Multithreading in Priority-Driven Hard Real-Time SystemsIn Proceedings of the 26th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications, 2020
-
A survey on pairwise compatibility graphsAKCE International Journal of Graphs and Combinatorics, 2020
2019
-
One-Dimensional r-Gathering Under UncertaintyIn Proceedings of the 13th International Algorithmic Aspects in Information and Management - Conference, 2019
-
r-Gatherings on a StarIn Proceedings of the 13th International Conference on Algorithms and Computation, 2019
2017
-
Multi-interval Pairwise Compatibility Graphs - (Extended Abstract)In Proceedings of the 14th Annual Conference on Theory and Applications of Models of Computation,