harmony-dev mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From Deven You <devyo...@gmail.com>
Subject Re: GC wonders
Date Mon, 23 Aug 2010 13:38:31 GMT
2010/8/23 Giampaolo Tomassoni <Giampaolo@tomassoni.biz>

> > Hope this will help you.
>
> It will, thank you. Now I can sleep better... ;)
>
> I now understand why the GC is regarded as being "the beast" in JVM: this
> reference graph traversal seems really time consuming, isn't? I always
>

As far as I know, there are some new techniques like parallel/concurrent GC
which may solve this problem.

imagined this process like somehow more "local". It instead is basically
> walking every and each object reference to discover unreferenced objects,
> right?
>
> I suppose this also means some per-instance helping fields must be handled
> in the internal representation of object instances. In example, I suppose
> objects are in a list, with possibly next and previous instance pointers in
> each list item, and possibly two further next and previous pointers to
> construct a "list of deleteables", from which instances are removed every
> time a reference points to them during tree traversal.
>
> Regards,
>
> Giampaolo
>
>

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