Algorithms for hierarchical and semi-partitioned parallel scheduling

Abstract We propose a model for scheduling jobs in a parallel machine setting that takes into account the cost of migrations by assuming that the processing time of a job may depend on the specific set of machines among which the job is migrated. For the makespan minimization objective, the model generalizes classical scheduling problems such as unrelated parallel machine scheduling, as well as novel ones such as semi-partitioned and clustered scheduling. In the case of a hierarchical family of machines, we derive a compact integer linear programming (ILP) formulation for the job assignment subproblem, and show how to turn arbitrary ILP solutions into valid schedules. We also derive a polynomial-time 2-approximation algorithm for the problem. Extensions that incorporate memory capacity constraints are also discussed.

[1]  Georg Hager,et al.  Hybrid MPI/OpenMP Parallel Programming on Clusters of Multi-Core SMP Nodes , 2009, 2009 17th Euromicro International Conference on Parallel, Distributed and Network-based Processing.

[2]  Alexander Schrijver,et al.  Combinatorial optimization. Polyhedra and efficiency. , 2003 .

[3]  James H. Anderson,et al.  An Empirical Comparison of Global, Partitioned, and Clustered Multiprocessor EDF Schedulers , 2010, 2010 31st IEEE Real-Time Systems Symposium.

[4]  Sanjoy K. Baruah,et al.  Federated Scheduling of Sporadic DAG Task Systems , 2015, 2015 IEEE International Parallel and Distributed Processing Symposium.

[5]  Anand Sivasubramaniam,et al.  An Integrated Approach to Parallel Scheduling Using Gang-Scheduling, Backfilling, and Migration , 2001, IEEE Trans. Parallel Distributed Syst..

[6]  David B. Shmoys,et al.  Using dual approximation algorithms for scheduling problems: Theoretical and practical results , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[7]  Frank D. Anger,et al.  Scheduling Precedence Graphs in Systems with Interprocessor Communication Times , 1989, SIAM J. Comput..

[8]  Manuel Prieto,et al.  Survey of scheduling techniques for addressing shared resources in multicore processors , 2012, CSUR.

[9]  James H. Anderson,et al.  Is Semi-Partitioned Scheduling Practical? , 2011, 2011 23rd Euromicro Conference on Real-Time Systems.

[10]  Klaus Jansen,et al.  Structural Parameters for Scheduling with Assignment Restrictions , 2017, CIAC.

[11]  José R. Correa,et al.  The Power of Preemption on Unrelated Machines and Applications to Scheduling Orders , 2012, Math. Oper. Res..

[12]  Donald F. Towsley,et al.  The effectiveness of affinity-based scheduling in multiprocessor network protocol processing (extended version) , 1996, TNET.

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

[14]  Alberto Marchetti-Spaccamela,et al.  Assigning sporadic tasks to unrelated machines , 2015, Math. Program..

[15]  Gianlorenzo D'Angelo,et al.  Multiprocessor Real-Time Scheduling with Hierarchical Processor Affinities , 2016, 2016 28th Euromicro Conference on Real-Time Systems (ECRTS).

[16]  Guy E. Blelloch,et al.  Scheduling irregular parallel computations on hierarchical caches , 2011, SPAA '11.

[17]  Éva Tardos,et al.  An approximation algorithm for the generalized assignment problem , 1993, Math. Program..

[18]  Kamal Jain.  A Factor 2 Approximation Algorithm for the Generalized Steiner Network Problem , 2001, Comb..

[19]  Eugene L. Lawler,et al.  On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming , 1978, JACM.

[20]  Evangelos P. Markatos,et al.  Using processor affinity in loop scheduling on shared-memory multiprocessors , 1992, Supercomputing '92.

[21]  Gerhard J. Woeginger,et al.  Parallel machine scheduling with nested job assignment restrictions , 2010, Oper. Res. Lett..

[22]  Jeffrey Scott Vitter,et al.  e-approximations with minimum packing constraint violation (extended abstract) , 1992, STOC '92.

[23]  Richard M. Karp,et al.  Global wire routing in two-dimensional arrays , 1987, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[24]  Chenyang Lu,et al.  Analysis of Federated and Global Scheduling for Parallel Real-Time Tasks , 2014, 2014 26th Euromicro Conference on Real-Time Systems.

[25]  Jan Karel Lenstra,et al.  Approximation algorithms for scheduling unrelated parallel machines , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[26]  Klaus Jansen,et al.  Improved approximation algorithms for scheduling parallel jobs on identical clusters , 2015, Theor. Comput. Sci..

[27]  Celia A. Glass,et al.  Parallel machine scheduling with job assignment restrictions , 2007 .

[28]  Klaus Jansen,et al.  Near-Linear Time Algorithm for n-Fold ILPs via Color Coding , 2020, SIAM J. Discret. Math..