<?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 PARDISO unsymmetric only using 1 processor in Intel® oneAPI Math Kernel Library</title>
    <link>https://community.intel.com/t5/Intel-oneAPI-Math-Kernel-Library/PARDISO-unsymmetric-only-using-1-processor/m-p/816002#M4305</link>
    <description>I downloaded 10.3. However, install.sh tells me 10.3 is already installed. I have only 10.2 installed. Why does install.sh tell me 10.3? I assume I need uninstall 10.2 anyway, right?&lt;BR /&gt;&lt;BR /&gt;Initializing, please wait...&lt;BR /&gt;--------------------------------------------------------------------------------&lt;BR /&gt;The Intel Math Kernel Library 10.3 Update 1 for Linux* is already installed.&lt;BR /&gt;&lt;BR /&gt;If you want to reinstall the Intel Math Kernel Library 10.3 Update 1 for&lt;BR /&gt;Linux*&lt;BR /&gt;please uninstall current version and run install script again.&lt;BR /&gt;--------------------------------------------------------------------------------&lt;BR /&gt;Press "Enter" key to quit:&lt;BR /&gt;&lt;BR /&gt;</description>
    <pubDate>Thu, 27 Jan 2011 17:44:05 GMT</pubDate>
    <dc:creator>xian-zhong_guous_cd-</dc:creator>
    <dc:date>2011-01-27T17:44:05Z</dc:date>
    <item>
      <title>PARDISO unsymmetric only using 1 processor</title>
      <link>https://community.intel.com/t5/Intel-oneAPI-Math-Kernel-Library/PARDISO-unsymmetric-only-using-1-processor/m-p/815998#M4301</link>
      <description>I have a SPD matrix. If I solve it as SPD (type=2), PARDISO uses 8 processors. But if I solve it as unsymmetric, PARDISO only uses 1 processor. (both logs are enclosed)&lt;BR /&gt;&lt;BR /&gt;&lt;B&gt;Symmetric log&lt;/B&gt;:&lt;BR /&gt;&lt;META http-equiv="CONTENT-TYPE" content="text/html; charset=utf-8" /&gt;
	&lt;TITLE&gt;&lt;/TITLE&gt;
	&lt;META name="GENERATOR" content="OpenOffice.org 3.2  (Unix)" /&gt;
	&lt;STYLE type="text/css"&gt;&amp;lt;!--
		@page { margin: 0.79in }
		P { margin-bottom: 0.08in }
--&amp;gt;&lt;/STYLE&gt;

&lt;P&gt;N=119433&lt;/P&gt;
&lt;P&gt;ooc_max_core_size        got by Env = 
20000&lt;/P&gt;
&lt;P&gt;The file ./pardiso_ooc.cfg was not
opened&lt;/P&gt;
&lt;P&gt;&lt;/P&gt;
&lt;P&gt;=== PARDISO is running in In-Core mode,
because iparam(60)=1 and there is enough RAM for In-Core ===&lt;/P&gt;
&lt;P&gt;&lt;/P&gt;
&lt;P&gt;&lt;/P&gt;
&lt;P&gt;================  PARDISO: solving a
symm. posit. def. system  ================&lt;/P&gt;
&lt;P&gt;&lt;/P&gt;
&lt;P&gt;&lt;/P&gt;
&lt;P&gt;Summary PARDISO: ( reorder to reorder )&lt;/P&gt;
&lt;P&gt;================&lt;/P&gt;
&lt;P&gt;&lt;/P&gt;
&lt;P&gt;Times:&lt;/P&gt;
&lt;P&gt;======&lt;/P&gt;
&lt;P&gt;      Time fulladj: 0.014256 s&lt;/P&gt;
&lt;P&gt;      Time reorder: 0.927871 s&lt;/P&gt;
&lt;P&gt;      Time symbfct: 0.102223 s&lt;/P&gt;
&lt;P&gt;      Time parlist: 0.013512 s&lt;/P&gt;
&lt;P&gt;      Time malloc : 0.018803 s&lt;/P&gt;
&lt;P&gt;      Time total  : 1.149216 s total -
sum: 0.072551 s&lt;/P&gt;
&lt;P&gt;&lt;/P&gt;
&lt;P&gt;Statistics:&lt;/P&gt;
&lt;P&gt;===========&lt;/P&gt;
&lt;P&gt; &amp;lt; Parallel Direct Factorization
with #processors: &amp;gt;         8&lt;/P&gt;
&lt;P&gt; &amp;lt; Numerical Factorization with
BLAS3 and O(n) synchronization &amp;gt;&lt;/P&gt;
&lt;P&gt;&lt;/P&gt;
&lt;P&gt; &amp;lt; Linear system Ax = b&amp;gt;
&lt;TRANSPOSE&gt; 
&lt;/TRANSPOSE&gt;&lt;/P&gt;
&lt;P&gt;             #equations:               
                     119433&lt;/P&gt;
&lt;P&gt;             #non-zeros in A:          
                     821520&lt;/P&gt;
&lt;P&gt;             non-zeros in A (%):       
                    0.005759&lt;/P&gt;
