Re: [Python-Dev] A bit about the GIL

2013-04-01 Thread Antoine Pitrou
Hello, On Mon, 1 Apr 2013 01:14:11 +0200 Alfredo Solano Martínez wrote: > > The logic would then be something like this: > - when increasing the refcount, a thread writes only to its own subcounter, > creating one first if necessary. > - similarly, when decreasing the refcount, there is no need

Re: [Python-Dev] A bit about the GIL

2013-03-31 Thread Nick Coghlan
On Mon, Apr 1, 2013 at 11:49 AM, R. David Murray wrote: > On Mon, 01 Apr 2013 01:14:11 +0200, > =?UTF-8?Q?Alfredo_Solano_Mart=C3=ADnez?= wrote: > > Simply put, make the reference counter a sharded one. That is, separate > it > > into several subcounters, in this case one for each thread. > > It s

Re: [Python-Dev] A bit about the GIL

2013-03-31 Thread R. David Murray
On Mon, 01 Apr 2013 01:14:11 +0200, =?UTF-8?Q?Alfredo_Solano_Mart=C3=ADnez?= wrote: > Simply put, make the reference counter a sharded one. That is, separate it > into several subcounters, in this case one for each thread. It seems to me this has a family resemblance to some of the stuff Trent i

[Python-Dev] A bit about the GIL

2013-03-31 Thread Alfredo Solano Martínez
Hi, I know this may be tiresome by now, so feel free to ignore, but I'd like to share with the list an idea about the GIL, more specifically the reference counting mechanism. Simply put, make the reference counter a sharded one. That is, separate it into several subcounters, in this case one for