<?xml version="1.0" encoding="UTF-8"?>
<rss xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:taxo="http://purl.org/rss/1.0/modules/taxonomy/" version="2.0">
  <channel>
    <title>topic Re: matrix multiplication in Intel® Moderncode for Parallel Architectures</title>
    <link>https://community.intel.com/t5/Intel-Moderncode-for-Parallel/matrix-multiplication/m-p/889936#M3744</link>
    <description>hello sir,&lt;BR /&gt; its advisable to use as many no. of software threads as there are hardware threads..&lt;BR /&gt;since your machine has only 2 hardware threads, its more than enough to use 2 threads..&lt;BR /&gt;Also, we can see a significant increase in performance only in the case of bigger programs or applications.. So dont get confused if the parallel run time is higher for ur multiplication.. &lt;BR /&gt;</description>
    <pubDate>Thu, 22 Nov 2007 12:40:55 GMT</pubDate>
    <dc:creator>ashoksaravanan</dc:creator>
    <dc:date>2007-11-22T12:40:55Z</dc:date>
    <item>
      <title>matrix multiplication</title>
      <link>https://community.intel.com/t5/Intel-Moderncode-for-Parallel/matrix-multiplication/m-p/889934#M3742</link>
      <description>I am a newbie in thread programming, so sorry if my following question sounds stupid. I made a single threaded routine that multiplies two 5x5 matrices. I made another routine, 25 threaded, multiplying the pairs mat_1(line_i) x mat_2(column_j) for the same two matrices (I have a dual core processor). Why the multi-threaded routine is slower than the first one ? Is this true or have I made something wrong ?</description>
      <pubDate>Wed, 21 Nov 2007 16:16:50 GMT</pubDate>
      <guid>https://community.intel.com/t5/Intel-Moderncode-for-Parallel/matrix-multiplication/m-p/889934#M3742</guid>
      <dc:creator>rdabra</dc:creator>
      <dc:date>2007-11-21T16:16:50Z</dc:date>
    </item>
    <item>
      <title>Re: matrix multiplication</title>
      <link>https://community.intel.com/t5/Intel-Moderncode-for-Parallel/matrix-multiplication/m-p/889935#M3743</link>
      <description>A short answer: the problem is too small to overcome the overhead of threading. Probably too small to time accurately, if you did it efficiently without threading. If you test a professionally written function, such as DGEMM from Intel MKL library, you will see that it drops to a single thread for problems of this size.&lt;BR /&gt;</description>
      <pubDate>Wed, 21 Nov 2007 16:57:44 GMT</pubDate>
      <guid>https://community.intel.com/t5/Intel-Moderncode-for-Parallel/matrix-multiplication/m-p/889935#M3743</guid>
      <dc:creator>TimP</dc:creator>
      <dc:date>2007-11-21T16:57:44Z</dc:date>
    </item>
    <item>
      <title>Re: matrix multiplication</title>
      <link>https://community.intel.com/t5/Intel-Moderncode-for-Parallel/matrix-multiplication/m-p/889936#M3744</link>
      <description>hello sir,&lt;BR /&gt; its advisable to use as many no. of software threads as there are hardware threads..&lt;BR /&gt;since your machine has only 2 hardware threads, its more than enough to use 2 threads..&lt;BR /&gt;Also, we can see a significant increase in performance only in the case of bigger programs or applications.. So dont get confused if the parallel run time is higher for ur multiplication.. &lt;BR /&gt;</description>
      <pubDate>Thu, 22 Nov 2007 12:40:55 GMT</pubDate>
      <guid>https://community.intel.com/t5/Intel-Moderncode-for-Parallel/matrix-multiplication/m-p/889936#M3744</guid>
      <dc:creator>ashoksaravanan</dc:creator>
      <dc:date>2007-11-22T12:40:55Z</dc:date>
    </item>
  </channel>
</rss>

