Zobrazeno 1 - 10
of 95
pro vyhledávání: '"Doncel, Josu"'
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
Industrial processes generate a massive amount of monitoring data that can be exploited to uncover hidden time losses in the system, leading to enhanced accuracy of maintenance policies and, consequently, increasing the effectiveness of the equipment
Externí odkaz:
http://arxiv.org/abs/2403.07554
In this paper, we examine the Age of Information (AoI) of a source sending status updates to a monitor through a queue operating under the Processor Sharing (PS) discipline. In the PS queueing discipline, all the updates are served simultaneously and
Externí odkaz:
http://arxiv.org/abs/2309.02083
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
Autor:
Sagastabeitia, Gontzal, Doncel, Josu, Aguilar, José, Fernández Anta, Antonio, Ramírez, Juan Marcos
Publikováno v:
In Expert Systems With Applications 15 December 2024 258
We study the performance of general dynamic matching models. This model is defined by a connected graph, where nodes represent the class of items and the edges the compatibilities between items. Items of different classes arrive one by one to the sys
Externí odkaz:
http://arxiv.org/abs/2009.10009
Autor:
Doncel, Josu, Assaad, Mohamad
The paper deals with Age of Information (AoI) in a network of multiple sources and parallel queues with buffering capabilities, preemption in service and losses in served packets. The queues do not communicate between each other and the packets are d
Externí odkaz:
http://arxiv.org/abs/2002.01696
Publikováno v:
Journal of Dynamics & Games, 2019, pp.1-19
We consider mean field games with discrete state spaces (called discrete mean field games in the following) and we analyze these games in continuous and discrete time, over finite as well as infinite time horizons. We prove the existence of a mean fi
Externí odkaz:
http://arxiv.org/abs/1909.01209
A dynamic bipartite matching model is given by a bipartite matching graph which determines the possible matchings between the various types of supply and demand items. Both supply and demand items arrive to the system according to a stochastic proces
Externí odkaz:
http://arxiv.org/abs/1810.08541
Autor:
Doncel, Josu
Cette thèse porte sur l'efficacité des algorithmes distribués de partage des ressources et des algorithmes de découvert de chemin en ligne. Dans la première partie de la thèse, nous analysons un jeu dans lequel les utilisateurs paient pour util
Externí odkaz:
http://www.theses.fr/2015ISAT0007/document