<?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 Threading in Intel® oneAPI Math Kernel Library</title>
    <link>https://community.intel.com/t5/Intel-oneAPI-Math-Kernel-Library/Threading/m-p/906539#M11761</link>
    <description>I am a computer science student and I am intested to see the
performance speed up and scalability of Intel MKL for our algorithm. We
are using Intels woodcrest processor with corresponding bensley
platform, thus having 4 cores available.&lt;BR /&gt;
&lt;BR /&gt;
The algorithm we are looking at is CG , it needs to solve Ax = b , for
500 b's . An obvious way to parallelize over multiple cores is letting
each core solve one Ax=b. I've seen that a CG framework is provided by
MKL and that we just need to fill in the operations.&lt;BR /&gt;
&lt;BR /&gt;
Probably the most important operation in CG is the sparse matrix
vector multiplication. I've read in the Intel MKL documentation that
sparse blas lvl2 also uses OpenMP for threading and I am thus wondering
how this is implemented. Does this function spread the matrix over
different cores and then mtultiply it rowwise? I know it is possible to
thread in the way I want with OpenMP but I am interested to know how
Intel did this.&lt;BR /&gt;
&lt;BR /&gt;
&lt;BR /&gt;</description>
    <pubDate>Wed, 11 Oct 2006 04:24:08 GMT</pubDate>
    <dc:creator>Anonymous62</dc:creator>
    <dc:date>2006-10-11T04:24:08Z</dc:date>
    <item>
      <title>Threading</title>
      <link>https://community.intel.com/t5/Intel-oneAPI-Math-Kernel-Library/Threading/m-p/906539#M11761</link>
      <description>I am a computer science student and I am intested to see the
performance speed up and scalability of Intel MKL for our algorithm. We
are using Intels woodcrest processor with corresponding bensley
platform, thus having 4 cores available.&lt;BR /&gt;
&lt;BR /&gt;
The algorithm we are looking at is CG , it needs to solve Ax = b , for
500 b's . An obvious way to parallelize over multiple cores is letting
each core solve one Ax=b. I've seen that a CG framework is provided by
MKL and that we just need to fill in the operations.&lt;BR /&gt;
&lt;BR /&gt;
Probably the most important operation in CG is the sparse matrix
vector multiplication. I've read in the Intel MKL documentation that
sparse blas lvl2 also uses OpenMP for threading and I am thus wondering
how this is implemented. Does this function spread the matrix over
different cores and then mtultiply it rowwise? I know it is possible to
thread in the way I want with OpenMP but I am interested to know how
Intel did this.&lt;BR /&gt;
&lt;BR /&gt;
&lt;BR /&gt;</description>
      <pubDate>Wed, 11 Oct 2006 04:24:08 GMT</pubDate>
      <guid>https://community.intel.com/t5/Intel-oneAPI-Math-Kernel-Library/Threading/m-p/906539#M11761</guid>
      <dc:creator>Anonymous62</dc:creator>
      <dc:date>2006-10-11T04:24:08Z</dc:date>
    </item>
  </channel>
</rss>

