title: Efficient SSE NxN matrix multiplication
body: <p>I'm trying to implement <code>SSE</code> version of large matrix by matrix multiplication.
   I'm looking for an efficient algorithm based on <code>SIMD</code> implementations.</p>
  
  <p>My desired method looks like:</p>
  
  <pre><code>A(n x m) * B(m x k) = C(n x k)
  </code></pre>
  
  <p>And all matrices are considered to be 16-byte aligned float array.</p>
  
  <p>I searched the net and found some articles describing 8x8 multiplication and even smaller. I really need it as efficient as possible and I don't want to use <code>Eigen</code> library or similar libraries. (Only <code>SSE3</code> to be more specific).</p>
  
  <p>So I'd appreciate if anyone can help me find some articles or resources on how to start implementing this.</p>