On Mon, Sep 2, 2013 at 11:47 PM, Sandro Magi <[email protected]> wrote:
> On 31/08/2013 12:59 PM, David Jeske wrote: > >> Rather than splitting into strictly two subsets (reachable and >> non-reachable) they do a union-find to split into N disjoint object graphs >> - which become the new post-split regions. (good luck doing that without >> stop the world) >> > > The lazy techniques Bacon and Petrank pioneered for the Recycler would > work here to virtually eliminate stop-the-world, Just a minor point of clarity... It isn't the cycle find which I am suggesting would create pause problems, it's the difficulty of subdividing the live portions of a region into N separated regions (because an aggregate object tying them together was removed) while keeping concurrent runtime region inference coherent.
_______________________________________________ bitc-dev mailing list [email protected] http://www.coyotos.org/mailman/listinfo/bitc-dev