&lt;P&gt;&lt;/P&gt;
&lt;P&gt;             #right-hand sides:        
                     1&lt;/P&gt;
&lt;P&gt;&lt;/P&gt;
&lt;P&gt; &amp;lt; Factors L and U &amp;gt; 
&lt;/P&gt;
&lt;P&gt;             #columns for each panel:  
                     64&lt;/P&gt;
&lt;P&gt;             #independent subgraphs:   
                     0&lt;/P&gt;
&lt;P&gt; &amp;lt; Preprocessing with state of the
art partitioning metis&amp;gt;&lt;/P&gt;
&lt;P&gt;             #supernodes:              
                     55725&lt;/P&gt;
&lt;P&gt;             size of largest supernode:
                     605&lt;/P&gt;
&lt;P&gt;             number of nonzeros in L   
                   14908033&lt;/P&gt;
&lt;P&gt;             number of nonzeros in U   
                   1&lt;/P&gt;
&lt;P&gt;             number of nonzeros in L+U 
                   14908034&lt;/P&gt;
&lt;P&gt; Percentage of computed non-zeros for
LL^T factorization&lt;/P&gt;
&lt;P&gt; 0 %  1 %  2 %  3 %  5 %  6 %  7 %  8 %
 10 %  11 %  12 %  13 %  14 %  15 %  16 %  17 %  18 %  19 %  20 %  23
%  24 %  25 %  26 %  27 %  29 %  30 %  31 %  32 %  35 %  36 %  37 % 
39 %  40 %  41 %  42 %  44 %  45 %  46 %  47 %  48 %  50 %  51 %  52
%  53 %  54 %  56 %  58 %  59 %  60 %  61 %  62 %  64 %  65 %  66 % 
67 %  68 %  69 %  72 %  74 %  75 %  76 %  77 %  79 %  80 %  81 %  83
%  84 %  85 %  86 %  87 %  88 %  89 %  90 %  91 %  92 %  93 %  95 % 
98 %  99 %  100 %  
&lt;/P&gt;
&lt;P&gt;&lt;/P&gt;
&lt;P&gt;================  PARDISO: solving a
symm. posit. def. system  ================&lt;/P&gt;
&lt;P&gt;&lt;/P&gt;
&lt;P&gt;&lt;/P&gt;
&lt;P&gt;Summary PARDISO: ( factorize to
factorize )&lt;/P&gt;
&lt;P&gt;================&lt;/P&gt;
&lt;P&gt;&lt;/P&gt;
&lt;P&gt;Times:&lt;/P&gt;
&lt;P&gt;======&lt;/P&gt;
&lt;P&gt;      Time A to LU: 0.000000 s&lt;/P&gt;
&lt;P&gt;      Time numfct : 0.330881 s&lt;/P&gt;
&lt;P&gt;      Time malloc : 0.000040 s&lt;/P&gt;
&lt;P&gt;      Time total  : 0.330968 s total -
sum: 0.000047 s&lt;/P&gt;
&lt;P&gt;&lt;/P&gt;
&lt;P&gt;Statistics:&lt;/P&gt;
&lt;P&gt;===========&lt;/P&gt;
&lt;P&gt; &amp;lt; Parallel Direct Factorization
with #processors: &amp;gt;         8&lt;/P&gt;
&lt;P&gt; &amp;lt; Numerical Factorization with
BLAS3 and O(n) synchronization &amp;gt;&lt;/P&gt;
&lt;P&gt;&lt;/P&gt;
&lt;P&gt; &amp;lt; Linear system Ax = b&amp;gt;
&lt;TRANSPOSE&gt; 
&lt;/TRANSPOSE&gt;&lt;/P&gt;
&lt;P&gt;             #equations:               
                     119433&lt;/P&gt;
&lt;P&gt;             #non-zeros in A:          
                     821520&lt;/P&gt;
&lt;P&gt;             non-zeros in A (%):       
                    0.005759&lt;/P&gt;
&lt;P&gt;&lt;/P&gt;
&lt;P&gt;             #right-hand sides:        
                     1&lt;/P&gt;
&lt;P&gt;&lt;/P&gt;
&lt;P&gt; &amp;lt; Factors L and U &amp;gt; 
&lt;/P&gt;
&lt;P&gt;             #columns for each panel:  
                     64&lt;/P&gt;
&lt;P&gt;             #independent subgraphs:   
                     0&lt;/P&gt;
&lt;P&gt; &amp;lt; Preprocessing with state of the
art partitioning metis&amp;gt;&lt;/P&gt;
&lt;P&gt;             #supernodes:              
                     55725&lt;/P&gt;
&lt;P&gt;             size of largest supernode:
                     605&lt;/P&gt;
&lt;P&gt;             number of nonzeros in L   
                   14908033&lt;/P&gt;
&lt;P&gt;             number of nonzeros in U   
                   1&lt;/P&gt;
&lt;P&gt;             number of nonzeros in L+U 
                   14908034&lt;/P&gt;
