default search action
Jonatha Anselmi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
- [j29]Jonatha Anselmi, Josu Doncel:
Balanced Splitting: A Framework for Achieving Zero-Wait in the Multiserver-Job Model. IEEE Trans. Parallel Distributed Syst. 36(1): 43-54 (2025) - 2024
- [j28]Jonatha Anselmi, Bruno Gaujal, Louis-Sébastien Rebuffi:
Learning optimal admission control in partially observable queueing networks. Queueing Syst. Theory Appl. 108(1): 31-79 (2024) - [j27]Federica Filippini
, Jonatha Anselmi
A Stochastic Approach for Scheduling AI Training Jobs in GPU-Based Systems. IEEE Trans. Cloud Comput. 12(1): 53-69 (2024) - [j26]Jonatha Anselmi
Load Balancing with Job-Size Testing: Performance Improvement or Degradation? ACM Trans. Model. Perform. Evaluation Comput. Syst. 9(2): 8:1-8:27 (2024) - [j25]Jonatha Anselmi
Asynchronous Load Balancing and Auto-Scaling: Mean-Field Limit and Optimal Design. IEEE/ACM Trans. Netw. 32(4): 2960-2971 (2024) - [i8]Jonatha Anselmi, Josu Doncel:
Balanced Splitting: A Framework for Achieving Zero-wait in the Multiserver-job Model. CoRR abs/2409.18557 (2024) - 2023
- [i7]Jonatha Anselmi, Bruno Gaujal, Louis-Sébastien Rebuffi:
Reinforcement Learning in a Birth and Death Process: Breaking the Dependence on the State Space. CoRR abs/2302.10667 (2023) - [i6]Jonatha Anselmi, Josu Doncel:
Load Balancing with Job-Size Testing: Performance Improvement or Degradation? CoRR abs/2304.00899 (2023) - [i5]Jonatha Anselmi, Bruno Gaujal, Louis-Sébastien Rebuffi:
Learning Optimal Admission Control in Partially Observable Queueing Networks. CoRR abs/2308.02391 (2023) - 2022
- [j24]Jonatha Anselmi:
Replication vs speculation for load balancing. Queueing Syst. Theory Appl. 100(3-4): 389-391 (2022) - [j23]Jonatha Anselmi, Bruno Gaujal, Louis-Sébastien Rebuffi:
Optimal Speed Profile of a DVFS Processor under Soft Deadlines. SIGMETRICS Perform. Evaluation Rev. 49(3): 71-72 (2022) - [j22]Jonatha Anselmi
Stability and Optimization of Speculative Queueing Networks. IEEE/ACM Trans. Netw. 30(2): 911-922 (2022) - [c13]Jonatha Anselmi, Bruno Gaujal:
Energy Optimal Activation of Processors for the Execution of a Single Task with Unknown Size. MASCOTS 2022: 65-72 - [c12]Jonatha Anselmi, Bruno Gaujal, Louis-Sébastien Rebuffi:
Reinforcement Learning in a Birth and Death Process: Breaking the Dependence on the State Space. NeurIPS 2022 - [i4]Jonatha Anselmi:
Asynchronous Load Balancing and Auto-scaling: Mean-Field Limit and Optimal Design. CoRR abs/2204.02352 (2022) - 2021
- [j21]Jonatha Anselmi, Bruno Gaujal, Louis-Sébastien Rebuffi
Optimal speed profile of a DVFS processor under soft deadlines. Perform. Evaluation 152: 102245 (2021) - [i3]Jonatha Anselmi, Neil Walton:
Stability and Optimization of Speculative Queueing Networks. CoRR abs/2104.10426 (2021) - 2020
- [j20]Jonatha Anselmi
Power-of-d-Choices with Memory: Fluid Limit and Optimality. Math. Oper. Res. 45(3): 862-888 (2020) - [j19]Jonatha Anselmi
Combining Size-Based Load Balancing with Round-Robin for Scalable Low Latency. IEEE Trans. Parallel Distributed Syst. 31(4): 886-896 (2020)
2010 – 2019
- 2019
- [j18]Jonatha Anselmi
Asymptotically Optimal Size-Interval Task Assignments. IEEE Trans. Parallel Distributed Syst. 30(11): 2422-2433 (2019) - 2018
- [j17]Jonatha Anselmi, François Dufour
Computable approximations for average Markov decision processes in continuous time. J. Appl. Probab. 55(2): 571-592 (2018) - [i2]Jonatha Anselmi, François Dufour:
Power-of-d-Choices with Memory: Fluid Limit and Optimality. CoRR abs/1802.06566 (2018) - 2017
- [j16]Jonatha Anselmi
Asymptotically optimal open-loop load balancing. Queueing Syst. Theory Appl. 87(3-4): 245-267 (2017) - [j15]Jonatha Anselmi, Danilo Ardagna
The Economics of the Cloud. ACM Trans. Model. Perform. Evaluation Comput. Syst. 2(4): 18:1-18:23 (2017) - [c11]Huilong Zhang, François Dufour
Piecewise optimal trajectories of observer for bearings-only tracking by quantization. FUSION 2017: 1-7 - 2016
- [j14]Jonatha Anselmi, Neil Walton:
Decentralized Proportional Load Balancing. SIAM J. Appl. Math. 76(1): 391-410 (2016) - 2014
- [j13]Jonatha Anselmi, Danilo Ardagna
Generalized Nash equilibria for SaaS/PaaS Clouds. Eur. J. Oper. Res. 236(1): 326-339 (2014) - [j12]Jonatha Anselmi, Bruno Gaujal:
Efficiency of simulation in monotone hyper-stable queueing networks. Queueing Syst. Theory Appl. 76(1): 51-72 (2014) - [j11]Jonatha Anselmi, Danilo Ardagna, John C. S. Lui, Adam Wierman, Yunjian Xu, Zichao Yang:
The economics of the cloud: price competition and congestion. SIGecom Exch. 13(1): 58-63 (2014) - [j10]Jonatha Anselmi, Danilo Ardagna
The economics of the cloud: price competition and congestion. SIGMETRICS Perform. Evaluation Rev. 41(4): 47-49 (2014) - [i1]Jonatha Anselmi, Bruno Gaujal, Tommaso Nesti:
Control of parallel non-observable queues: asymptotic equivalence and optimality of periodic policies. CoRR abs/1404.4547 (2014) - 2013
- [j9]Jonatha Anselmi, Bernardo D'Auria
Closed Queueing Networks Under Congestion: Nonbottleneck Independence and Bottleneck Convergence. Math. Oper. Res. 38(3): 469-491 (2013) - [j8]Jonatha Anselmi, Giuliano Casale
Heavy-traffic revenue maximization in parallel multiclass queues. Perform. Evaluation 70(10): 806-821 (2013) - 2011
- [j7]Jonatha Anselmi, Urtzi Ayesta, Adam Wierman:
Competition yields efficiency in load balancing games. Perform. Evaluation 68(11): 986-1001 (2011) - [j6]Jonatha Anselmi, Ina Maria Verloop:
Energy-aware capacity scaling in virtualized environments with performance guarantees. Perform. Evaluation 68(11): 1207-1221 (2011) - [j5]Jonatha Anselmi, Bruno Gaujal:
The price of forgetting in parallel and non-observable queues. Perform. Evaluation 68(12): 1291-1311 (2011) - [j4]Jonatha Anselmi, Bruno Gaujal:
On the efficiency of perfect simulation in monotone queueing networks. SIGMETRICS Perform. Evaluation Rev. 39(2): 56-58 (2011) - 2010
- [j3]Jonatha Anselmi, Paolo Cremonesi
A unified framework for the bottleneck analysis of multiclass queueing networks. Perform. Evaluation 67(4): 218-234 (2010) - [c10]Jonatha Anselmi, Bruno Gaujal:
The price of anarchy in parallel queues revisited. SIGMETRICS 2010: 353-354 - [c9]Jonatha Anselmi, Bruno Gaujal:
Optimal routing in parallel, non-observable queues and the price of anarchy revisited. ITC 2010: 1-8
2000 – 2009
- 2009
- [j2]Jonatha Anselmi, Yingdong Lu
Improved approximations for the Erlang loss model. Queueing Syst. Theory Appl. 63(1-4): 217-239 (2009) - [j1]Jonatha Anselmi, Yingdong Lu
Improved Approximations for Stochastic Loss Networks. SIGMETRICS Perform. Evaluation Rev. 37(2): 45-47 (2009) - [c8]Jonatha Anselmi, Bruno Gaujal:
Performance Evaluation of Work Stealing for Streaming Applications. OPODIS 2009: 18-32 - [c7]Jonatha Anselmi, Paolo Cremonesi
On the Consolidation of Data-Centers with Performance Constraints. QoSA 2009: 163-176 - 2008
- [c6]Jonatha Anselmi, Paolo Cremonesi
Exact Asymptotic Analysis of Closed BCMP Networks with a Common Bottleneck. ASMTA 2008: 206-220 - [c5]Jonatha Anselmi, Paolo Cremonesi:
Bounding the Performance of BCMP Networks with Load-Dependent Stations. MASCOTS 2008: 171-178 - [c4]Jonatha Anselmi, Edoardo Amaldi, Paolo Cremonesi
Service Consolidation with End-to-End Response Time Constraints. EUROMICRO-SEAA 2008: 345-352 - [c3]Jonatha Anselmi:
A new framework supporting the bottleneck analysis of multiclass queueing networks. VALUETOOLS 2008: 51 - 2007
- [c2]Jonatha Anselmi, Danilo Ardagna
A QoS-based selection approach of autonomic grid services. SOCP@HPDC 2007: 1-8 - [c1]Jonatha Anselmi, Giuliano Casale, Paolo Cremonesi
Approximate Solution of Multiclass Queuing Networks with Region Constraints. MASCOTS 2007: 225-230
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-01 00:18 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: