<?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 I use the example in mkl in Intel® oneAPI Math Kernel Library</title>
    <link>https://community.intel.com/t5/Intel-oneAPI-Math-Kernel-Library/cluster-sparse-solver-cause-segmentation-fault-in-mkl-11-3/m-p/1042822#M20816</link>
    <description>&lt;P&gt;I use the example in mkl examples, that is mkl/examples/examples_cluster.tgz and then extract it and then use cluster_sparse_solverc/source/cl_solver_unsym_c.c as the source code&lt;/P&gt;

&lt;P&gt;I use the following command to run it&lt;/P&gt;

&lt;P&gt;export MV2_DEBUG_SHOW_BACKTRACE=1&lt;/P&gt;

&lt;P&gt;export MV2_DEBUG_CORESIZE=unlimited&lt;/P&gt;

&lt;P&gt;mpiexec -n 2 ./a.out&lt;/P&gt;

&lt;P&gt;print out:&lt;/P&gt;

&lt;P&gt;=== CPARDISO: solving a real nonsymmetric system ===&lt;BR /&gt;
	1-based array indexing is turned ON&lt;BR /&gt;
	CPARDISO double precision computation is turned ON&lt;BR /&gt;
	METIS algorithm at reorder step is turned ON&lt;BR /&gt;
	Scaling is turned ON&lt;BR /&gt;
	Matching is turned ON&lt;/P&gt;

&lt;P&gt;&lt;BR /&gt;
	Summary: ( reordering phase )&lt;BR /&gt;
	================&lt;/P&gt;

&lt;P&gt;Times:&lt;BR /&gt;
	======&lt;BR /&gt;
	Time spent in calculations of symmetric matrix portrait (fulladj): 0.000024 s&lt;BR /&gt;
	Time spent in reordering of the initial matrix (reorder)&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; : 0.000355 s&lt;BR /&gt;
	Time spent in symbolic factorization (symbfct)&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; : 0.000255 s&lt;BR /&gt;
	Time spent in data preparations for factorization (parlist)&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; : 0.000010 s&lt;BR /&gt;
	Time spent in allocation of internal data structures (malloc)&amp;nbsp;&amp;nbsp;&amp;nbsp; : 0.000415 s&lt;BR /&gt;
	Time spent in additional calculations&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; : 0.000037 s&lt;BR /&gt;
	Total time spent&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; : 0.001096 s&lt;/P&gt;

&lt;P&gt;Statistics:&lt;BR /&gt;
	===========&lt;BR /&gt;
	Parallel Direct Factorization is running on 2 MPI and 1 OpenMP per MPI process&lt;/P&gt;

&lt;P&gt;&amp;lt; Linear system Ax = b &amp;gt;&lt;BR /&gt;
	&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; number of equations:&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; 5&lt;BR /&gt;
	&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; number of non-zeros in A:&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; 13&lt;BR /&gt;
	&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; number of non-zeros in A (%): 52.000000&lt;/P&gt;

&lt;P&gt;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; number of right-hand sides:&amp;nbsp;&amp;nbsp;&amp;nbsp; 1&lt;/P&gt;

&lt;P&gt;&amp;lt; Factors L and U &amp;gt;&lt;BR /&gt;
	&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; number of columns for each panel: 128&lt;BR /&gt;
	&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; number of independent subgraphs:&amp;nbsp; 0&lt;BR /&gt;
	&amp;lt; Preprocessing with state of the art partitioning metis&amp;gt;&lt;BR /&gt;
	&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; number of supernodes:&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; 2&lt;BR /&gt;
	&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; size of largest supernode:&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; 4&lt;BR /&gt;
	&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; number of non-zeros in L:&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; 19&lt;BR /&gt;
	&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; number of non-zeros in U:&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; 2&lt;BR /&gt;
	&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; number of non-zeros in L+U:&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; 21&lt;/P&gt;

&lt;P&gt;Reordering completed ... [compute-1-1.local:mpi_rank_0][error_sighandler] Caught error: Segmentation fault (signal 11)&lt;BR /&gt;
	[compute-1-1.local:mpi_rank_0][print_backtrace]&amp;nbsp;&amp;nbsp; 0: /lustre/work/prog/mvapich2-2.0b-composer/lib/libmpich.so.10(print_backtrace+0x17) [0x2aabf5e0cfe7]&lt;BR /&gt;
	[compute-1-1.local:mpi_rank_0][print_backtrace]&amp;nbsp;&amp;nbsp; 1: /lustre/work/prog/mvapich2-2.0b-composer/lib/libmpich.so.10(error_sighandler+0x5a) [0x2aabf5e0cfca]&lt;BR /&gt;
	[compute-1-1.local:mpi_rank_0][print_backtrace]&amp;nbsp;&amp;nbsp; 2: /lib64/libc.so.6() [0x36b8e32920]&lt;/P&gt;

