## 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.

## The algorithms implemented in ScaLAPACK are scalable in this sense.

Previous slide | Next slide | Back to first slide | View graphic version |