Showing results for

- Intel Community
- Software
- Software Development SDKs and Libraries
- Intel® oneAPI Data Analytics Library
- Distributed DAAL vs ScaLAPACK in MKL

- Subscribe to RSS Feed
- Mark Topic as New
- Mark Topic as Read
- Float this Topic for Current User
- Bookmark
- Subscribe
- Mute
- Printer Friendly Page

Andrey_Vladimirov

New Contributor III

- Mark as New
- Bookmark
- Subscribe
- Mute
- Subscribe to RSS Feed
- Permalink
- Email to a Friend
- Report Inappropriate Content

10-27-2015
03:45 PM

96 Views

Distributed DAAL vs ScaLAPACK in MKL

Link Copied

6 Replies

Andrey_N_Intel

Employee

- Mark as New
- Bookmark
- Subscribe
- Mute
- Subscribe to RSS Feed
- Permalink
- Email to a Friend
- Report Inappropriate Content

10-28-2015
02:11 AM

96 Views

Hi Andrey,

Intel(R) Data Analytics Acceleration Library (Intel(R) DAAL) provides the building blocks which can be used on all stages of the data analytics flow, from the data reading till modeling and decision making. Algorithmic component of the library includes the algorithms for data analysis, model training and prediction, in particular, summary statistics, regression and classification algorithms etc. The library provides matrix factorizations as those blocks are important for the data analysis. While the same matrix factorizations are available in Intel(R) Math Kernel Library (Intel(R) MKL), there are differences between Intel DAAL and Intel MKL QR:

- In analytics area data sets are generally heterogeneous, and Intel DAAL supports the work with such type of data via Data Management component while Intel MKL supports homogeneous data/matrices. So, when your application requires the factorization of heterogeneous data set you can call Intel DAAL QR factorization directly, without intermediate data conversion step
- Some analytics applications require processing of the streaming data, one which arrive in blocks over the time. Intel DAAL QR factorization supports this scenario: once the next data block is available, you provide it in the library, which will then update the factors using only this block, without passing multiple times over the whole (raising) data set.
- Intel DAAL QR factorization supports distributed type of the computations. However, internally it does not rely on any communication technology such as MPI. The library provides APIs for use on the computation nodes, and data/intermediate result transfer between the nodes using specific communication technology is responsibility of the user. The library provides documentation that describes the whole distributed computational flow in QR factorization and provides MPI/Spark samples for it

Intel DAAL library relies on kernels of Intel MKL when possible to bring additional performance gain to the analytics applications.

Please, let me know if this answers your question

Thanks,

Andrey

Andrey_Vladimirov

New Contributor III

- Mark as New
- Bookmark
- Subscribe
- Mute
- Subscribe to RSS Feed
- Permalink
- Email to a Friend
- Report Inappropriate Content

10-28-2015
08:42 AM

96 Views

Great, that is exactly what I needed. Thank you, Andrey!

Ramon_A_

Beginner

- Mark as New
- Bookmark
- Subscribe
- Mute
- Subscribe to RSS Feed
- Permalink
- Email to a Friend
- Report Inappropriate Content

05-08-2017
04:11 AM

96 Views

Hi,

I am trying to understant how to perform a distributed QR decomposition in a distributed environment. I've read your explanation, the description of the algorithm and the sample provided. There are some questions that I haven't been capable to solve. I think that my questions are so related with your discusion that it is not worth creating a new post.

In the description of the algorithm and if I understood it well, the matrix is decomposed by rows and the blocks are a portion of the total matrix. For example, having two blocks of size n_1 x p and n_2 x p means that the original matrix was (n_1 + n_2) x p. Knowing that, should i assume that there is no way to execute a distributed QR decomposition of square matrices? (It is said in the description that each n_X has to be greater or equal than p). Is this an algorithm that is only valid for thin matrices? I understand that is the most common case in big data, but even if I am more interested in more typical "MKL" behaviour, I find really usefull the way DAAL interacts with the data, supporting Cassandra, HDFS and heterogeneous inputs.

Finally you said that the library provides documentation that describes the whole distributed computational flow in QR factorization and provides MPI/Spark samples for it. Are there any available example using PyDAAL (I only found examples on Java)? Here I found an example using Spark. I assume that the configuration that will be used is the one set on Spark, so not additional parameters have to be set. Nevertheless, I am more interested in running PyDAAL distributed examples (In particular, I am interested in running it in a cluster with a queue system). Is there any example on how to call a distributed execution using PyDAAL?

Thank you very much in advance.

Andrey_N_Intel

Employee

- Mark as New
- Bookmark
- Subscribe
- Mute
- Subscribe to RSS Feed
- Permalink
- Email to a Friend
- Report Inappropriate Content

05-08-2017
05:22 AM

96 Views

Hello, thanks for your comments and questions

Yes, the present version of Intel DAAL provides QR decomposition for tall and skinny matrices where number of rows is much bigger than number of columns. At the same time, we consider the ways to extend support for other matrix shapes in QR by analyzing possible use cases. If you could provide extra details on your typical matrix sizes, data type (or types, as you mention that heterogeneous input might be important), dense or sparse nature of the data, and communication technology (say, MPI*) it would help us better understand your use case.

And for samples, including one that demonstrate Python API for the library, please have a look at https://software.intel.com/en-us/intel-daal-support/code-samples.

Let us know, if you need more details or any help from our side

Regards,

Andrey

Ramon_A_

Beginner

- Mark as New
- Bookmark
- Subscribe
- Mute
- Subscribe to RSS Feed
- Permalink
- Email to a Friend
- Report Inappropriate Content

05-08-2017
06:56 AM

96 Views

Hi Andrey,

Thanks a lot for you fast and clear response.

I'm trying to distribute a square dense matrix QR decomposition of double precision real numbers. I'm just in the research phase so I don't have a concrete use case.

Only one last question. In the example shown here there is not reference to neither spark or mpi. If I understood well the example and your previous comment, this is just a generic example but the developer should add the communications and handle them by hand, isn't it? The used is responsible to perform the communications.

If I am wrong, is there a way to launch directly this example through some kind of configuration, indicating where the computing nodes are located?

Regards,

Ramon

Andrey_N_Intel

Employee

- Mark as New
- Bookmark
- Subscribe
- Mute
- Subscribe to RSS Feed
- Permalink
- Email to a Friend
- Report Inappropriate Content

05-09-2017
12:06 AM

96 Views

Hi Ramon,

Yes, this is design decision for Intel DAAL - internally, the library does not rely on any communication technology. It provides APIs to be used on the nodes of the cluster to compute partial results and combine the results together for a given algorithm. This helps use the library with different communication technologies including MPI*, Spark*, etc. Yes, this is responsibility of the user to perform communication. The example you refer to is intended to give the initial idea about API of distributed QR while qr_fast_distributed_mpi.py sample available at the link I provided earlier demonstrates how to use distributed QR together with MPI* technology.

Please, let me know, if it clarifies

Thanks,

Andrey

- Subscribe to RSS Feed
- Mark Topic as New
- Mark Topic as Read
- Float this Topic for Current User
- Bookmark
- Subscribe
- Printer Friendly Page

For more complete information about compiler optimizations, see our Optimization Notice.