A decomposition-based constraint optimization approach for statically scheduling task graphs with communication delays to multiprocessors.
Nadathur SatishKaushik RavindranKurt KeutzerPublished in: DATE (2007)
Keyphrases
- communication delays
- constraint optimization
- precedence relations
- control theory
- execution times
- multiprocessor systems
- np hard
- constraint satisfaction problems
- constraint networks
- branch and bound search
- constraint programming
- processing times
- constraint satisfaction
- distributed memory
- resource constrained project scheduling problem
- precedence constraints
- dynamical systems
- search algorithm
- shared memory
- parallel implementation
- constraint propagation
- flowshop
- approximation algorithms
- closed loop
- branch and bound
- scheduling problem
- special case
- computational complexity
- optimal solution