Matrix multiplication performance improvment <p>I have got some unclear questions for the following matrix multiplication algorithm.</p> <p><a href="https://i.stack.imgur.com/oNiQF.png" rel="nofollow noreferrer"><img src="https://i.stack.imgur.com/oNiQF.png" alt="enter image description here"></a></p> <p>1) Why does the inner for-loop (line 6) do not use a “parallel for” construct?</p> <p>2) Can we further improve the performance of the inner loop computation (lines 6-7) by some form of parallelism?</p>