Tim Hellemans
ABSTRACT
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 least workload among d randomly selected servers in large-scale homogeneous clusters.
We consider general job size distributions and propose a partial integro-differential equation to describe the evolution of the system. This equation relies on the earlier proven ansatz for LL(d) which asserts that the workload distribution of any finite set of queues becomes independent of one another as the number of servers tends to infinity. Based on this equation we propose a fixed point iteration for the limiting workload distribution and study its convergence.
- M. Bramson, Y. Lu, and B. Prabhakar. 2012. Asymptotic independence of queues under randomized load balancing. Queueing Syst. 71, 3 (2012), 247--292. Google Scholar
Digital Library
- T. Hellemans and B. Van Houdt. 2018. On the Power-of-d-choices with Least Loaded Server Selection. Proc. ACM Meas. Anal. Comput. Syst. (June 2018). Google ScholarDigital Library
Index Terms
- On the Power-of-d-choices with Least Loaded Server Selection
Recommendations
On the Power-of-d-choices with Least Loaded Server Selection
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 ...
On the Power-of-d-choices with Least Loaded Server Selection
SIGMETRICS '18Motivated 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 ...
Job selection in two-stage shops with ordered machines
We consider job selection problems in shops with ordered machines.We solve the open shop problem in polynomial time.We show that the job shop problem is ordinary NP-hard.We consider the flow shop problem with the total job completion time objective. We ...
Comments