On Wed, 17 Oct 2018, Vlastimil Babka wrote:
> I.e. the benefits vs drawbacks of higher order allocations for SLAB are
> out of scope here. It would be nice if somebody evaluated them, but the
> potential resulting change would be much larger than what concerns this
> patch. But it would arguably a
On 10/16/18 5:17 PM, Christopher Lameter wrote:
>> I'm not necessarily approaching this from a performance point of view, but
>> rather as a means to reduce slab fragmentation when fallback to order-0
>> memory, especially when completely legitimate, is prohibited. From a
>> performance standpoint
On Mon, 15 Oct 2018, David Rientjes wrote:
> On Mon, 15 Oct 2018, Christopher Lameter wrote:
>
> > > > If the amount of waste is the same at higher cachep->gfporder values,
> > > > there is no significant benefit to allocating higher order memory.
> > > > There
> > > > will be fewer calls to the
On 10/12/18 11:24 PM, David Rientjes wrote:
> The slab allocator has a heuristic that checks whether the internal
> fragmentation is satisfactory and, if not, increases cachep->gfporder to
> try to improve this.
>
> If the amount of waste is the same at higher cachep->gfporder values,
> there is n
On Mon, 15 Oct 2018, Christopher Lameter wrote:
> > > If the amount of waste is the same at higher cachep->gfporder values,
> > > there is no significant benefit to allocating higher order memory. There
> > > will be fewer calls to the page allocator, but each call will require
> > > zone->lock a
On Fri, 12 Oct 2018, David Rientjes wrote:
> @@ -1803,6 +1804,20 @@ static size_t calculate_slab_order(struct kmem_cache
> *cachep,
>*/
> if (left_over * 8 <= (PAGE_SIZE << gfporder))
> break;
> +
> + /*
> + * If a highe
On Fri, 12 Oct 2018, Andrew Morton wrote:
> > If the amount of waste is the same at higher cachep->gfporder values,
> > there is no significant benefit to allocating higher order memory. There
> > will be fewer calls to the page allocator, but each call will require
> > zone->lock and finding the
On Fri, 12 Oct 2018, Andrew Morton wrote:
> > The slab allocator has a heuristic that checks whether the internal
> > fragmentation is satisfactory and, if not, increases cachep->gfporder to
> > try to improve this.
> >
> > If the amount of waste is the same at higher cachep->gfporder values,
> >
On Fri, 12 Oct 2018 14:24:57 -0700 (PDT) David Rientjes
wrote:
> The slab allocator has a heuristic that checks whether the internal
> fragmentation is satisfactory and, if not, increases cachep->gfporder to
> try to improve this.
>
> If the amount of waste is the same at higher cachep->gfporde
The slab allocator has a heuristic that checks whether the internal
fragmentation is satisfactory and, if not, increases cachep->gfporder to
try to improve this.
If the amount of waste is the same at higher cachep->gfporder values,
there is no significant benefit to allocating higher order memory.
10 matches
Mail list logo
