Minimizing Weighted lp-Norm of Flow-Time in the Rejection Model

We consider the online scheduling problem to minimize the weighted ell_p-norm of flow-time of jobs. We study this problem under the rejection model introduced by Choudhury et al. (SODA 2015) - here the online algorithm is allowed to not serve an eps-fraction of the requests. We consider the restricted assignments setting where each job can go to a specified subset of machines. Our main result is an immediate dispatch non-migratory 1/eps^{O(1)}-competitive algorithm for this problem when one is allowed to reject at most eps-fraction of the total weight of jobs arriving. This is in contrast with the speed augmentation model under which no online algorithm for this problem can achieve a competitive ratio independent of p.

[1]  V. N. Muralidhara,et al.  A competitive algorithm for minimizing weighted flow time on unrelatedmachines with speed augmentation , 2009, STOC '09.

[2]  Amit Kumar,et al.  Resource augmentation for weighted flow-time explained by dual fitting , 2012, SODA.

[3]  Amit Kumar,et al.  Minimizing Maximum (Weighted) Flow-Time on Related and Unrelated Machines , 2015, Algorithmica.

[4]  Lap-Kei Lee,et al.  Non-clairvoyant weighted flow time scheduling with rejection penalty , 2012, SPAA '12.

[5]  Bala Kalyanasundaram,et al.  Speed is as powerful as clairvoyance , 2000, JACM.

[6]  Yossi Azar,et al.  Minimizing total flow time and total completion time with immediate dispatching , 2003, SPAA.

[7]  Amit Kumar,et al.  All-Norms and All-L_p-Norms Approximation Algorithms , 2008, FSTTCS.

[8]  Nikhil Bansal,et al.  Algorithms for flow time scheduling , 2003 .

[9]  Stefano Leonardi,et al.  Approximating total flow time on parallel machines , 2007, J. Comput. Syst. Sci..

[10]  Amit Kumar,et al.  Rejecting jobs to minimize load and maximum flow-time , 2014, J. Comput. Syst. Sci..

[11]  Kirk Pruhs,et al.  Server scheduling in the Lp norm: a rising tide lifts all boat , 2003, STOC '03.

[12]  Amit Kumar,et al.  Better Algorithms for Minimizing Average Flow-Time on Related Machines , 2006, ICALP.

[13]  Monaldo Mastrolilli,et al.  On-line scheduling to minimize max flow time: an optimal preemptive algorithm , 2005, Oper. Res. Lett..

[14]  Ashish Goel,et al.  Multi-processor scheduling to minimize flow time with ε resource augmentation , 2004, STOC '04.

[15]  Nikhil Bansal,et al.  Scheduling for Flow-Time with Admission Control , 2003, ESA.

[16]  Amit Kumar,et al.  Minimizing Average Flow-time : Upper and Lower Bounds , 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).

[17]  Yossi Azar,et al.  The competitiveness of on-line assignments , 1992, SODA '92.

[18]  Leah Epstein,et al.  Preemptive online scheduling with rejection of unit jobs on two uniformly related machines , 2014, J. Sched..

[19]  Benjamin Moseley,et al.  An online scalable algorithm for minimizing lk-norms of weighted flow time on unrelated machines , 2011, SODA '11.

[20]  Leen Stougie,et al.  Multiprocessor scheduling with rejection , 1996, SODA '96.