Matrix Chain Scheduling Problem
The Matrix Chain Scheduling Problem (or MCSP) is an optimization problem where the goal is to find the product sequence for evaluating a chain of matrix products and the processor schedule for the sequence such that the evaluation time is minimized on a parallel system.
Parameters
- : number of processors
- : number of matrices
Insufficient data to display graph
Filters
Computational Model
Randomization
Approximation
Algorithms Table
Insuffient Data to display table
Reductions Table
Insuffient Data to display table
Other relevant algorithms
Insuffient Data to display table