2 citations · 5 across the 8 of their papers we have counts for
3 papers · 1 filter
Lock-Free Search Data Structures: Throughput Modelling with Poisson Processes
Aras Atalar, Paul Renaud-Goud, Philippas Tsigas
This paper considers the modelling and the analysis of the performance of lock-free concurrent search data structures. Our analysis considers such lock-free data structures that ar…
Analyzing the Performance of Lock-Free Data Structures: A Conflict-based Model
Aras Atalar, Paul Renaud-Goud, Philippas Tsigas
This paper considers the modeling and the analysis of the performance of lock-free concurrent data structures. Lock-free designs employ an optimistic conflict control mechanism, al…
Energy-aware checkpointing of divisible tasks with soft or hard deadlines
Guillaume Aupy, Anne Benoit, Rami Melhem +2
In this paper, we aim at minimizing the energy consumption when executing a divisible workload under a bound on the total execution time, while resilience is provided through check…