&lt;P&gt;             gflop   for the numerical
factorization:        5.261862&lt;/P&gt;
&lt;P&gt;&lt;/P&gt;
&lt;P&gt;             gflop/s for the numerical
factorization:        15.902588&lt;/P&gt;
&lt;P&gt;&lt;/P&gt;
&lt;P&gt;&lt;/P&gt;
&lt;P&gt;================  PARDISO: solving a
symm. posit. def. system  ================&lt;/P&gt;
&lt;P&gt;&lt;/P&gt;
&lt;P&gt;&lt;/P&gt;
&lt;P&gt;Summary PARDISO: ( solve to solve )&lt;/P&gt;
&lt;P&gt;================&lt;/P&gt;
&lt;P&gt;&lt;/P&gt;
&lt;P&gt;Times:&lt;/P&gt;
&lt;P&gt;======&lt;/P&gt;
&lt;P&gt;      Time solve  : 0.106138 s&lt;/P&gt;
&lt;P&gt;      Time total  : 0.332094 s total -
sum: 0.225956 s&lt;/P&gt;
&lt;P&gt;&lt;/P&gt;
&lt;P&gt;Statistics:&lt;/P&gt;
&lt;P&gt;===========&lt;/P&gt;
&lt;P&gt; &amp;lt; Parallel Direct Factorization
with #processors: &amp;gt;         8&lt;/P&gt;
&lt;P&gt; &amp;lt; Numerical Factorization with
BLAS3 and O(n) synchronization &amp;gt;&lt;/P&gt;
&lt;P&gt;&lt;/P&gt;
&lt;P&gt; &amp;lt; Linear system Ax = b&amp;gt;
&lt;TRANSPOSE&gt; 
&lt;/TRANSPOSE&gt;&lt;/P&gt;
&lt;P&gt;             #equations:               
                     119433&lt;/P&gt;
&lt;P&gt;             #non-zeros in A:          
                     821520&lt;/P&gt;
&lt;P&gt;             non-zeros in A (%):       
                    0.005759&lt;/P&gt;
&lt;P&gt;&lt;/P&gt;
&lt;P&gt;             #right-hand sides:        
                     1&lt;/P&gt;
&lt;P&gt;&lt;/P&gt;
&lt;P&gt; &amp;lt; Factors L and U &amp;gt; 
&lt;/P&gt;
&lt;P&gt;             #columns for each panel:  
                     64&lt;/P&gt;
&lt;P&gt;             #independent subgraphs:   
                     0&lt;/P&gt;
&lt;P&gt; &amp;lt; Preprocessing with state of the
art partitioning metis&amp;gt;&lt;/P&gt;
&lt;P&gt;             #supernodes:              
                     55725&lt;/P&gt;
&lt;P&gt;             size of largest supernode:
                     605&lt;/P&gt;
&lt;P&gt;             number of nonzeros in L   
                   14908033&lt;/P&gt;
&lt;P&gt;             number of nonzeros in U   
                   1&lt;/P&gt;
&lt;P&gt;             number of nonzeros in L+U 
                   14908034&lt;/P&gt;
&lt;P&gt;             gflop   for the numerical
factorization:        5.261862&lt;/P&gt;
&lt;P&gt;&lt;/P&gt;
&lt;P&gt;             gflop/s for the numerical
factorization:        15.902588&lt;/P&gt;&lt;P&gt;&lt;/P&gt;&lt;P&gt;&lt;B&gt;Unsymmetric log&lt;/B&gt;:&lt;/P&gt;&lt;META http-equiv="CONTENT-TYPE" content="text/html; charset=utf-8" /&gt;
	&lt;TITLE&gt;&lt;/TITLE&gt;
	&lt;META name="GENERATOR" content="OpenOffice.org 3.2  (Unix)" /&gt;
	&lt;STYLE type="text/css"&gt;&amp;lt;!--
		@page { margin: 0.79in }
		P { margin-bottom: 0.08in }
--&amp;gt;&lt;/STYLE&gt;

