December 20, 2011
On 12/20/2011 08:33 PM, Robert Jacques wrote:
> On Mon, 19 Dec 2011 10:54:22 -0800, Timon Gehr <timon.gehr@gmx.ch> wrote:
>
>> On 12/19/2011 07:50 PM, Vladimir Panteleev wrote:
>>> On Monday, 19 December 2011 at 08:28:52 UTC, Adam Wilson wrote:
>>>> According to this wikipedia page
>>>> http://en.wikipedia.org/wiki/Boehm_garbage_collector it is also the GC
>>>> that is used by D, with some minor modifications of course.
>>>
>>> I'm not sure if that's true... I believe that they both use the same
>>> basic idea, but AFAIK the D garbage collector is a D port of a C rewrite
>>> which was originally written for something else. The D GC has been
>>> optimized a lot since its first versions.
>>
>> It would probably be interesting to test the mostly concurrent
>> generational Boehm GC with D. I'd expect it to perform a lot better than
>> the simple mark and sweep GC we have in druntime.
>>
>
> The Boehm GC isn't concurrent nor generational.

http://www.hpl.hp.com/personal/Hans_Boehm/gc/

'The collector uses a mark-sweep algorithm. It provides incremental and generational collection under operating systems which provide the right kind of virtual memory support. [...]'

http://www.hpl.hp.com/personal/Hans_Boehm/gc/gcdescr.html

'Generational Collection and Dirty Bits
We basically use the concurrent and generational GC algorithm described in "Mostly Parallel Garbage Collection", by Boehm, Demers, and Shenker.'

December 21, 2011
On Tue, 20 Dec 2011 12:11:27 -0800, Timon Gehr <timon.gehr@gmx.ch> wrote:

> On 12/20/2011 08:33 PM, Robert Jacques wrote:
>> On Mon, 19 Dec 2011 10:54:22 -0800, Timon Gehr <timon.gehr@gmx.ch> wrote:
>>
>>> On 12/19/2011 07:50 PM, Vladimir Panteleev wrote:
>>>> On Monday, 19 December 2011 at 08:28:52 UTC, Adam Wilson wrote:
>>>>> According to this wikipedia page
>>>>> http://en.wikipedia.org/wiki/Boehm_garbage_collector it is also the GC
>>>>> that is used by D, with some minor modifications of course.
>>>>
>>>> I'm not sure if that's true... I believe that they both use the same
>>>> basic idea, but AFAIK the D garbage collector is a D port of a C rewrite
>>>> which was originally written for something else. The D GC has been
>>>> optimized a lot since its first versions.
>>>
>>> It would probably be interesting to test the mostly concurrent
>>> generational Boehm GC with D. I'd expect it to perform a lot better than
>>> the simple mark and sweep GC we have in druntime.
>>>
>>
>> The Boehm GC isn't concurrent nor generational.
>
> http://www.hpl.hp.com/personal/Hans_Boehm/gc/
>
> 'The collector uses a mark-sweep algorithm. It provides incremental and
> generational collection under operating systems which provide the right
> kind of virtual memory support. [...]'
>
> http://www.hpl.hp.com/personal/Hans_Boehm/gc/gcdescr.html
>
> 'Generational Collection and Dirty Bits
> We basically use the concurrent and generational GC algorithm described
> in "Mostly Parallel Garbage Collection", by Boehm, Demers, and Shenker.'

Yes and no. Notice the very big conditional on those statements. The approach used in these papers is the similar to that of CDGC and have similar operating system limitations. Specifically, they don't work on Windows. But thank you for expanding my knowledge of GCs, as I thought that the virtual memory tricks came after Boehm.
January 03, 2012
>
>
> D's pass-down lambdas do not need memory allocation. As far as I remember none of std.algorithm's use of lambda allocates memory.
>
>

On that front Andrei, did you get a chance to discuss my request to make std.algorithm more usable with Walter?


http://www.digitalmars.com/webnews/newsgroups.php?art_group=digitalmars.D&article_id=140807

- Regards


January 03, 2012
On 1/3/12 11:34 AM, d coder wrote:
>
>     D's pass-down lambdas do not need memory allocation. As far as I
>     remember none of std.algorithm's use of lambda allocates memory.
>
>
>
> On that front Andrei, did you get a chance to discuss my request to make
> std.algorithm more usable with Walter?
>
> http://www.digitalmars.com/webnews/newsgroups.php?art_group=digitalmars.D&article_id=140807
> <http://www.digitalmars.com/webnews/newsgroups.php?art_group=digitalmars.D&article_id=140807>
>
> - Regards
>

It's on my mind, but I don't have a good proposal in mind. For better or worse, it seems to not appear on many people's radar, which pushes its priority down. I do think it should be addressed. Any ideas, please share.


Thanks,

Andrei
1 2 3 4 5 6 7 8 9 10
Next ›   Last »