Lower Bounds on Precedence-Constrained Scheduling for Parallel Processors.
Ivan D. BaevWaleed MeleisAlexandre E. EichenbergerPublished in: ICPP (2000)
Keyphrases
- parallel processors
- lower bound
- precedence constraints
- branch and bound algorithm
- upper bound
- single processor
- branch and bound
- np hard
- objective function
- search problems
- scheduling problem
- lower and upper bounds
- contract algorithms
- vc dimension
- worst case
- constraint satisfaction
- resource allocation
- orders of magnitude
- search space
- min cost
- learning algorithm