Satisfiability modulo theory (SMT) formulation for optimal scheduling of task graphs with communication delay.
Computers & Operations Research(2018)
摘要
•Proposal of optimal solution approach for the problem of scheduling task graphs with communication delay on homogeneous processors.•Proposal of the first Satisfiability Modulo Theory (SMT) formulation for this scheduling problem.•Comparison with a large number of state-of-the-art MILP formulations for this scheduling problem.•Extensive experimental evaluation using a ca. 1000 task graphs with different parameters and structural characteristics.
更多查看译文
关键词
Parallel computing,Task scheduling with communication delays,SMT,MILP
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络