commons-dev mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From Ted Dunning <ted.dunn...@gmail.com>
Subject Re: [math] Multithreaded performances
Date Tue, 05 Nov 2013 05:44:39 GMT
On Mon, Nov 4, 2013 at 8:23 PM, Phil Steitz <phil.steitz@gmail.com> wrote:

> On 11/4/13 3:44 PM, Ted Dunning wrote:
> > The copy doesn't have to lock if you build the right data structure.
>
> The individual stats objects need to update multiple quantities
> atomically when new values come in.  Consistency in the copy
> requires that you suppress updates while the copy is in progress
> unless you implement some kind of update queue internally.   What
> exactly do you mean by "the right data structure?"
>

I was talking about lockless data structures in general.

Are you sure that real transactions are a requirement here?

Mime
  • Unnamed multipart/alternative (inline, None, 0 bytes)
View raw message