Follow
Jonatha Anselmi
Jonatha Anselmi
Inria - National Institute for Research in Digital Science and Technology
Verified email at inria.fr - Homepage
Title
Cited by
Cited by
Year
Generalized nash equilibria for saas/paas clouds
J Anselmi, D Ardagna, M Passacantando
European Journal of Operational Research 236 (1), 326-339, 2014
682014
A qos-based selection approach of autonomic grid services
J Anselmi, D Ardagna, P Cremonesi
Proceedings of the 2007 workshop on Service-oriented computing performance …, 2007
592007
Competition yields efficiency in load balancing games
J Anselmi, U Ayesta, A Wierman
Performance Evaluation 68 (11), 986-1001, 2011
332011
The economics of the cloud: price competition and congestion
J Anselmi, D Ardagna, JCS Lui, A Wierman, Y Xu, Z Yang
ACM SIGMETRICS Performance Evaluation Review 41 (4), 47-49, 2014
322014
The economics of the cloud
J Anselmi, D Ardagna, JCS Lui, A Wierman, Y Xu, Z Yang
ACM Transactions on Modeling and Performance Evaluation of Computing Systems …, 2017
312017
Optimal routing in parallel, non-observable queues and the price of anarchy revisited
J Anselmi, B Gaujal
Teletraffic Congress (ITC), 2010 22nd International, 1-8, 2010
29*2010
Energy-aware capacity scaling in virtualized environments with performance guarantees
J Anselmi, IM Verloop
Performance Evaluation 68 (11), 1207-1221, 2011
282011
Service consolidation with end-to-end response time constraints
J Anselmi, E Amaldi, P Cremonesi
2008 34th Euromicro Conference Software Engineering and Advanced …, 2008
272008
The price of forgetting in parallel and non-observable queues
J Anselmi, B Gaujal
Performance Evaluation 68 (12), 1291-1311, 2011
232011
Power-of-d-Choices with Memory: Fluid Limit and Optimality
J Anselmi, F Dufour
Mathematics of Operations Research 45 (3), 862-888, 2020
222020
Heavy-traffic revenue maximization in parallel multiclass queues
J Anselmi, G Casale
Performance Evaluation 70 (10), 806-821, 2013
212013
Closed queueing networks under congestion: Nonbottleneck independence and bottleneck convergence
J Anselmi, B D'Auria, N Walton
Mathematics of operations research 38 (3), 469-491, 2013
212013
Combining size-based load balancing with round-robin for scalable low latency
J Anselmi
IEEE Transactions on Parallel and Distributed Systems 31 (4), 886-896, 2019
182019
Improved approximations for the Erlang loss model
J Anselmi, Y Lu, M Sharma, MS Squillante
Queueing Systems 63, 217-239, 2009
17*2009
Asymptotically optimal size-interval task assignments
J Anselmi, J Doncel
IEEE Transactions on parallel and distributed systems 30 (11), 2422-2433, 2019
152019
Piecewise optimal trajectories of observer for bearings-only tracking by quantization
H Zhang, F Dufour, J Anselmi, D Laneuville, A Nègre
2017 20th International Conference on Information Fusion (Fusion), 1-7, 2017
152017
Computable approximations for continuous-time Markov decision processes on Borel spaces based on empirical measures
J Anselmi, F Dufour, T Prieto-Rumeau
Journal of Mathematical Analysis and Applications 443 (2), 1323-1361, 2016
102016
Performance evaluation of work stealing for streaming applications
J Anselmi, B Gaujal
International Conference On Principles Of Distributed Systems, 18-32, 2009
102009
Control of parallel non-observable queues: asymptotic equivalence and optimality of periodic policies
J Anselmi, B Gaujal, T Nesti
Stochastic Systems 5 (1), 120-145, 2015
92015
A unified framework for the bottleneck analysis of multiclass queueing networks
J Anselmi, P Cremonesi
Performance Evaluation 67 (4), 218-234, 2010
92010
The system can't perform the operation now. Try again later.
Articles 1–20