2009/11/19 john skaller <skal...@users.sourceforge.net>:
>
> On 19/11/2009, at 7:48 PM, Rhythmic Fistman wrote:
>>
>> It diverges a bit on the
>>
>>  C binding
>
> Didn't look at that ..
>
>>
>>  mapping of goroutines to machine threads
>
> Actually the explanation I read seems bogus. The problem
> with incremental stack growth is that whilst it conserves memory
> it still eats up a huge amount of address space (otherwise you
> run out of address space).

I was hoping that it was stackless.

> Felix does not have this problem because it uses the spaghetti
> stack idea.
>
>
> However it IS possible to relocate a stack, however it is an expensive
> operation, requiring modifying every pointer in the whole program that
> points into the old stack to point into the new one.
>
> However that can be zero cost if the system is running a copying
> collector .. since the collector has to do this relocation for ALL
> of memory every "pass" anyhow. Be interesting to know what
> they actually do.

------------------------------------------------------------------------------
Let Crystal Reports handle the reporting - Free Crystal Reports 2008 30-Day 
trial. Simplify your report design, integration and deployment - and focus on 
what you do best, core application coding. Discover what's new with
Crystal Reports now.  http://p.sf.net/sfu/bobj-july
_______________________________________________
Felix-language mailing list
Felix-language@lists.sourceforge.net
https://lists.sourceforge.net/lists/listinfo/felix-language

Reply via email to