&lt;P&gt;N=119433&lt;/P&gt;
&lt;P&gt;ooc_max_core_size        got by Env = 
20000&lt;/P&gt;
&lt;P&gt;The file ./pardiso_ooc.cfg was not
opened&lt;/P&gt;
&lt;P&gt;&lt;/P&gt;
&lt;P&gt;=== PARDISO is running in In-Core mode,
because iparam(60)=1 and there is enough RAM for In-Core ===&lt;/P&gt;
&lt;P&gt;&lt;/P&gt;
&lt;P&gt;&lt;/P&gt;
&lt;P&gt;================  PARDISO: solving a
real nonsymmetric system  ================&lt;/P&gt;
&lt;P&gt;&lt;/P&gt;
&lt;P&gt;&lt;/P&gt;
&lt;P&gt;Summary PARDISO: ( reorder to reorder )&lt;/P&gt;
&lt;P&gt;================&lt;/P&gt;
&lt;P&gt;&lt;/P&gt;
&lt;P&gt;Times:&lt;/P&gt;
&lt;P&gt;======&lt;/P&gt;
&lt;P&gt;      Time fulladj: 0.054908 s&lt;/P&gt;
&lt;P&gt;      Time reorder: 0.915838 s&lt;/P&gt;
&lt;P&gt;      Time symbfct: 0.106507 s&lt;/P&gt;
&lt;P&gt;      Time malloc : 0.153521 s&lt;/P&gt;
&lt;P&gt;      Time total  : 1.374198 s total -
sum: 0.143423 s&lt;/P&gt;
&lt;P&gt;&lt;/P&gt;
&lt;P&gt;Statistics:&lt;/P&gt;
&lt;P&gt;===========&lt;/P&gt;
&lt;P&gt; &amp;lt; Parallel Direct Factorization
with #processors: &amp;gt;         1&lt;/P&gt;
&lt;P&gt; &amp;lt; Numerical Factorization with
Level-3 BLAS performance &amp;gt;&lt;/P&gt;
&lt;P&gt;&lt;/P&gt;
&lt;P&gt; &amp;lt; Linear system Ax = b&amp;gt;
&lt;TRANSPOSE&gt; 
&lt;/TRANSPOSE&gt;&lt;/P&gt;
&lt;P&gt;             #equations:               
                     119433&lt;/P&gt;
&lt;P&gt;             #non-zeros in A:          
                     1523607&lt;/P&gt;
&lt;P&gt;             non-zeros in A (%):       
                    0.010681&lt;/P&gt;
&lt;P&gt;&lt;/P&gt;
&lt;P&gt;             #right-hand sides:        
                     1&lt;/P&gt;
&lt;P&gt;&lt;/P&gt;
&lt;P&gt; &amp;lt; Factors L and U &amp;gt; 
&lt;/P&gt;
&lt;P&gt;             #columns for each panel:  
                     128&lt;/P&gt;
&lt;P&gt;             #independent subgraphs:   
                     0&lt;/P&gt;
&lt;P&gt; &amp;lt; Preprocessing with state of the
art partitioning metis&amp;gt;&lt;/P&gt;
&lt;P&gt;             #supernodes:              
                     55613&lt;/P&gt;
&lt;P&gt;             size of largest supernode:
                     605&lt;/P&gt;
&lt;P&gt;             number of nonzeros in L   
                   15170945&lt;/P&gt;
&lt;P&gt;             number of nonzeros in U   
                   12859458&lt;/P&gt;
&lt;P&gt;             number of nonzeros in L+U 
                   28030403&lt;/P&gt;
&lt;P&gt; Percentage of computed non-zeros for
LL^T factorization&lt;/P&gt;
&lt;P&gt; 0 %  1 %  2 %  3 %  4 %  5 %  6 %  7 %
 8 %  9 %  10 %  11 %  12 %  13 %  14 %  15 %  16 %  17 %  18 %  19 %
 20 %  21 %  22 %  23 %  24 %  25 %  26 %  27 %  28 %  29 %  30 %  31
%  32 %  33 %  34 %  35 %  36 %  37 %  38 %  39 %  40 %  41 %  42 % 
43 %  44 %  45 %  46 %  47 %  48 %  49 %  50 %  51 %  52 %  53 %  54
%  55 %  56 %  57 %  58 %  59 %  60 %  61 %  62 %  63 %  64 %  65 % 
66 %  67 %  68 %  69 %  70 %  71 %  72 %  73 %  74 %  75 %  76 %  77
%  78 %  79 %  80 %  81 %  82 %  83 %  84 %  85 %  86 %  87 %  88 % 
89 %  90 %  91 %  92 %  93 %  94 %  95 %  96 %  97 %  98 %  99 %  100
%  
&lt;/P&gt;
&lt;P&gt;&lt;/P&gt;
&lt;P&gt;================  PARDISO: solving a
real nonsymmetric system  ================&lt;/P&gt;
&lt;P&gt;&lt;/P&gt;
&lt;P&gt;&lt;/P&gt;
&lt;P&gt;Summary PARDISO: ( factorize to
factorize )&lt;/P&gt;
&lt;P&gt;================&lt;/P&gt;
&lt;P&gt;&lt;/P&gt;
&lt;P&gt;Times:&lt;/P&gt;
&lt;P&gt;======&lt;/P&gt;
&lt;P&gt;      Time A to LU: 0.000000 s&lt;/P&gt;
&lt;P&gt;      Time numfct : 2.065194 s&lt;/P&gt;
&lt;P&gt;      Time malloc : 0.000037 s&lt;/P&gt;
&lt;P&gt;      Time total  : 2.065278 s total -
sum: 0.000047 s&lt;/P&gt;
&lt;P&gt;&lt;/P&gt;
&lt;P&gt;Statistics:&lt;/P&gt;
&lt;P&gt;===========&lt;/P&gt;
&lt;P&gt; &amp;lt; Parallel Direct Factorization
with #processors: &amp;gt;         1&lt;/P&gt;
&lt;P&gt; &amp;lt; Numerical Factorization with
Level-3 BLAS performance &amp;gt;&lt;/P&gt;
&lt;P&gt;&lt;/P&gt;
&lt;P&gt; &amp;lt; Linear system Ax = b&amp;gt;
&lt;TRANSPOSE&gt; 
&lt;/TRANSPOSE&gt;&lt;/P&gt;
&lt;P&gt;             #equations:               
                     119433&lt;/P&gt;
