Comments on: MPI in Thirty Minutes http://www.linux-mag.com/id/5759/ Open Source, Open Standards Sun, 05 Jul 2009 01:45:28 +0000 http://wordpress.org/?v=2.0.11 by: bejosukamto http://www.linux-mag.com/id/5759/#comment-2568 Thu, 07 May 2009 19:13:19 +0000 http://www.linux-mag.com/id/5759/#comment-2568 Execuse Me....Anybody can help me, how to measure execution time for an elementary operations like addition, multiplication for processor AMD-Duron 800MHz, is't different with FLOPS? what the different way for FLOPS? thanks Execuse Me….Anybody can help me, how to measure execution time for an elementary operations like addition, multiplication for processor AMD-Duron 800MHz, is’t different with FLOPS? what the different way for FLOPS? thanks

]]> by: zayar43 http://www.linux-mag.com/id/5759/#comment-1756 Mon, 17 Nov 2008 19:18:34 +0000 http://www.linux-mag.com/id/5759/#comment-1756 Great!!! Thanks!!! Great!!! Thanks!!!

]]> by: dave_lantos http://www.linux-mag.com/id/5759/#comment-1372 Thu, 07 Aug 2008 00:09:07 +0000 http://www.linux-mag.com/id/5759/#comment-1372 What an informative, easy to follow, well written article. Thanks for the excellent work, Joe! What an informative, easy to follow, well written article. Thanks for the excellent work, Joe!

]]> by: drrossef http://www.linux-mag.com/id/5759/#comment-1238 Wed, 02 Jul 2008 10:09:49 +0000 http://www.linux-mag.com/id/5759/#comment-1238 Nice intro - thanks Nice intro - thanks

]]> by: joe landman http://www.linux-mag.com/id/5759/#comment-1015 Sat, 19 Apr 2008 15:46:59 +0000 http://www.linux-mag.com/id/5759/#comment-1015 Quick note: the source can be downloaded from the above link, or from here http://downloads.scalableinformatics.com/downloads/linux-magazine/ ... I mention this, as the OpenMP code link looks to be broken. I'll let the editors know. Also, there are a number of errors in this document (some formatting, some conversion). The vector bit is supposed to be [ 1^(-2), 2^(-2), ... ] or for the Fortran users among us [ 1**(-2), 2**(-2), ...] The idea is that we form a vector of integers from 1 to the "infinity" value, square each element, then invert each element. This will give us a vector that looks like [ 1, 1/4, 1/9, 1/16, .... ] Then you can either sum these up, or notice that the definition of a dot product lets you do this as well [ 1, 1/4, 1/9, 1/16, ...] dot [ 1, 1, 1, 1, ... ] = pi*pi/6 which was what I was trying to explain. Once the formatting fell off, the rest didn't make much sense. My apologies on this. Quick note: the source can be downloaded from the above link, or from here http://downloads.scalableinformatics.com/downloads/linux-magazine/
… I mention this, as the OpenMP code link looks to be broken. I’ll let the editors know.

Also, there are a number of errors in this document (some formatting, some conversion). The vector bit is supposed to be

[ 1^(-2), 2^(-2), … ]

or for the Fortran users among us

[ 1**(-2), 2**(-2), …]

The idea is that we form a vector of integers from 1 to the “infinity” value, square each element, then invert each element. This will give us a vector that looks like

[ 1, 1/4, 1/9, 1/16, …. ]

Then you can either sum these up, or notice that the definition of a dot product lets you do this as well

[ 1, 1/4, 1/9, 1/16, …] dot [ 1, 1, 1, 1, … ] = pi*pi/6

which was what I was trying to explain. Once the formatting fell off, the rest didn’t make much sense.

My apologies on this.

]]>