Update 1: Added example using Inline::C.

Update 2: Do more work, ... for my $e ( 1..8 ) { ... }

Well, the Stolz-Cesaro theorem is about convergence of series. There are a lot of series that converge to pi, did you have a specific one in mind? And I don't see where random numbers come into the picture at all.

Some time ago, a University Professor emailed me a serial implementation and asked if possible to run parallel. The number sequence generator in MCE makes it seamless. Also, enabling the bounds_only option further decreases latency by providing workers just the begin and end values per each chunk/segment.

Perl

use strict; use warnings; use MCE::Flow; my $N; # Workers receive [ begin, end ] values. MCE::Flow::init( max_workers => MCE::Util::get_ncpu(), chunk_size => 100000, bounds_only => 1, user_begin => sub { $N = MCE->user_args()->[0] } ); sub func { my ( $beg_seq, $end_seq ) = @{ $_ }; my ( $pi, $t ) = ( 0.0 ); for my $i ( $beg_seq .. $end_seq ) { $t = ( $i + 0.5 ) / $N; $pi += 4.0 / ( 1.0 + $t * $t ); } MCE->gather($pi); } # The user_args option is how to pass arguments. # Workers persist between each run. for my $e ( 1..8 ) { my $n = 10 ** $e; my @ret = mce_flow_s { user_args => [$n] }, \&func, 0, $n - 1; my $pi = 0.0; $pi += $_ for @ret; printf "%9d %0.14f\n", $n, $pi / $n; }

Output

10 3.14242598500110 100 3.14160098692313 1000 3.14159273692312 10000 3.14159265442313 100000 3.14159265359816 1000000 3.14159265358988 10000000 3.14159265358979 100000000 3.14159265358979

Inline::C

use strict; use warnings; use Inline 'C' => <<'END_C'; unsigned int N = 0; void c_init( unsigned int n ) { N = n; } double c_func( unsigned int beg_seq, unsigned int end_seq ) { double t, pi = 0.0; unsigned int i; for ( i = beg_seq ; i <= end_seq ; i++ ) { t = (double) i / (double) N; pi += 4.0 / ( 1.0 + t * t ); } return pi; } END_C use MCE::Flow; # Workers receive [ begin, end ] values. MCE::Flow::init( max_workers => MCE::Util::get_ncpu(), chunk_size => 100000, bounds_only => 1, user_begin => sub { c_init( MCE->user_args()->[0] ) } ); sub func { my ( $beg_seq, $end_seq ) = @{ $_ }; my $pi = c_func($beg_seq, $end_seq); MCE->gather($pi); } # The user_args option is how to pass arguments. # Workers persist between each run. for my $e ( 1..8 ) { my $n = 10 ** $e; my @ret = mce_flow_s { user_args => [$n] }, \&func, 0, $n - 1; my $pi = 0.0; $pi += $_ for @ret; printf "%9d %0.14f\n", $n, $pi / $n; }

Output

10 3.23992598890716 100 3.15157598692313 1000 3.14259248692312 10000 3.14169265192314 100000 3.14160265357315 1000000 3.14159365358964 10000000 3.14159275358979 100000000 3.14159266358980

The C code is greater than 5 times faster on the Windows platform (32-bit), beyond 15 times faster on Unix platforms (64-bit).

Regards, Mario


In reply to Re^4: PRNG/TRNG Cesaro's theorem by marioroy
in thread PRNG/TRNG Cesaro's theorem by CDCozy

Title:
Use:  <p> text here (a paragraph) </p>
and:  <code> code here </code>
to format your post, it's "PerlMonks-approved HTML":



  • Posts are HTML formatted. Put <p> </p> tags around your paragraphs. Put <code> </code> tags around your code and data!
  • Titles consisting of a single word are discouraged, and in most cases are disallowed outright.
  • Read Where should I post X? if you're not absolutely sure you're posting in the right place.
  • Please read these before you post! —
  • Posts may use any of the Perl Monks Approved HTML tags:
    a, abbr, b, big, blockquote, br, caption, center, col, colgroup, dd, del, details, div, dl, dt, em, font, h1, h2, h3, h4, h5, h6, hr, i, ins, li, ol, p, pre, readmore, small, span, spoiler, strike, strong, sub, summary, sup, table, tbody, td, tfoot, th, thead, tr, tt, u, ul, wbr
  • You may need to use entities for some characters, as follows. (Exception: Within code tags, you can put the characters literally.)
            For:     Use:
    & &amp;
    < &lt;
    > &gt;
    [ &#91;
    ] &#93;
  • Link using PerlMonks shortcuts! What shortcuts can I use for linking?
  • See Writeup Formatting Tips and other pages linked from there for more info.