Extending this further, consider the problem of multiplying two dense matrices of

dimension $4K4K.$ What is the peak achievable performance using a three$-$loop dotproduct

based formulation? $($Assume that matrices are laid out in a row$-$major fashion.$)$

$/*$ matrix$-$matrix product loop $*/$

for $c[i][j]+=a[i][k]***b[k][j]$;