Non-Asymptotic Performance Analysis of Size-Based Routing Policies

by   E. Bachmat, et al.

We investigate the performance of two size-based routing policies: the Size Interval Task Assignment (SITA) and Task Assignment based on Guessing Size (TAGS). We consider a system with two servers and Bounded Pareto distributed job sizes with tail parameter 1 where the difference between the size of the largest and the smallest job is finite. We show that the ratio between the mean waiting time of TAGS over the mean waiting time of SITA is unbounded when the largest job size is large and the arrival rate times the largest job size is less than one. We provide numerical experiments that show that our theoretical findings extend to Bounded Pareto distributed job sizes with tail parameter different to 1.


page 1

page 2

page 3

page 4


When Does the Gittins Policy Have Asymptotically Optimal Response Time Tail?

We consider scheduling in the M/G/1 queue with unknown job sizes. It is ...

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 w...

Uniform Bounds for Scheduling with Job Size Estimates

We consider the problem of scheduling to minimize mean response time in ...

Scheduling With Inexact Job Sizes: The Merits of Shortest Processing Time First

It is well known that size-based scheduling policies, which take into ac...

Performance Analysis of Modified SRPT in Multiple-Processor Multitask Scheduling

In this paper we study the multiple-processor multitask scheduling probl...

Fork-join and redundancy systems with heavy-tailed job sizes

We investigate the tail asymptotics of the response time distribution fo...

Energy-Efficient Job-Assignment Policy with Asymptotically Guaranteed Performance Deviation

We study a job-assignment problem in a large-scale server farm system wi...

Please sign up or login with your details

Forgot password? Click here to reset