Jonatha Anselmi

Orcid: 0000-0001-5541-5631

According to our database1, Jonatha Anselmi authored at least 42 papers between 2007 and 2025.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2025
Balanced Splitting: A Framework for Achieving Zero-Wait in the Multiserver-Job Model.
IEEE Trans. Parallel Distributed Syst., January, 2025

2024
Learning optimal admission control in partially observable queueing networks.
Queueing Syst. Theory Appl., October, 2024

Asynchronous Load Balancing and Auto-Scaling: Mean-Field Limit and Optimal Design.
IEEE/ACM Trans. Netw., August, 2024

Load Balancing with Job-Size Testing: Performance Improvement or Degradation?
ACM Trans. Model. Perform. Evaluation Comput. Syst., June, 2024

A Stochastic Approach for Scheduling AI Training Jobs in GPU-Based Systems.
IEEE Trans. Cloud Comput., 2024

2022
Stability and Optimization of Speculative Queueing Networks.
IEEE/ACM Trans. Netw., 2022

Replication vs speculation for load balancing.
Queueing Syst. Theory Appl., 2022

Reinforcement Learning in a Birth and Death Process: Breaking the Dependence on the State Space.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Energy Optimal Activation of Processors for the Execution of a Single Task with Unknown Size.
Proceedings of the 30th International Symposium on Modeling, 2022

2021
Optimal speed profile of a DVFS processor under soft deadlines.
Perform. Evaluation, 2021

2020
Combining Size-Based Load Balancing with Round-Robin for Scalable Low Latency.
IEEE Trans. Parallel Distributed Syst., 2020

Power-of-<i>d</i>-Choices with Memory: Fluid Limit and Optimality.
Math. Oper. Res., 2020

2019
Asymptotically Optimal Size-Interval Task Assignments.
IEEE Trans. Parallel Distributed Syst., 2019

2018
Computable approximations for average Markov decision processes in continuous time.
J. Appl. Probab., 2018

Power-of-d-Choices with Memory: Fluid Limit and Optimality.
CoRR, 2018

2017
The Economics of the Cloud.
ACM Trans. Model. Perform. Evaluation Comput. Syst., 2017

Asymptotically optimal open-loop load balancing.
Queueing Syst. Theory Appl., 2017

Piecewise optimal trajectories of observer for bearings-only tracking by quantization.
Proceedings of the 20th International Conference on Information Fusion, 2017

2016
Decentralized Proportional Load Balancing.
SIAM J. Appl. Math., 2016

2014
The economics of the cloud: price competition and congestion.
SIGMETRICS Perform. Evaluation Rev., 2014

Efficiency of simulation in monotone hyper-stable queueing networks.
Queueing Syst. Theory Appl., 2014

Generalized Nash equilibria for SaaS/PaaS Clouds.
Eur. J. Oper. Res., 2014

Control of parallel non-observable queues: asymptotic equivalence and optimality of periodic policies.
CoRR, 2014

2013
Heavy-traffic revenue maximization in parallel multiclass queues.
Perform. Evaluation, 2013

Closed Queueing Networks Under Congestion: Nonbottleneck Independence and Bottleneck Convergence.
Math. Oper. Res., 2013

2011
On the efficiency of perfect simulation in monotone queueing networks.
SIGMETRICS Perform. Evaluation Rev., 2011

Energy-aware capacity scaling in virtualized environments with performance guarantees.
Perform. Evaluation, 2011

The price of forgetting in parallel and non-observable queues.
Perform. Evaluation, 2011

Competition yields efficiency in load balancing games.
Perform. Evaluation, 2011

2010
A unified framework for the bottleneck analysis of multiclass queueing networks.
Perform. Evaluation, 2010

Optimal routing in parallel, non-observable queues and the price of anarchy revisited.
Proceedings of the 22nd International Teletraffic Congress, 2010

The price of anarchy in parallel queues revisited.
Proceedings of the SIGMETRICS 2010, 2010

2009
Improved Approximations for Stochastic Loss Networks.
SIGMETRICS Perform. Evaluation Rev., 2009

Improved approximations for the Erlang loss model.
Queueing Syst. Theory Appl., 2009

On the Consolidation of Data-Centers with Performance Constraints.
Proceedings of the Architectures for Adaptive Software Systems, 2009

Performance Evaluation of Work Stealing for Streaming Applications.
Proceedings of the Principles of Distributed Systems, 13th International Conference, 2009

2008
A new framework supporting the bottleneck analysis of multiclass queueing networks.
Proceedings of the 3rd International ICST Conference on Performance Evaluation Methodologies and Tools, 2008

Service Consolidation with End-to-End Response Time Constraints.
Proceedings of the 34th Euromicro Conference on Software Engineering and Advanced Applications, 2008

Bounding the Performance of BCMP Networks with Load-Dependent Stations.
Proceedings of the 16th International Symposium on Modeling, 2008

Exact Asymptotic Analysis of Closed BCMP Networks with a Common Bottleneck.
Proceedings of the Analytical and Stochastic Modeling Techniques and Applications, 2008

2007
Approximate Solution of Multiclass Queuing Networks with Region Constraints.
Proceedings of the 15th International Symposium on Modeling, 2007

A QoS-based selection approach of autonomic grid services.
Proceedings of the 2007 workshop on Service-oriented computing performance: aspects, 2007


  Loading...