&lt;P&gt;===================================================================================&lt;BR /&gt;
	=&amp;nbsp;&amp;nbsp; BAD TERMINATION OF ONE OF YOUR APPLICATION PROCESSES&lt;BR /&gt;
	=&amp;nbsp;&amp;nbsp; EXIT CODE: 139&lt;BR /&gt;
	=&amp;nbsp;&amp;nbsp; CLEANING UP REMAINING PROCESSES&lt;BR /&gt;
	=&amp;nbsp;&amp;nbsp; YOU CAN IGNORE THE BELOW CLEANUP MESSAGES&lt;BR /&gt;
	===================================================================================&lt;BR /&gt;
	YOUR APPLICATION TERMINATED WITH THE EXIT STRING: Segmentation fault (signal 11)&lt;BR /&gt;
	This typically refers to a problem with your application.&lt;BR /&gt;
	Please see the FAQ page for debugging suggestions&lt;/P&gt;

&lt;P&gt;&lt;BR /&gt;
	that means it just finish phase 1, but phase 2 cause segmentation fault.&lt;/P&gt;

&lt;P&gt;&amp;nbsp;&lt;/P&gt;</description>
    <pubDate>Thu, 24 Sep 2015 19:40:37 GMT</pubDate>
    <dc:creator>Chaowen_G_</dc:creator>
    <dc:date>2015-09-24T19:40:37Z</dc:date>
    <item>
      <title>cluster_sparse_solver cause segmentation fault in mkl 11.3</title>
      <link>https://community.intel.com/t5/Intel-oneAPI-Math-Kernel-Library/cluster-sparse-solver-cause-segmentation-fault-in-mkl-11-3/m-p/1042819#M20813</link>
      <description>&lt;P&gt;Hi:&lt;/P&gt;

&lt;P&gt;&amp;nbsp;&amp;nbsp; My environment: linux64, mpicxx for MVAPICH2 version 2.0b, icpc version 13.1.3 (gcc version 4.7.0 compatibility). In order not to confuse with the mkl library in icpc version 13.1.3, I put the mkl 11.3 in /home/intel.&lt;/P&gt;

&lt;P&gt;&amp;nbsp;&amp;nbsp; I use the following command:&lt;/P&gt;

&lt;P&gt;&lt;BR /&gt;
	mpic++ cluster_sparse_solverc/source/cl_solver_unsym_c.c -Wl,-rpath=/home/intel/mkl/lib/intel64 -Wl,-rpath=/home/intel/compiler/lib/intel64 -L/home/intel/mkl/lib/intel64 -L/home/intel/compiler/lib/intel64 -lmkl_intel_lp64 -lmkl_core -lmkl_intel_thread -lmkl_blacs_intelmpi_lp64 -liomp5&lt;/P&gt;

&lt;P&gt;to compile and cause segmentation fault.&amp;nbsp; But in mkl 11.2.4, it is totally correct. So is it a bug in mkl 11.3?&lt;/P&gt;

