Zobrazeno 1 - 10
of 86
pro vyhledávání: '"Anselmi, Jonatha"'
Autor:
Anselmi, Jonatha, Doncel, Josu
We present a new framework for designing nonpreemptive and job-size oblivious scheduling policies in the multiserver-job queueing model. The main requirement is to identify a static and balanced sub-partition of the server set and ensure that the ser
Externí odkaz:
http://arxiv.org/abs/2409.18557
We present an efficient reinforcement learning algorithm that learns the optimal admission control policy in a partially observable queueing network. Specifically, only the arrival and departure times from the network are observable, and optimality r
Externí odkaz:
http://arxiv.org/abs/2308.02391
Autor:
Anselmi, Jonatha, Doncel, Josu
In the context of decision making under explorable uncertainty, scheduling with testing is a powerful technique used in the management of computer systems to improve performance via better job-dispatching decisions. Upon job arrival, a scheduler may
Externí odkaz:
http://arxiv.org/abs/2304.00899
Publikováno v:
NeurIPS 2022 - 36th Conference on Neural Information Processing Systems, Nov 2022, New Orleans, United States
In this paper, we revisit the regret of undiscounted reinforcement learning in MDPs with a birth and death structure. Specifically, we consider a controlled queue with impatient jobs and the main objective is to optimize a trade-off between energy co
Externí odkaz:
http://arxiv.org/abs/2302.10667
Autor:
Anselmi, Jonatha
We develop a Markovian framework for load balancing that combines classical algorithms such as Power-of-$d$ with auto-scaling mechanisms that allow the net service capacity to scale up or down in response to the current load on the same timescale as
Externí odkaz:
http://arxiv.org/abs/2204.02352
Autor:
Anselmi, Jonatha, Walton, Neil
We provide a queueing-theoretic framework for job replication schemes based on the principle "\emph{replicate a job as soon as the system detects it as a \emph{straggler}}". This is called job \emph{speculation}. Recent works have analyzed {replicati
Externí odkaz:
http://arxiv.org/abs/2104.10426
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Anselmi, Jonatha, Dufour, Francois
In multi-server distributed queueing systems, the access of stochastically arriving jobs to resources is often regulated by a dispatcher, also known as load balancer. A fundamental problem consists in designing a load balancing algorithm that minimiz
Externí odkaz:
http://arxiv.org/abs/1802.06566
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
In Performance Evaluation December 2021 152