Satisfiability modulo theory (SMT) formulation for optimal scheduling of task graphs with communication delay (Q1652451)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Satisfiability modulo theory (SMT) formulation for optimal scheduling of task graphs with communication delay |
scientific article; zbMATH DE number 6901503
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Satisfiability modulo theory (SMT) formulation for optimal scheduling of task graphs with communication delay |
scientific article; zbMATH DE number 6901503 |
Statements
Satisfiability modulo theory (SMT) formulation for optimal scheduling of task graphs with communication delay (English)
0 references
11 July 2018
0 references
parallel computing
0 references
task scheduling with communication delays
0 references
SMT
0 references
MILP
0 references
0 references
