Minimizing Weighted Mean Completion Time for Malleable Tasks Scheduling

Malleable tasks are jobs that can be scheduled with preemptions on a varying number of resources. We focus on the special case of work-preserving malleable tasks, for which the area of the allocated resources does not depend on the allocation and is equal to the sequential processing time. Moreover, we assume that the number of resources allocated to each task at each time instant is limited. We consider both the clairvoyant and non-clairvoyant cases, and we focus on minimizing the weighted sum of completion times. In the weighted non-clairvoyant case, we propose an approximation algorithm whose ratio (2) is the same as in the unweighted non-clairvoyant case. In the clairvoyant case, we provide a normal form for the schedule of such malleable tasks, and prove that any valid schedule can be turned into this normal form, based only on the completion times of the tasks. We show that in these normal form schedules, the number of preemptions per task is bounded by 3 on average. At last, we analyze the performance of list schedules, and prove that optimal schedules are list schedules for a special case of homogeneous instances. We conjecture that there exists an optimal list schedule for all instances, which would greatly simplify the study of this problem. Finally, we explore the complexity of the problem restricted to homogeneous instances, which is still open despite its very simple expression.

[1]  Raghupathy Sivakumar,et al.  Enhancing TCP for networks with guaranteed bandwidth services , 2003, GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489).

[2]  Maciej Drozdowski,et al.  New applications of the Muntz and Coffman algorithm , 2001 .

[3]  Olivier Beaumont,et al.  On the importance of bandwidth control mechanisms for scheduling on large scale heterogeneous platforms , 2010, 2010 IEEE International Symposium on Parallel & Distributed Processing (IPDPS).

[4]  Wayne E. Smith.  Various optimizers for single‐stage production , 1956 .

[5]  Michel Mandjes,et al.  A versatile model for TCP bandwidth sharing in networks with heterogeneous users , 2004 .

[6]  Ruslan Sadykov,et al.  On scheduling malleable jobs to minimise the total weighted completion time , 2009 .

[7]  Jae-Hoon Kim,et al.  Non-clairvoyant scheduling for weighted flow time , 2003, Inf. Process. Lett..

[8]  Xiaotie Deng,et al.  Preemptive Scheduling of Parallel Jobs on Multiprocessors , 1996, SIAM J. Comput..

[9]  Uwe Schwiegelshohn,et al.  An alternative proof of the Kawaguchi-Kyan bound for the Largest-Ratio-First rule , 2011, Oper. Res. Lett..

[10]  Allen B. Downey,et al.  TCP self-clocking and bandwidth sharing , 2007, Comput. Networks.

[11]  Evripidis Bampis,et al.  Approximation schemes for minimizing average weighted completion time with release dates , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

[12]  Pangfeng Liu,et al.  Data-bandwidth-aware Job Scheduling in Grid and Cluster Environments , 2009, 2009 15th International Conference on Parallel and Distributed Systems.

[13]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[14]  Seiki Kyan,et al.  Worst Case Bound of an LRF Schedule for the Mean Weighted Flow-Time Problem , 1986, SIAM J. Comput..

[15]  Robert McNaughton,et al.  Scheduling with Deadlines and Loss Functions , 1959 .

[16]  Pierre-François Dutot,et al.  Scheduling Parallel Tasks Approximation Algorithms , 2004, Handbook of Scheduling.

[17]  Jacek Blazewicz,et al.  Preemptable malleable task scheduling problem , 2006, IEEE Transactions on Computers.

[18]  Maciej Drozdowski.  Scheduling Parallel Tasks , 2004, Handbook of Scheduling.