&lt;P&gt;&amp;nbsp;&lt;/P&gt;</description>
      <pubDate>Wed, 23 Sep 2015 19:08:21 GMT</pubDate>
      <guid>https://community.intel.com/t5/Intel-oneAPI-Math-Kernel-Library/cluster-sparse-solver-cause-segmentation-fault-in-mkl-11-3/m-p/1042819#M20813</guid>
      <dc:creator>Chaowen_G_</dc:creator>
      <dc:date>2015-09-23T19:08:21Z</dc:date>
    </item>
    <item>
      <title>Hi,</title>
      <link>https://community.intel.com/t5/Intel-oneAPI-Math-Kernel-Library/cluster-sparse-solver-cause-segmentation-fault-in-mkl-11-3/m-p/1042820#M20814</link>
      <description>&lt;P&gt;Hi,&lt;BR /&gt;
	&lt;BR /&gt;
	Can you please provide us a reproducer for your case, so that we can investigate it more carefully?&lt;BR /&gt;
	&lt;BR /&gt;
	Best regards,&lt;BR /&gt;
	Maria.&lt;/P&gt;</description>
      <pubDate>Thu, 24 Sep 2015 04:59:55 GMT</pubDate>
      <guid>https://community.intel.com/t5/Intel-oneAPI-Math-Kernel-Library/cluster-sparse-solver-cause-segmentation-fault-in-mkl-11-3/m-p/1042820#M20814</guid>
      <dc:creator>MariaZh</dc:creator>
      <dc:date>2015-09-24T04:59:55Z</dc:date>
    </item>
    <item>
      <title>Chaowen, thanks for the case,</title>
      <link>https://community.intel.com/t5/Intel-oneAPI-Math-Kernel-Library/cluster-sparse-solver-cause-segmentation-fault-in-mkl-11-3/m-p/1042821#M20815</link>
      <description>&lt;P&gt;Chaowen, thanks for the case, we will check and let you know the results, I only see you use MPICH beta and pretty aged version of compiler, We validated and &amp;nbsp;check this functionality with the latest version of icc.&amp;nbsp;&lt;/P&gt;</description>
      <pubDate>Thu, 24 Sep 2015 05:51:00 GMT</pubDate>
      <guid>https://community.intel.com/t5/Intel-oneAPI-Math-Kernel-Library/cluster-sparse-solver-cause-segmentation-fault-in-mkl-11-3/m-p/1042821#M20815</guid>
      <dc:creator>Gennady_F_Intel</dc:creator>
      <dc:date>2015-09-24T05:51:00Z</dc:date>
    </item>
    <item>
      <title>I use the example in mkl</title>
      <link>https://community.intel.com/t5/Intel-oneAPI-Math-Kernel-Library/cluster-sparse-solver-cause-segmentation-fault-in-mkl-11-3/m-p/1042822#M20816</link>
      <description>&lt;P&gt;I use the example in mkl examples, that is mkl/examples/examples_cluster.tgz and then extract it and then use cluster_sparse_solverc/source/cl_solver_unsym_c.c as the source code&lt;/P&gt;

&lt;P&gt;I use the following command to run it&lt;/P&gt;

&lt;P&gt;export MV2_DEBUG_SHOW_BACKTRACE=1&lt;/P&gt;

&lt;P&gt;export MV2_DEBUG_CORESIZE=unlimited&lt;/P&gt;

&lt;P&gt;mpiexec -n 2 ./a.out&lt;/P&gt;

&lt;P&gt;print out:&lt;/P&gt;

&lt;P&gt;=== CPARDISO: solving a real nonsymmetric system ===&lt;BR /&gt;
	1-based array indexing is turned ON&lt;BR /&gt;
	CPARDISO double precision computation is turned ON&lt;BR /&gt;
	METIS algorithm at reorder step is turned ON&lt;BR /&gt;
	Scaling is turned ON&lt;BR /&gt;
	Matching is turned ON&lt;/P&gt;

&lt;P&gt;&lt;BR /&gt;
	Summary: ( reordering phase )&lt;BR /&gt;
	================&lt;/P&gt;

&lt;P&gt;Times:&lt;BR /&gt;
	======&lt;BR /&gt;
	Time spent in calculations of symmetric matrix portrait (fulladj): 0.000024 s&lt;BR /&gt;
	Time spent in reordering of the initial matrix (reorder)&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; : 0.000355 s&lt;BR /&gt;
	Time spent in symbolic factorization (symbfct)&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; : 0.000255 s&lt;BR /&gt;
	Time spent in data preparations for factorization (parlist)&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; : 0.000010 s&lt;BR /&gt;
	Time spent in allocation of internal data structures (malloc)&amp;nbsp;&amp;nbsp;&amp;nbsp; : 0.000415 s&lt;BR /&gt;
	Time spent in additional calculations&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; : 0.000037 s&lt;BR /&gt;
	Total time spent&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; : 0.001096 s&lt;/P&gt;

&lt;P&gt;Statistics:&lt;BR /&gt;
	===========&lt;BR /&gt;
	Parallel Direct Factorization is running on 2 MPI and 1 OpenMP per MPI process&lt;/P&gt;

&lt;P&gt;&amp;lt; Linear system Ax = b &amp;gt;&lt;BR /&gt;
	&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; number of equations:&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; 5&lt;BR /&gt;
	&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; number of non-zeros in A:&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; 13&lt;BR /&gt;
	&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; number of non-zeros in A (%): 52.000000&lt;/P&gt;

&lt;P&gt;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; number of right-hand sides:&amp;nbsp;&amp;nbsp;&amp;nbsp; 1&lt;/P&gt;

