Re: Toy computational "benchmark" in Ada (new blog post)

[johnscpg@googlemail.com]

On Thursday, June 6, 2019 at 12:05:02 PM UTC+1, David Trudgett wrote:
> For what it's worth, you may exercise your laughing gear perusing my toy example just for fun at: 
> 
> http://www.eclecticse.com.au/2019/06/procedural-map-reduce-and-parallelism.html
> 
> Any tips or suggestions from Ada old hands out there for other ideas to try would be gratefully considered! :-)
> 
> Enjoy!

On my machine I get a nice improvement over -O3 when I
take the arrays off the heap, and then use the following 2 flags:

   -march=native -funroll-loops

Modifying the programs is easy:

 --Values_Array : Values_Array_Access := new Values_Array_Type;
   Values_Array : Values_Array_Type;

In the parallel version, change the loop in the task body:

--       declare
--          Val : Float64 renames Values_Array (Idx);
--       begin
            My_Sum := My_Sum + Values_Array (Idx) ** 2;
--       end;

The  -funroll-loops  gave me a nice improvement on the parallel
program, less so on the serial version. (Makes no sense to me
at all!) If you are running in a Unix shell, you usually need
to tell the system if you're going to put giant arrays on the
stack. I type this on the command line: ulimit -s unlimited.

Jonathan