[haiku-development] Re: heap freelist problem?
- From: Marcus Overhagen <marcusoverhagen@xxxxxxxx>
- To: haiku-development@xxxxxxxxxxxxx
- Date: Mon, 4 Feb 2008 00:31:32 +0100 (CET)
Michael Lotz <mmlr@xxxxxxxx> wrote:
> > As an alternative to directly removing bins, one could have
> > them age and convert them to larger element bins over time,
> > with fewer elements and thus shorter freelists, and eventually
> > remove the expired, empty 2048 byte size bins, given a 4kb
> > page size. Would that make sense?
I think this would be pretty complex, and probably won't work that well.
> I am going to take a look at simply sorting the freelists which should
> have no real performance impact and speed up the lookup considerably.
> That will probably be a good enough fix for the current situation.
Can't we just use an additonal hash where we put the pointers when they
have been freed, and remove them when they get assigned again?
That should speed things up as well, and could be implemented without
touching the basic allocator. just for debugging, of cause.
regards
Marcus
Viel oder wenig? Schnell oder langsam? Unbegrenzt surfen + telefonieren
ohne Zeit- und Volumenbegrenzung? DAS TOP ANGEBOT FÜR ALLE NEUEINSTEIGER
Jetzt bei Arcor: günstig und schnell mit DSL - das All-Inclusive-Paket
für clevere Doppel-Sparer, nur 29,95 Euro inkl. DSL- und ISDN-Grundgebühr!
http://www.arcor.de/rd/emf-dsl-2
Other related posts:
