Mathematical Programming-Based Approach to Scheduling of Communicating Tasks

We present a MILP mathematical programming formulation for static scheduling of dependent tasks onto homogeneous multiprocessor system of an arbitrary architecture with communication delays. We reduce the number of constraints by applying a Reduction Constraint reformulation to the model. We solve several small-scale instances of the reformulated problem by using CPLEX 8.1. Upper bounds are computed with the Variable Neighborhood Search meta-heuristic applied directly to the graph-based formulation of the problem, whereas lower bounds are obtained by solving linear relaxations of the MILP formulation, further tightened by using load balancing and critical path method arguments.

[1]  Ishfaq Ahmad,et al.  Benchmarking and Comparison of the Task Graph Scheduling Algorithms , 1999, J. Parallel Distributed Comput..

[2]  Celso C. Ribeiro,et al.  A new formulation for scheduling unrelated processor under precedence constraints , 1999, RAIRO Oper. Res..

[3]  Leo Liberti,et al.  An Exact Reformulation Algorithm for Large Nonconvex NLPs Involving Bilinear Terms , 2006, J. Glob. Optim..

[4]  Hanif D. Sherali,et al.  A new reformulation-linearization technique for bilinear programming problems , 1992, J. Glob. Optim..

[5]  Pierre Hansen,et al.  Variable Neighborhood Search , 2018, Handbook of Heuristics.

[6]  Leo Liberti,et al.  Reduction constraints for the global optimization of NLPs , 2004 .

[7]  Gilbert Christopher Sih,et al.  Multiprocessor scheduling to account for interprocessor communication , 1992 .

[8]  Satish K. Tripathi,et al.  Processor assignment in heterogeneous parallel architectures , 1992, Proceedings Sixth International Parallel Processing Symposium.

[9]  Ishfaq Ahmad,et al.  Efficient Scheduling of Arbitrary TAsk Graphs to Multiprocessors Using a Parallel Genetic Algorithm , 1997, J. Parallel Distributed Comput..

[10]  Harvey M. Wagner,et al.  An integer linear‐programming model for machine scheduling , 1959 .

[11]  Goran Lj. Djordjevic,et al.  A Compile-Time Scheduling Heuristic for Multiprocessor Architectures , 1996, Comput. J..

[12]  Klaus H. Ecker,et al.  Management of Resources in Parallel Systems , 2000, Handbook on Parallel and Distributed Processing.

[13]  TATJANA DAVIDOVIĆ,et al.  Permutation-Based Genetic, Tabu, and Variable Neighborhood Search Heuristics for Multiprocessor Scheduling with Communication delays , 2004, Asia Pac. J. Oper. Res..

[14]  Tatjana Davidovi,et al.  New Benchmarks for Static Task Scheduling on Homogeneous Multiprocessor Systems with Communication Delays , 2003 .

[15]  Edward A. Lee,et al.  A Compile-Time Scheduling Heuristic for Interconnection-Constrained Heterogeneous Processor Architectures , 1993, IEEE Trans. Parallel Distributed Syst..

[16]  Tatjana Davidovi.  EXHAUSTIVE LIST-SCHEDULING HEURISTIC FOR DENSE TASK GRAPHS* , 2000 .

[17]  A. K. Sarje,et al.  Heuristic model for task allocation in distributed computer systems , 1991 .

[18]  E. H. Bowman.  THE SCHEDULE-SEQUENCING PROBLEM* , 1959 .

[19]  Teodor Gabriel Crainic,et al.  Benchmark-problem instances for static scheduling of task graphs with communication delays on homogeneous multiprocessor systems , 2006, Comput. Oper. Res..

[20]  T. C. Hu.  Parallel Sequencing and Assembly Line Problems , 1961 .

[21]  Peter Thanisch,et al.  Assigning dependency graphs onto processor networks , 1991, Parallel Comput..

[22]  Leo Liberti.  Linearity Embedded in Nonconvex Programs , 2005, J. Glob. Optim..