Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.programming > #5015 > unrolled thread
| Started by | Ramine <ramine@1.1> |
|---|---|
| First post | 2014-12-11 16:50 -0800 |
| Last post | 2014-12-11 22:06 +0000 |
| Articles | 2 — 2 participants |
Back to article view | Back to comp.programming
Please read again... Ramine <ramine@1.1> - 2014-12-11 16:50 -0800
Re: Please read again... Mark Carroll <mtbc@bcs.org> - 2014-12-11 22:06 +0000
| From | Ramine <ramine@1.1> |
|---|---|
| Date | 2014-12-11 16:50 -0800 |
| Subject | Please read again... |
| Message-ID | <m6d3gq$jg8$6@dont-email.me> |
I have correcte some typos, please read again... Hello, If you have noticed i have just come up with a new algorithm of my Parallel conjugate gradient solver library that is NUMA aware, this is really a big improvement over my previous algorithm,my new algorithm contains two parts that are the most expensive, and those two parts are: a vector multiplication by a transpose of a matrix, and a vector multiplication by a matrix, but when i have parallelized my previous algorithm, i have parallelized just the memory data cache transfer from the L2 cache-line hit to the CPU that costs around 10 CPU cycles for every double type, and i have parallelized also the multiplication of two doubles and addition of two doubles, but this was not enough, cause what we have to do also is parallelize the memory data transfers from the memory to the L2 cache , and this is what we call a NUMA aware algorithm that really scale on NUMA architecture, and this is what i have done in my new algorithm, the memory data transfers from memory to the L2 cache was also parallelized and this have made my new algorithm NUMA aware and really scalable on NUMA architecture. But to become NUMA aware you need also to allocate memory of the arrays of your Matrix in different NUMA nodes, but that's easy to do. My Parallel conjugate gradient solver library supports dense matrices and it is a library that solves linear system of equations and also it solves large and very large dense linear system of equations. You can download Parallel conjugate gradient solver library from: https://sites.google.com/site/aminer68/parallel-implementation-of-conjugate-gradient-linear-system-solver Thank you, Amine Moulay Ramdane.
[toc] | [next] | [standalone]
| From | Mark Carroll <mtbc@bcs.org> |
|---|---|
| Date | 2014-12-11 22:06 +0000 |
| Message-ID | <87bnn9yh6r.fsf@ixod.org> |
| In reply to | #5015 |
Ramine <ramine@1.1> writes: > I have correcte some typos, please read again... I wonder, have you tried holding your drafts for a couple of hours, while you do something else, then re-reading before the initial posting? It might work well for you. (When I do that, I find it's even better if I read it from some different way, too, for instance working with it in the editor but then re-reading a printout.) Also, when you have posts that summarize some important points well, it might be good to have the latest -- best, corrected -- version on your website. -- Mark
[toc] | [prev] | [standalone]
Back to top | Article view | comp.programming
csiph-web