Beefy Boxes and Bandwidth Generously Provided by pair Networks
Syntactic Confectionery Delight
 
PerlMonks  

Re^3: Challenge: CPU-optimized byte-wise or-equals (for a meter of beer)

by diotalevi (Canon)
on Sep 13, 2007 at 06:16 UTC ( [id://638738]=note: print w/replies, xml ) Need Help??

Help for this page

Select Code to Download


  1. or download this
    #pragma omp parallel for
    for( ; dsvc < dsvc_end; ++dsvc, ++ssvc ) {
        if ( ! *dsvc )
            *dsvc = *ssvc;
    }
    
  2. or download this
    /* Do it. */
    #pragma omp parallel for
    for( o = 0; o < len; ++o ) {
        if ( ! *( dsvc + o ) )
            *(dsvc+o) = *(ssvc+o);
    }
    
  3. or download this
                          Rate moritz_inplace dio_openmp swap dio_noopenmp
    + avar_tye_c_inplace avar_c_inplace dio_c
    moritz_inplace      1948/s             --       -64% -66%         -68%
    +               -69%           -73%  -83%
    dio_openmp          5344/s           174%         --  -7%         -13%
    +               -15%           -26%  -54%
    ...
    avar_tye_c_inplace  6286/s           223%        18%   9%           3%
    +                 --           -12%  -45%
    avar_c_inplace      7178/s           269%        34%  25%          17%
    +                14%             --  -38%
    dio_c              11495/s           490%       115% 100%          88%
    +                83%            60%    --
    

Log In?
Username:
Password:

What's my password?
Create A New User
Domain Nodelet?
Node Status?
node history
Node Type: note [id://638738]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this?Last hourOther CB clients
Other Users?
Others lurking in the Monastery: (4)
As of 2024-04-23 15:44 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found