An Efficient Algorithm for Computing Lower Bounds on Time and Processors for Scheduling Precedence Graphs on Multicomputer Systems.
B. S. PandaSajal K. DasPublished in: HiPC (2001)
Keyphrases
- objective function
- np hard
- lower bound
- learning algorithm
- dynamic programming
- multiprocessor systems
- k means
- optimal solution
- linear programming
- detection algorithm
- matching algorithm
- expectation maximization
- graph isomorphism
- parallel version
- parallel processors
- memory efficient
- lower and upper bounds
- parallel machines
- resource constraints
- spanning tree
- constraint satisfaction problems
- worst case
- upper bound
- scheduling problem