2 citations · 5 across the 8 of their papers we have counts for
10 papers
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…
D2.4 Report on the final prototype of programming abstractions for energy-efficient inter-process communication
Phuong Hoai Ha, Vi Ngoc-Nha Tran, Ibrahim Umar +5
Work package 2 (WP2) aims to develop libraries for energy-efficient inter-process communication and data sharing on the EXCESS platforms. The Deliverable D2.4 reports on the final…
D2.3 Power models, energy models and libraries for energy-efficient concurrent data structures and algorithms
Phuong Hoai Ha, Vi Ngoc-Nha Tran, Ibrahim Umar +5
This deliverable reports the results of the power models, energy models and libraries for energy-efficient concurrent data structures and algorithms as available by project month 3…
D2.1 Models for energy consumption of data structures and algorithms
Phuong Hoai Ha, Vi Ngoc-Nha Tran, Ibrahim Umar +5
This deliverable reports our early energy models for data structures and algorithms based on both micro-benchmarks and concurrent algorithms. It reports the early results of Task 2…
D2.2 White-box methodologies, programming abstractions and libraries
Phuong Hoai Ha, Vi Ngoc-Nha Tran, Ibrahim Umar +4
This deliverable reports the results of white-box methodologies and early results of the first prototype of libraries and programming abstractions as available by project month 18…
How Lock-free Data Structures Perform in Dynamic Environments: Models and Analyses
Aras Atalar, Paul Renaud-Goud, Philippas Tsigas
In this paper we present two analytical frameworks for calculating the performance of lock-free data structures. Lock-free data structures are based on retry loops and are called b…
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…
Efficient and Robust Allocation Algorithms in Clouds under Memory Constraints
Olivier Beaumont, Lionel Eyraud-Dubois, Paul Renaud-Goud
We consider robust resource allocation of services in Clouds. More specifically, we consider the case of a large public or private Cloud platform that runs a relatively small set o…
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…
Approximation Algorithms for Energy Minimization in Cloud Service Allocation under Reliability Constraints
Olivier Beaumont, Philippe Duchon, Paul Renaud-Goud
We consider allocation problems that arise in the context of service allocation in Clouds. More specifically, we assume on the one part that each computing resource is associated t…