[Top][All Lists]

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

Re: Threads vs. OpenMP in PSPP.

From: Ben Pfaff
Subject: Re: Threads vs. OpenMP in PSPP.
Date: Wed, 04 Apr 2007 10:33:46 -0700
User-agent: Gnus/5.110006 (No Gnus v0.6) Emacs/21.4 (gnu/linux)

"John McCabe-Dansted" <address@hidden> writes:

> On 4/2/07, Ben Pfaff <address@hidden> wrote:
>> If we implemented all of these, or even just through #3, I bet
>> PSPP would be one of the best things out there for dealing with
>> large amounts of data.
> Another approach would be to split of the code that thats the majority
> of the cpu time and any or all of the following
> 1) Compile that code with -march="" and link in the code for the
> appropriate CPU.
> 2) Create a benchmark and
> 2a)  Tune the compiler optimisations for each algorithm using Acova.
> 2b)   Pick the compiler that generates the fastest code for that algorithm.

Sure.  This is a lot easier than the algorithmic and structural
improvements than I'm suggesting.  Of course, we can do both.

We don't have any good benchmarks (yet).  Perhaps we can ask
users to submit analyses that in their opinions run too slowly.

I don't think compiler optimizations will help much for analyses
that bottleneck on disk activity.  For big data sets that's
likely to occur.
Ben Pfaff

reply via email to

[Prev in Thread] Current Thread [Next in Thread]