On Fri, Jul 29, 2011 at 5:25 PM, Tom Lane <tgl(at)sss(dot)pgh(dot)pa(dot)us> wrote:
> Robert Haas <robertmhaas(at)gmail(dot)com> writes:
>> On machines with lots of CPU cores, pgbench can start eating up a lot
>> of system time. Investigation reveals that the problem is with
>> I patched it to use random_r() - the patch is attached - and here are
>> the (rather gratifying) results of that test:
>> Since a client-limited benchmark isn't very interesting, I think this
>> change makes sense. Thoughts? Objections?
> Portability, or rather lack of it. What about using erand48, which we
> already have a dependency on (and substitute code for)?
Neither our implementation nor glibc's appears to be thread-safe, and
erand48() is deprecated according to my Linux man page:
These functions are declared obsolete by SVID 3, which states that
rand(3) should be used instead.
glibc provides erand48_r(), and I suppose we could kludge up something
similar out of what's already in src/port?
This is also not exactly the world's most sophisticated algorithm, but
perhaps for pgbench that doesn't matter.
The Enterprise PostgreSQL Company
In response to
pgsql-hackers by date
|Next:||From: Robert Haas||Date: 2011-07-29 23:14:35|
|Subject: Re: USECS_* constants undefined with float8 timestamps?|
|Previous:||From: daveg||Date: 2011-07-29 22:35:04|
|Subject: Re: error: could not find pg_class tuple for index 2662|