Stochastic Scheduling of Heavy-tailed Jobs
نویسندگان
چکیده
We revisit the classical stochastic scheduling problem of nonpreemptively scheduling n jobs so as to minimize total completion time on m identical machines, P || E ∑ Cj in the standard 3field scheduling notation. Previously it was only known how to obtain reasonable approximation if jobs sizes have low variability. However, distributions commonly arising in practice have high variability, and the upper bounds on the approximation ratio for the previous algorithms for such distributions can be even inverse-polynomial in the maximum possible job size. We start by showing that the natural list scheduling algorithm Shortest Expected Processing Time (SEPT) has a bad approximation ratio for high variability jobs. We observe that a simple randomized rounding of a natural linear programming relaxation is a (1 + )-machine O(1)approximation assuming the number of machines is at least logarithmic in the number of jobs. Turning to the case of a modest number of machines, we develop a list scheduling algorithm that is O(log2 n+m logn)-approximate. Our results together imply a (1 + )-machine O(log2 n)approximation for an arbitrary number of machines. Intuitively our list scheduling algorithm finds an ordering that not only takes the expected size of a job into account, but also takes into account the probability that job will be big. 1998 ACM Subject Classification F.2.2 Nonnumerical Algorithms and Problems; Sequencing and scheduling
منابع مشابه
Heavy-Tailed Limits for Medium-Size Jobs with Popular Sched- ulers
The service requirements in modern information networks are frequently very large and typically characterized by heavy-tailed distributions. Hence, assigning a server exclusively to these possibly very large jobs indiscriminately of their sizes, e.g., using first come first served scheduling discipline, is not desirable since large jobs may cause unacceptably large delays for smaller ones. Ther...
متن کاملComparison of PS, SRPT, and FB Scheduling Policies under Exponential and Heavy Tail Job Sizes
We present numerical analysis that campares the performances of PS, SRPT , and FB scheduling polcies in terms of their conditional mean response times in an M/G/1 model, where G represents an exponential job size distribution or a job size distribution with highly varying sizes such as heavy tailed distribution. The results show that for heavy tailed job size distribution, FB offers mean slowdo...
متن کاملHeavy-Tailed Limits for Medium Size Jobs and Comparison Scheduling
We study the conditional sojourn time distributions of processor sharing (PS), foreground background processor sharing (FBPS) and shortest remaining processing time first (SRPT) scheduling disciplines on an event where the job size of a customer arriving in stationarity is smaller than exactly k ≥ 0 out of the preceding m ≥ k arrivals. Then, conditioning on the preceding event, the sojourn time...
متن کاملSystems with multiple servers under heavy-tailed workloads
The heavy-tailed nature of Internet flow sizes, web pages and computer files can cause non-preemptive scheduling policies to have a large average response time. Since there are numerous communication and distributed processing systems where preempting jobs can be quite expensive, reducing response times under this constraint is a pressing issue. One proposal for tackling non-preemption is throu...
متن کاملMaximizing service level in a β-robust job shop scheduling model
In the realm of scheduling problems, different sources of uncertainty such as probabilistic durations of jobs or stochastic breakdowns of machines can arise. Given this, one highly desirable characteristic of an intelligent schedule is to bring better punctuality with less efficiency-loss because a dominant factor in customer appreciation is punctuality. It is also one of the most intangible to...
متن کامل