On Wed, Mar 15, 2017 at 05:42:42PM +0800, Hillf Danton wrote:
>
> On March 15, 2017 5:00 PM Aaron Lu wrote:
> > void tlb_finish_mmu(struct mmu_gather *tlb, unsigned long start, unsigned
> > long end)
> > {
> > + struct batch_free_struct *batch_free, *n;
> > +
> s/*n/*next/
>
> > tlb_flu
On March 15, 2017 5:00 PM Aaron Lu wrote:
> void tlb_finish_mmu(struct mmu_gather *tlb, unsigned long start, unsigned
> long end)
> {
> + struct batch_free_struct *batch_free, *n;
> +
s/*n/*next/
> tlb_flush_mmu(tlb);
>
> /* keep the page table cache within bounds */
>
For regular processes, the time taken in its exit() path to free its
used memory is not a problem. But there are heavy ones that consume
several Terabytes memory and the time taken to free its memory could
last more than ten minutes.
To optimize this use case, a parallel free method is proposed an
3 matches
Mail list logo