Parallelizable

Although this process might sound slow, it is very cache-local and highly parallelizable due to the lack of register dependencies and therefore in fact has excellent performance on modern out-of-order execution CPUs.

For relatively small values of k, the Viterbi algorithm is universally used as it provides maximum likelihood performance and is highly parallelizable.

For this reason parallel computing is relevant only for a low number of processors and very parallelizable programs.

In practice, as more computing resources become available, they tend to get used on larger problems (larger datasets), and the time spent in the parallelizable part often grows much faster than the inherently serial work.

Iterative algorithms are generally parallelizable.

What one may add to this scenario is that such a transition may require a torsion in order to make S3 (or other Bianchi cosmological models) parallelizable.