&lt;P&gt;             #non-zeros in A:          
                     1523607&lt;/P&gt;
&lt;P&gt;             non-zeros in A (%):       
                    0.010681&lt;/P&gt;
&lt;P&gt;&lt;/P&gt;
&lt;P&gt;             #right-hand sides:        
                     1&lt;/P&gt;
&lt;P&gt;&lt;/P&gt;
&lt;P&gt; &amp;lt; Factors L and U &amp;gt; 
&lt;/P&gt;
&lt;P&gt;             #columns for each panel:  
                     128&lt;/P&gt;
&lt;P&gt;             #independent subgraphs:   
                     0&lt;/P&gt;
&lt;P&gt; &amp;lt; Preprocessing with state of the
art partitioning metis&amp;gt;&lt;/P&gt;
&lt;P&gt;             #supernodes:              
                     55613&lt;/P&gt;
&lt;P&gt;             size of largest supernode:
                     605&lt;/P&gt;
&lt;P&gt;             number of nonzeros in L   
                   15170945&lt;/P&gt;
&lt;P&gt;             number of nonzeros in U   
                   12859458&lt;/P&gt;
&lt;P&gt;             number of nonzeros in L+U 
                   28030403&lt;/P&gt;
&lt;P&gt;             gflop   for the numerical
factorization:        9.607209&lt;/P&gt;
&lt;P&gt;&lt;/P&gt;
&lt;P&gt;             gflop/s for the numerical
factorization:        4.651965&lt;/P&gt;
&lt;P&gt;&lt;/P&gt;
&lt;P&gt;&lt;/P&gt;
&lt;P&gt;================  PARDISO: solving a
real nonsymmetric system  ================&lt;/P&gt;
&lt;P&gt;&lt;/P&gt;
&lt;P&gt;&lt;/P&gt;
&lt;P&gt;Summary PARDISO: ( solve to solve )&lt;/P&gt;
&lt;P&gt;================&lt;/P&gt;
&lt;P&gt;&lt;/P&gt;
&lt;P&gt;Times:&lt;/P&gt;
&lt;P&gt;======&lt;/P&gt;
&lt;P&gt;      Time solve  : 0.128349 s&lt;/P&gt;
&lt;P&gt;      Time total  : 0.409732 s total -
sum: 0.281383 s&lt;/P&gt;
&lt;P&gt;&lt;/P&gt;
&lt;P&gt;Statistics:&lt;/P&gt;
&lt;P&gt;===========&lt;/P&gt;
&lt;P&gt; &amp;lt; Parallel Direct Factorization
with #processors: &amp;gt;         1&lt;/P&gt;
&lt;P&gt; &amp;lt; Numerical Factorization with
Level-3 BLAS performance &amp;gt;&lt;/P&gt;
&lt;P&gt;&lt;/P&gt;
&lt;P&gt; &amp;lt; Linear system Ax = b&amp;gt;
&lt;TRANSPOSE&gt; 
&lt;/TRANSPOSE&gt;&lt;/P&gt;
&lt;P&gt;             #equations:               
                     119433&lt;/P&gt;
&lt;P&gt;             #non-zeros in A:          
                     1523607&lt;/P&gt;
&lt;P&gt;             non-zeros in A (%):       
                    0.010681&lt;/P&gt;
&lt;P&gt;&lt;/P&gt;
&lt;P&gt;             #right-hand sides:        
                     1&lt;/P&gt;
&lt;P&gt;&lt;/P&gt;
&lt;P&gt; &amp;lt; Factors L and U &amp;gt; 
&lt;/P&gt;
&lt;P&gt;             #columns for each panel:  
                     128&lt;/P&gt;
&lt;P&gt;             #independent subgraphs:   
                     0&lt;/P&gt;
&lt;P&gt; &amp;lt; Preprocessing with state of the
art partitioning metis&amp;gt;&lt;/P&gt;
&lt;P&gt;             #supernodes:              
                     55613&lt;/P&gt;
&lt;P&gt;             size of largest supernode:
                     605&lt;/P&gt;
&lt;P&gt;             number of nonzeros in L   
                   15170945&lt;/P&gt;
&lt;P&gt;             number of nonzeros in U   
                   12859458&lt;/P&gt;
&lt;P&gt;             number of nonzeros in L+U 
                   28030403&lt;/P&gt;
