Date: Fri, 04 Apr 1997 02:27:01 -0800 From: David Greenman <dg@root.com> To: borjam@we.lc.ehu.es (Borja Marcos) Cc: freebsd-hackers@freebsd.org Subject: Re: new malloc Message-ID: <199704041027.CAA10928@root.com> In-Reply-To: Your message of "Fri, 04 Apr 1997 12:02:51 %2B0200." <9704041002.AA17319@sirius.we.lc.ehu.es>
next in thread | previous in thread | raw e-mail | index | archive | help
> The conclusion was: Why not organizing the memory blocks in >a LIFO structure? If I do a malloc and malloc can give me the most >recently used of all the possible blocks, the probability of causing >a page-in is decreased. Depending on the system load, a great >number of page-ins can be avoided. (I have observed this in my case) > > > Of course, the same idea cn be applied adding a MRU policy to the >allocation routine. Both Poul-Henning's and the FreeBSD kernel's malloc allocate and insert chunks at the head of the free queue - thus they already are LIFO. -DG David Greenman Core-team/Principal Architect, The FreeBSD Project
Want to link to this message? Use this URL: <https://mail-archive.FreeBSD.org/cgi/mid.cgi?199704041027.CAA10928>