Scalability

For dense matrix computations, an implementation is said to be scalable if the parallel efficiency is an increasing function of N**2/P, the problem size per node.

For dense matrix computations, an implementation is said to be scalable if the parallel efficiency is an increasing function of N**2/P, the problem size per node.