1 citations · 1 across the 6 of their papers we have counts for
7 papers
Performance of Load Balancers with Bounded Maximum Queue Length in case of Non-Exponential Job Sizes
Tim Hellemans, Grzegorz Kielanski, Benny Van Houdt
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 wh…
Download time analysis for distributed storage systems with node failures
Tim Hellemans, Arti Yardi, Tejas Bodas
We consider a distributed storage system which stores several hot (popular) and cold (less popular) data files across multiple nodes or servers. Hot files are stored using repetiti…
Improved Load Balancing in Large Scale Systems using Attained Service Time Reporting
Tim Hellemans, Benny Van Houdt
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 typ…
Mean Waiting Time in Large-Scale and Critically Loaded Power of d Load Balancing Systems
Tim Hellemans, Benny Van Houdt
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 cas…
Performance Analysis of Load Balancing Policies with Memory
Tim Hellemans, Benny Van Houdt
Joining the shortest or least loaded queue among randomly selected queues are two fundamental load balancing policies. Under both policies the dispatcher does not maintain any…
On the Power-of-d-choices with Least Loaded Server Selection
Tim Hellemans, Benny Van Houdt
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 t…