This is the mail archive of the
java-discuss@sourceware.cygnus.com
mailing list for the Java project.
Re: GC statistics (was Re: big project ported)
- To: Godmar Back <gback at cs dot utah dot edu>, krab at daimi dot au dot dk (Kresten Krab Thorup)
- Subject: Re: GC statistics (was Re: big project ported)
- From: "Jonathan P. Olson" <olson at mmsi dot com>
- Date: Wed, 27 Oct 1999 17:38:47 -0700
- Cc: bryce at albatross dot co dot nz, jsturm at sigma6 dot com, java-discuss at sourceware dot cygnus dot com
- References: <199910271634.KAA15603@peerless.cs.utah.edu>
On Wed, 27 Oct 1999, Godmar Back wrote:
>Other things that make Boehm's gc slower is the fact that it's
>noncopying; therefore, its sweep phase complexity is proportional
>to the amount of garbage found. In other words, it has to spend
>time returned every garbaged object to the allocator one by one.
>
> - Godmar
>-
In an embedded conservative collector, I do the sweep phase by merely
anding bits in allocation maps. There's no work to do for each object
being freed, and each word written to the allocation maps can free
up to 32 objects. In this collector, the mark phase dominates the
collection time, and the sweep phase is always constant.
--
Jon Olson, Modular Mining Systems
3289 E. Hemisphere Loop
Tucson, AZ 85706
olson@mmsi.com
Phone: (520)746-9127
Fax: (520)889-5790