开发工具

Trial license for Intel parallel studio, cluster edition, Linux

Dear Si/Madam,

We have already started the purchase procedure to get permanent license for intel parallel studio, cluster edition. 

few months back I installed the Trial license in our cluster, which is now expired. 

Now I want to compile one scientific software for my research work. Hence, I request you to provide a trial license for one more month for intel parallel studio cluster edition (2015).

my email id:

 ksenthil@buc.edu.in 

With thanks,

Dr. K. Senthilkumar

parallel task with several parallel stages

I have an algorithm that can be parallelised using the divide-and-conquer approach, but requires more than one parallel stage per task. In other wordsk, a given task can be split into several consecutive stages which cannot be done in parallel, but each stage can potentially be split into several parallel tasks. I have implemented this as sketced below.

Intel 15.0.2 OMP Runtime Error

I received the following error while running a Fortran code in parallel:

OMP: Error #13: Assertion failure at kmp_runtime.c(1592).

OMP: Hint: Please submit a bug report with this message, compiler and run commands used, and machine configuration info including native compiler and operating system versions. Faster response will be obtained by including all program sources. For information on submitting this issue, please see http://www.intel.com/software/product/support/.

Inplace permutation

Hello,

I need to permute a vector according to an index array jpvt returned by ?geqp3.  In the example lapack/source/dgeqpfx.f it is done using an auxiliary array. I would like to do the transformation inplace (or at least with O(1) extra memory), but as you can see from the attached source code, I don’t seem to be able to use ?laswp correctly. Can this be used for this kind of transformation ? If yes, how ? If no, is there another way to do this ?

Thank you in advance.

 

Do I need Pardiso_64? iparm(18) reports negative value

I am attempting to solve a large complex, symmetric matrix using PARDISO.  The matrix has approximately 1,000,000 equations, and 91,000,000 non-zeros.  I suspect that during Pardiso's factorization stage, the number of non-zeroes in the factors exceed the 32-bit integer size limit (i.e. 2^31).  I suspect this because pardiso returns a very large negative number for iparm(18), after the factorization stage.

So ... here's the questions.

ifort 15: Internal compiler error

ifort -c -coarray cgca_m1co.f90

ifort -c -coarray -debug full -free -fPIC -warn all  cgca_m2stat.f90
cgca_m2stat.f90: catastrophic error: **Internal compiler error: segmentation violation signal raised** Please report this error along with the circumstances in which it occurred in a Software Problem Report.  Note: File and line given may not be explicit cause of this error.
compilation aborted for cgca_m2stat.f90 (code 1)
make: *** [cgca_m2stat.o] Error 1

ifort --version
ifort (IFORT) 15.0.0 20140723

the files:

Application Shutdown on call to DftiCreateDescriptor for Intel MKL c++

Hello all, 

I have built a C++plugin to that employs MKL's fft libraries for filtering purposes. This plugin is used by a C++ compute system that generates data on demand by any other application. This compute system is used by a C# application. When I request data of my plugin, I can debug up to my DftiCreateDescriptor call only for my application to shut down on execution of said call.

The following is the output generated:

订阅 开发工具