&lt;P&gt;&amp;lt; Factors L and U &amp;gt;&lt;BR /&gt;
	&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; number of columns for each panel: 128&lt;BR /&gt;
	&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; number of independent subgraphs:&amp;nbsp; 0&lt;BR /&gt;
	&amp;lt; Preprocessing with state of the art partitioning metis&amp;gt;&lt;BR /&gt;
	&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; number of supernodes:&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; 2&lt;BR /&gt;
	&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; size of largest supernode:&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; 4&lt;BR /&gt;
	&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; number of non-zeros in L:&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; 19&lt;BR /&gt;
	&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; number of non-zeros in U:&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; 2&lt;BR /&gt;
	&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; number of non-zeros in L+U:&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; 21&lt;/P&gt;

&lt;P&gt;Reordering completed ... [compute-1-1.local:mpi_rank_0][error_sighandler] Caught error: Segmentation fault (signal 11)&lt;BR /&gt;
	[compute-1-1.local:mpi_rank_0][print_backtrace]&amp;nbsp;&amp;nbsp; 0: /lustre/work/prog/mvapich2-2.0b-composer/lib/libmpich.so.10(print_backtrace+0x17) [0x2aabf5e0cfe7]&lt;BR /&gt;
	[compute-1-1.local:mpi_rank_0][print_backtrace]&amp;nbsp;&amp;nbsp; 1: /lustre/work/prog/mvapich2-2.0b-composer/lib/libmpich.so.10(error_sighandler+0x5a) [0x2aabf5e0cfca]&lt;BR /&gt;
	[compute-1-1.local:mpi_rank_0][print_backtrace]&amp;nbsp;&amp;nbsp; 2: /lib64/libc.so.6() [0x36b8e32920]&lt;/P&gt;

&lt;P&gt;===================================================================================&lt;BR /&gt;
	=&amp;nbsp;&amp;nbsp; BAD TERMINATION OF ONE OF YOUR APPLICATION PROCESSES&lt;BR /&gt;
	=&amp;nbsp;&amp;nbsp; EXIT CODE: 139&lt;BR /&gt;
	=&amp;nbsp;&amp;nbsp; CLEANING UP REMAINING PROCESSES&lt;BR /&gt;
	=&amp;nbsp;&amp;nbsp; YOU CAN IGNORE THE BELOW CLEANUP MESSAGES&lt;BR /&gt;
	===================================================================================&lt;BR /&gt;
	YOUR APPLICATION TERMINATED WITH THE EXIT STRING: Segmentation fault (signal 11)&lt;BR /&gt;
	This typically refers to a problem with your application.&lt;BR /&gt;
	Please see the FAQ page for debugging suggestions&lt;/P&gt;

&lt;P&gt;&lt;BR /&gt;
	that means it just finish phase 1, but phase 2 cause segmentation fault.&lt;/P&gt;

&lt;P&gt;&amp;nbsp;&lt;/P&gt;</description>
      <pubDate>Thu, 24 Sep 2015 19:40:37 GMT</pubDate>
      <guid>https://community.intel.com/t5/Intel-oneAPI-Math-Kernel-Library/cluster-sparse-solver-cause-segmentation-fault-in-mkl-11-3/m-p/1042822#M20816</guid>
      <dc:creator>Chaowen_G_</dc:creator>
      <dc:date>2015-09-24T19:40:37Z</dc:date>
    </item>
    <item>
      <title>Chaowen, I checked how this</title>
      <link>https://community.intel.com/t5/Intel-oneAPI-Math-Kernel-Library/cluster-sparse-solver-cause-segmentation-fault-in-mkl-11-3/m-p/1042823#M20817</link>
      <description>&lt;P&gt;&lt;SPAN style="font-size: 12px; line-height: 14.4px;"&gt;Chaowen, I checked how this example works when I used Intel MPI instead of&amp;nbsp;MVAPICH2 ( which,&amp;nbsp;&lt;/SPAN&gt;&lt;SPAN style="font-size: 12px; line-height: 14.4px;"&gt;actually, officially is not supported by MKL - You may find the list of suppored versions of MPI into RN) .T&lt;/SPAN&gt;&lt;SPAN style="font-size: 12px; line-height: 14.4px;"&gt;he test passed and the obtained results were corrected.&amp;nbsp;&lt;/SPAN&gt;&lt;/P&gt;</description>
      <pubDate>Mon, 28 Sep 2015 07:18:27 GMT</pubDate>
      <guid>https://community.intel.com/t5/Intel-oneAPI-Math-Kernel-Library/cluster-sparse-solver-cause-segmentation-fault-in-mkl-11-3/m-p/1042823#M20817</guid>
      <dc:creator>Gennady_F_Intel</dc:creator>
      <dc:date>2015-09-28T07:18:27Z</dc:date>
    </item>
  </channel>
</rss>

