>On Thu, Nov 02, 2000 at 12:45:30AM -0800, David Greenman wrote:
>> >Interesting. THis needs about two bytes per page for the counter?
>>
>>Actually, we found that a single byte per page was sufficient. Pages tended
>> to be either heavily accessed or rarely accessed. Even in the unusual case
:On Mon, Dec 04, 2000 at 11:41:26PM +0100, Bernd Walter wrote:
:> On Mon, Dec 04, 2000 at 02:36:44PM -0700, [EMAIL PROTECTED] wrote:
:> > what exacly do you mean with critical path, here?
:>
:> Performance critical.
:> Most RISC platforms are optimized for 32 and maybe 64 bit structures.
:> E.g.
On Mon, Dec 04, 2000 at 11:41:26PM +0100, Bernd Walter wrote:
> On Mon, Dec 04, 2000 at 02:36:44PM -0700, [EMAIL PROTECTED] wrote:
> > what exacly do you mean with critical path, here?
>
> Performance critical.
> Most RISC platforms are optimized for 32 and maybe 64 bit structures.
> E.g. First g
On Mon, Dec 04, 2000 at 02:36:44PM -0700, [EMAIL PROTECTED] wrote:
> what exacly do you mean with critical path, here?
Performance critical.
Most RISC platforms are optimized for 32 and maybe 64 bit structures.
E.g. First generation alphas (without BWX) can't even access anything
smaller than 32b
what exacly do you mean with critical path, here?
JAn
On Sun, 5 Nov 2000, Bernd Walter wrote:
> On Thu, Nov 02, 2000 at 12:45:30AM -0800, David Greenman wrote:
> > >Interesting. THis needs about two bytes per page for the counter?
> >
> >Actually, we found that a single byte per page was su
On Thu, Nov 02, 2000 at 12:45:30AM -0800, David Greenman wrote:
> >Interesting. THis needs about two bytes per page for the counter?
>
>Actually, we found that a single byte per page was sufficient. Pages tended
> to be either heavily accessed or rarely accessed. Even in the unusual case
> wh
>Interesting. THis needs about two bytes per page for the counter?
Actually, we found that a single byte per page was sufficient. Pages tended
to be either heavily accessed or rarely accessed. Even in the unusual case
where all pages are frequently accessed, the page reclaim rate (and thus
adj
Interesting. THis needs about two bytes per page for the counter?
JAn
On Wed, 1 Nov 2000, David Greenman wrote:
> >What paging strategy does FreeBSD currently use? Is it LRU or some
> >approximation to it? How much memory does this strategy take up in its
> >current implementation?
>
>It's
>What paging strategy does FreeBSD currently use? Is it LRU or some
>approximation to it? How much memory does this strategy take up in its
>current implementation?
It's probably nothing like anything you've heard of before. It's closest
to LOU (least often used). We look at the page's referen
What paging strategy does FreeBSD currently use? Is it LRU or some
approximation to it? How much memory does this strategy take up in its
current implementation?
Thank you for any information or links,
Jan
To Unsubscribe: send mail to [EMAIL PROTECTED]
with "unsubscribe freebsd-current" in th
10 matches
Mail list logo