&lt;P&gt;             gflop   for the numerical
factorization:        9.607209&lt;/P&gt;
&lt;P&gt;&lt;/P&gt;
&lt;P&gt;             gflop/s for the numerical
factorization:        4.651965&lt;/P&gt;</description>
      <pubDate>Wed, 26 Jan 2011 23:50:47 GMT</pubDate>
      <guid>https://community.intel.com/t5/Intel-oneAPI-Math-Kernel-Library/PARDISO-unsymmetric-only-using-1-processor/m-p/815998#M4301</guid>
      <dc:creator>xian-zhong_guous_cd-</dc:creator>
      <dc:date>2011-01-26T23:50:47Z</dc:date>
    </item>
    <item>
      <title>PARDISO unsymmetric only using 1 processor</title>
      <link>https://community.intel.com/t5/Intel-oneAPI-Math-Kernel-Library/PARDISO-unsymmetric-only-using-1-processor/m-p/815999#M4302</link>
      <description>Hi,&lt;DIV&gt;&lt;/DIV&gt;&lt;DIV&gt;It seems you're using rather old MKL version where only symmetrical type of matrices was parallelized for OOC case. In fact, latest 10.2 and 10.3 versions support parallelism for all types.&lt;/DIV&gt;&lt;DIV&gt;&lt;/DIV&gt;&lt;DIV&gt;Which version did you use?&lt;/DIV&gt;&lt;DIV&gt;&lt;/DIV&gt;&lt;DIV&gt;Regards,&lt;/DIV&gt;&lt;DIV&gt;Konstantin&lt;/DIV&gt;</description>
      <pubDate>Thu, 27 Jan 2011 05:14:45 GMT</pubDate>
      <guid>https://community.intel.com/t5/Intel-oneAPI-Math-Kernel-Library/PARDISO-unsymmetric-only-using-1-processor/m-p/815999#M4302</guid>
      <dc:creator>Konstantin_A_Intel</dc:creator>
      <dc:date>2011-01-27T05:14:45Z</dc:date>
    </item>
    <item>
      <title>PARDISO unsymmetric only using 1 processor</title>
      <link>https://community.intel.com/t5/Intel-oneAPI-Math-Kernel-Library/PARDISO-unsymmetric-only-using-1-processor/m-p/816000#M4303</link>
      <description>more precisely - see the &lt;A href="http://software.intel.com/en-us/articles/intel-mkl-103-bug-fixes/"&gt;version 10.3 Bug fixes&lt;/A&gt;. The problem was market as &lt;BR /&gt;&lt;BR /&gt;&lt;TABLE cellspacing="0" cellpadding="0" border="0" width="700"&gt;&lt;TBODY&gt;&lt;TR&gt;&lt;TD&gt;DPD200084190&lt;/TD&gt;&lt;TD&gt;PARDISO OOC will now run parallel code for all supported matrix types&lt;/TD&gt;&lt;/TR&gt;&lt;/TBODY&gt;&lt;/TABLE&gt;</description>
      <pubDate>Thu, 27 Jan 2011 06:08:36 GMT</pubDate>
      <guid>https://community.intel.com/t5/Intel-oneAPI-Math-Kernel-Library/PARDISO-unsymmetric-only-using-1-processor/m-p/816000#M4303</guid>
      <dc:creator>Gennady_F_Intel</dc:creator>
      <dc:date>2011-01-27T06:08:36Z</dc:date>
    </item>
    <item>
      <title>PARDISO unsymmetric only using 1 processor</title>
      <link>https://community.intel.com/t5/Intel-oneAPI-Math-Kernel-Library/PARDISO-unsymmetric-only-using-1-processor/m-p/816001#M4304</link>
      <description>&lt;B&gt;Here is the version info:&lt;/B&gt;&lt;BR /&gt;Major version: 10&lt;BR /&gt;Minor version: 2&lt;BR /&gt;Update version: 1&lt;BR /&gt;Product status: Product&lt;BR /&gt;Build: n20090616&lt;BR /&gt;Processor optimization: Intel Core 2 Duo Processor&lt;BR /&gt;&lt;BR /&gt;&lt;B&gt;I tested a smaller problem using in-core and I am still using one processor:&lt;/B&gt;&lt;BR /&gt;&lt;BR /&gt;calling PARDISO:N=52116&lt;BR /&gt;ooc_max_core_size got by Env = 20000&lt;BR /&gt;The file ./pardiso_ooc.cfg was not opened&lt;BR /&gt;&lt;BR /&gt;=== PARDISO is running in In-Core mode, because iparam(60)=1 and there is enough RAM for In-Core ===&lt;BR /&gt;&lt;BR /&gt;&lt;BR /&gt;================ PARDISO: solving a real nonsymmetric system ================&lt;BR /&gt;&lt;BR /&gt;&lt;BR /&gt;Summary PARDISO: ( reorder to reorder )&lt;BR /&gt;================&lt;BR /&gt;&lt;BR /&gt;Times:&lt;BR /&gt;======&lt;BR /&gt; Time fulladj: 0.014744 s&lt;BR /&gt; Time reorder: 0.321509 s&lt;BR /&gt; Time symbfct: 0.047079 s&lt;BR /&gt; Time malloc : 0.057157 s&lt;BR /&gt; Time total : 0.485403 s total - sum: 0.044914 s&lt;BR /&gt;&lt;BR /&gt;Statistics:&lt;BR /&gt;===========&lt;BR /&gt;&amp;lt; Parallel Direct Factorization with #processors: &amp;gt; 1&lt;BR /&gt;&amp;lt; Numerical Factorization with Level-3 BLAS performance &amp;gt;&lt;BR /&gt;&lt;BR /&gt;&amp;lt; Linear system Ax = b&amp;gt; &lt;TRANSPOSE&gt; &lt;BR /&gt; #equations: 52116&lt;BR /&gt; #non-zeros in A: 525292&lt;BR /&gt; non-zeros in A (%): 0.019340&lt;BR /&gt;&lt;BR /&gt; #right-hand sides: 1&lt;BR /&gt;&lt;BR /&gt;&amp;lt; Factors L and U &amp;gt; &lt;BR /&gt; #columns for each panel: 128&lt;BR /&gt; #independent subgraphs: 0&lt;BR /&gt;&amp;lt; Preprocessing with state of the art partitioning metis&amp;gt;&lt;BR /&gt; #supernodes: 26576&lt;BR /&gt; size of largest supernode: 511&lt;BR /&gt; number of nonzeros in L 5768628&lt;BR /&gt; number of nonzeros in U 4786806&lt;BR /&gt; number of nonzeros in L+U 10555434&lt;BR /&gt;Percentage of computed non-zeros for LL^T factorization&lt;BR /&gt;0 % 1 % 2 % 3 % 4 % 5 % 6 % 7 % 8 % 9 % 10 % 11 % 12 % 13 % 14 % 15 % 16 % 17 % 18 % 20 % 21 % 22 % 23 % 24 % 25 % 26 % 27 % 28 % 29 % 30 % 31 % 32 % 33 % 34 % 35 % 36 % 37 % 38 % 39 % 40 % 41 % 42 % 43 % 45 % 46 % 47 % 48 % 49 % 50 % 51 % 52 % 53 % 54 % 55 % 56 % 57 % 58 % 59 % 60 % 61 % 62 % 63 % 64 % 65 % 66 % 67 % 68 % 69 % 71 % 72 % 73 % 74 % 75 % 76 % 77 % 78 % 79 % 80 % 81 % 82 % 84 % 85 % 86 % 87 % 88 % 89 % 90 % 91 % 92 % 93 % 94 % 95 % 96 % 97 % 98 % 99 % 100 % &lt;BR /&gt;&lt;BR /&gt;================ PARDISO: solving a real nonsymmetric system ================&lt;BR /&gt;&lt;BR /&gt;&lt;BR /&gt;Summary PARDISO: ( factorize to factorize )&lt;BR /&gt;================&lt;BR /&gt;&lt;BR /&gt;Times:&lt;BR /&gt;======&lt;BR /&gt; Time A to LU: 0.000000 s&lt;BR /&gt; Time numfct : 0.683435 s&lt;BR /&gt; Time malloc : 0.000474 s&lt;BR /&gt; Time total : 0.683954 s total - sum: 0.000045 s&lt;BR /&gt;&lt;BR /&gt;Statistics:&lt;BR /&gt;===========&lt;BR /&gt;&amp;lt; Parallel Direct Factorization with #processors: &amp;gt; 1&lt;BR /&gt;&amp;lt; Numerical Factorization with Level-3 BLAS performance &amp;gt;&lt;BR /&gt;&lt;BR /&gt;&amp;lt; Linear system Ax = b&amp;gt; &lt;TRANSPOSE&gt; &lt;BR /&gt; #equations: 52116&lt;BR /&gt; #non-zeros in A: 525292&lt;BR /&gt; non-zeros in A (%): 0.019340&lt;BR /&gt;&lt;BR /&gt; #right-hand sides: 1&lt;BR /&gt;&lt;BR /&gt;&amp;lt; Factors L and U &amp;gt; &lt;BR /&gt; #columns for each panel: 128&lt;BR /&gt; #independent subgraphs: 0&lt;BR /&gt;&amp;lt; Preprocessing with state of the art partitioning metis&amp;gt;&lt;BR /&gt; #supernodes: 26576&lt;BR /&gt; size of largest supernode: 511&lt;BR /&gt; number of nonzeros in L 5768628&lt;BR /&gt; number of nonzeros in U 4786806&lt;BR /&gt; number of nonzeros in L+U 10555434&lt;BR /&gt; gflop for the numerical factorization: 2.780741&lt;BR /&gt;&lt;BR /&gt; gflop/s for the numerical factorization: 4.068774&lt;BR /&gt;&lt;BR /&gt;&lt;BR /&gt;================ PARDISO: solving a real nonsymmetric system ================&lt;BR /&gt;&lt;BR /&gt;&lt;BR /&gt;Summary PARDISO: ( solve to solve )&lt;BR /&gt;================&lt;BR /&gt;&lt;BR /&gt;Times:&lt;BR /&gt;======&lt;BR /&gt; Time solve : 0.052398 s&lt;BR /&gt; Time total : 0.159472 s total - sum: 0.107074 s&lt;BR /&gt;&lt;BR /&gt;Statistics:&lt;BR /&gt;===========&lt;BR /&gt;&amp;lt; Parallel Direct Factorization with #processors: &amp;gt; 1&lt;BR /&gt;&amp;lt; Numerical Factorization with Level-3 BLAS performance &amp;gt;&lt;BR /&gt;&lt;BR /&gt;&amp;lt; Linear system Ax = b&amp;gt; &lt;TRANSPOSE&gt; &lt;BR /&gt; #equations: 52116&lt;BR /&gt; #non-zeros in A: 525292&lt;BR /&gt; non-zeros in A (%): 0.019340&lt;BR /&gt;&lt;BR /&gt; #right-hand sides: 1&lt;BR /&gt;&lt;BR /&gt;&amp;lt; Factors L and U &amp;gt; &lt;BR /&gt; #columns for each panel: 128&lt;BR /&gt; #independent subgraphs: 0&lt;BR /&gt;&amp;lt; Preprocessing with state of the art partitioning metis&amp;gt;&lt;BR /&gt; #supernodes: 26576&lt;BR /&gt; size of largest supernode: 511&lt;BR /&gt; number of nonzeros in L 5768628&lt;BR /&gt; number of nonzeros in U 4786806&lt;BR /&gt; number of nonzeros in L+U 10555434&lt;BR /&gt; gflop for the numerical factorization: 2.780741&lt;BR /&gt;&lt;BR /&gt; gflop/s for the numerical factorization: 4.068774&lt;/TRANSPOSE&gt;&lt;/TRANSPOSE&gt;&lt;/TRANSPOSE&gt;</description>
      <pubDate>Thu, 27 Jan 2011 17:14:04 GMT</pubDate>
      <guid>https://community.intel.com/t5/Intel-oneAPI-Math-Kernel-Library/PARDISO-unsymmetric-only-using-1-processor/m-p/816001#M4304</guid>
      <dc:creator>xian-zhong_guous_cd-</dc:creator>
      <dc:date>2011-01-27T17:14:04Z</dc:date>
    </item>
    <item>
      <title>PARDISO unsymmetric only using 1 processor</title>
      <link>https://community.intel.com/t5/Intel-oneAPI-Math-Kernel-Library/PARDISO-unsymmetric-only-using-1-processor/m-p/816002#M4305</link>
      <description>I downloaded 10.3. However, install.sh tells me 10.3 is already installed. I have only 10.2 installed. Why does install.sh tell me 10.3? I assume I need uninstall 10.2 anyway, right?&lt;BR /&gt;&lt;BR /&gt;Initializing, please wait...&lt;BR /&gt;--------------------------------------------------------------------------------&lt;BR /&gt;The Intel Math Kernel Library 10.3 Update 1 for Linux* is already installed.&lt;BR /&gt;&lt;BR /&gt;If you want to reinstall the Intel Math Kernel Library 10.3 Update 1 for&lt;BR /&gt;Linux*&lt;BR /&gt;please uninstall current version and run install script again.&lt;BR /&gt;--------------------------------------------------------------------------------&lt;BR /&gt;Press "Enter" key to quit:&lt;BR /&gt;&lt;BR /&gt;</description>
      <pubDate>Thu, 27 Jan 2011 17:44:05 GMT</pubDate>
      <guid>https://community.intel.com/t5/Intel-oneAPI-Math-Kernel-Library/PARDISO-unsymmetric-only-using-1-processor/m-p/816002#M4305</guid>
      <dc:creator>xian-zhong_guous_cd-</dc:creator>
      <dc:date>2011-01-27T17:44:05Z</dc:date>
    </item>
    <item>
      <title>PARDISO unsymmetric only using 1 processor</title>
      <link>https://community.intel.com/t5/Intel-oneAPI-Math-Kernel-Library/PARDISO-unsymmetric-only-using-1-processor/m-p/816003#M4306</link>
      <description>Is that commercial/evaluation/noncommercial or whatever version of MKL?</description>
      <pubDate>Thu, 27 Jan 2011 18:39:31 GMT</pubDate>
      <guid>https://community.intel.com/t5/Intel-oneAPI-Math-Kernel-Library/PARDISO-unsymmetric-only-using-1-processor/m-p/816003#M4306</guid>
      <dc:creator>Gennady_F_Intel</dc:creator>
      <dc:date>2011-01-27T18:39:31Z</dc:date>
    </item>
    <item>
      <title>PARDISO unsymmetric only using 1 processor</title>
      <link>https://community.intel.com/t5/Intel-oneAPI-Math-Kernel-Library/PARDISO-unsymmetric-only-using-1-processor/m-p/816004#M4307</link>
      <description>After I update MKL to 10.3, issue resolved. Thanks.</description>
      <pubDate>Thu, 27 Jan 2011 19:07:36 GMT</pubDate>
      <guid>https://community.intel.com/t5/Intel-oneAPI-Math-Kernel-Library/PARDISO-unsymmetric-only-using-1-processor/m-p/816004#M4307</guid>
      <dc:creator>xian-zhong_guous_cd-</dc:creator>
      <dc:date>2011-01-27T19:07:36Z</dc:date>
    </item>
  </channel>
</rss>

