Compilation is compute-intensive, not fork-intensive. Think shell
scripts, arch, forking servers, ...
> > > ...
> > > Vectoring up the pte chain nodes as
> > > you do here doesn't help much because the internal fragmentation
> > > roughly equals the reduction in link fields.
> >
> > Are you sure about that? The vectoring is only a loss for very low
> > sharing levels, at which the space consumption isn't a problem anyway.
> > At high levels of sharing it's almost a halving.
>
> Your vector will only be half full on average.
The vector at the head of the list is half full on average. All the
other vectors in the chain are 100% full. For the single-pte nodes,
Bill reported "the mean pte_chain length for chains of length > 1 is
around 6, and the std. dev. is around 12, and the distribution is *very*
long-tailed". This is a good fit.
> ...
> > Is it useful to instantiate the swapped-in page into everyone's
> > pagetables, save some minor faults?
>
> That's what I was thinking, then we just have to figure out how to find
> all those swapped-out ptes efficiently.
page->pte?
It may be a net loss for high sharing levels. Dunno.
-
To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
the body of a message to majordomo@vger.kernel.org
More majordomo info at http://vger.kernel.org/majordomo-info.html
Please read the FAQ at http://www.tux.org/lkml/