Lower Bounds and Efficient Algorithms for Multiprocessor Scheduling of Directed Acyclic Graphs with Communication Delays
Hermann JungLefteris M. KirousisPaul G. SpirakisPublished in: Inf. Comput. (1993)
Keyphrases
- directed acyclic graph
- communication delays
- lower bound
- np hard
- control theory
- directed networks
- upper bound
- execution times
- precedence relations
- equivalence class
- branch and bound
- branch and bound algorithm
- conditional independence
- directed graph
- structural learning
- equivalence classes
- random variables
- objective function
- lower and upper bounds
- optimal solution
- causal models
- multiprocessor systems
- lagrangian relaxation
- processing times
- approximation algorithms
- linear programming
- worst case
- np complete
- linear systems
- constraint satisfaction problems
- sufficient conditions
- scheduling problem