On Wed, Aug 21, 2002 at 05:50:56AM +0900, Reimer Behrends wrote:
> That's why the GC heuristic won't be worth much if you use malloc()
> predominantly.

BTW, I've been reading gc.c anf the only heuristic seems to be the
GC_MALLOC_LIMIT thing. And this constant is #define'd, but the cost of
the garbage collection per recovered bit could be controlled if
GC_MALLOC_LIMIT were dynamically adjusted.

If you're using a lot of memory (say, in chunks of 10MB), the GC will
get called lots of times, which could be a severe speed hit. It would
make sense for GC_MALLOC_LIMIT to grow as the total used memory grows
(the rationale being that if you're using 1GB RAM you don't really mind
using 10MB more or less, but you don't want the performance to plummet).

-- 
 _           _                             
| |__   __ _| |_ ___ _ __ ___   __ _ _ __  
| '_ \ / _` | __/ __| '_ ` _ \ / _` | '_ \ 
| |_) | (_| | |_\__ \ | | | | | (_| | | | |
|_.__/ \__,_|\__|___/_| |_| |_|\__,_|_| |_|
	Running Debian GNU/Linux Sid (unstable)
batsman dot geo at yahoo dot com
  
Linux: Where Don't We Want To Go Today?
	-- Submitted by Pancrazio De Mauro, paraphrasing some well-known sales talk