Zobrazeno 1 - 10
of 196
pro vyhledávání: '"Van Houdt, Benny"'
Autor:
Charlet, Nils, Van Houdt, Benny
Recently it was shown that the response time of First-Come-First-Served (FCFS) scheduling can be stochastically and asymptotically improved upon by the {\it Nudge} scheduling algorithm in case of light-tailed job size distributions. Such improvements
Externí odkaz:
http://arxiv.org/abs/2403.06588
Autor:
Van Houdt, Benny
Recently it was shown that, contrary to expectations, the First-Come-First-Served (FCFS) scheduling algorithm can be stochastically improved upon by a scheduling algorithm called {\it Nudge} for light-tailed job size distributions. Nudge partitions j
Externí odkaz:
http://arxiv.org/abs/2206.10428
Performance of Load Balancers with Bounded Maximum Queue Length in case of Non-Exponential Job Sizes
In large-scale distributed systems, balancing the load in an efficient way is crucial in order to achieve low latency. Recently, some load balancing policies have been suggested which are able to achieve a bounded maximum queue length in the large-sc
Externí odkaz:
http://arxiv.org/abs/2201.03905
Autor:
Hellemans, Tim, Van Houdt, Benny
Our interest lies in load balancing jobs in large scale systems consisting of multiple dispatchers and FCFS servers. In the absence of any information on job sizes, dispatchers typically use queue length information reported by the servers to assign
Externí odkaz:
http://arxiv.org/abs/2011.08250
Autor:
Hellemans, Tim, Van Houdt, Benny
Mean field models are a popular tool used to analyse load balancing policies. In some cases the waiting time distribution of the mean field limit has an explicit form. In other cases it can be computed as the solution of a set of differential equatio
Externí odkaz:
http://arxiv.org/abs/2004.00876
Autor:
Hellemans, Tim, Van Houdt, Benny
Joining the shortest or least loaded queue among $d$ randomly selected queues are two fundamental load balancing policies. Under both policies the dispatcher does not maintain any information on the queue length or load of the servers. In this paper
Externí odkaz:
http://arxiv.org/abs/2002.06906
Autor:
Van Houdt, Benny
Mean field modeling is a popular approach to assess the performance of large scale computer systems. The evolution of many mean field models is characterized by a set of ordinary differential equations that have a unique fixed point. In order to prov
Externí odkaz:
http://arxiv.org/abs/1811.05239
Autor:
Van Houdt, Benny
Work sharing and work stealing are two scheduling paradigms to redistribute work when performing distributed computations. In work sharing, processors attempt to migrate pending jobs to other processors in the hope of reducing response times. In work
Externí odkaz:
http://arxiv.org/abs/1810.13186
Autor:
Hellemans, Tim, Van Houdt, Benny
Motivated by distributed schedulers that combine the power-of-d-choices with late binding and systems that use replication with cancellation-on-start, we study the performance of the LL(d) policy which assigns a job to a server that currently has the
Externí odkaz:
http://arxiv.org/abs/1802.05420