Satisfiability modulo theory (SMT) formulation for optimal scheduling of task graphs with communication delay

DOI10.1016/j.cor.2017.08.012zbMath1391.90290OpenAlexW2746591438MaRDI QIDQ1652451

Oliver Sinnen, Avinash Malik, Michael J. O'Sullivan, Cameron G. Walker

Publication date: 11 July 2018

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2017.08.012

zbMATH Keywords

parallel computingSMTMILPtask scheduling with communication delays

Mathematics Subject Classification ID

Mixed integer programming (90C11) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed systems (68M14)

Related Items (2)

Large-scale periodic scheduling in time-sensitive networks ⋮ Optimising makespan and energy consumption in task scheduling for parallel systems

Uses Software

• Gurobi
• z3
• KAAPI
• JaCoP
• StarPU
• GXL

Cites Work

• Unnamed Item
• Reducing the solution space of optimal task scheduling
• Genetic algorithms for task scheduling problem
• Mixed integer linear programming in process scheduling: modeling, algorithms, and applications
• On multiprocessor task scheduling using efficient state space search approaches
• Scheduling for parallel processing
• List scheduling with and without communication delays
• Iterative list scheduling for heterogeneous computing
• Benchmark-problem instances for static scheduling of task graphs with communication delays on homogeneous multiprocessor systems
• Multiprocessor scheduling under precedence constraints: polyhedral results
• Scheduling Precedence Graphs in Systems with Interprocessor Communication Times
• A new formulation for scheduling unrelated processor under precedence constraints
• ON CONSIDERING COMMUNICATION IN SCHEDULING TASK GRAPHS ON PARALLEL PROCESSORS
• A machine program for theorem-proving
• The elements of statistical learning. Data mining, inference, and prediction

This page was built for publication: Satisfiability modulo theory (SMT) formulation for optimal scheduling of task graphs with communication delay