Hello,
please CC: replies to me, since I'm not subscribed to the list.
On Fri, 15 Jun 2001 15:50:33 -0300 (BRST)
Rik van Riel <[EMAIL PROTECTED]> wrote:
> On Fri, 15 Jun 2001, Ivan Schreter wrote:
>> In 2Q, when a page is present in LRU queue, you move it to the front
space under linux) and
buffersizemax is buffersizecur + size of free memory (or a flag whether we
can put a new block in a free memory block).
Second form (with word "touch") is for the purposes of counting extra time
needed for swapping out the block back to the disk.
Optionally the time m
attach a crude program to simulate LRU, 2Q and FIFO buffer management
policies. If you want, you can play with parameters a little bit and
simulate other workloads (e.g., record what's going on in the system and
then simulate real system block accesses).
I would like to hear from you if you
ement. Seems relatively easy to implement and costs are about the same as
for LRU.
I'm not subscribed to the list, so replies please CC: to me ([EMAIL PROTECTED]).
Ivan Schreter
[EMAIL PROTECTED]
-
To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
the body of
rocessor to other task so it finishes it's work in critical
region sooner.
It's funny nobody has fixed this by now, but as I've seen there were couple
of discussion about sched_yield() already... I come probably too late...
Ivan Schreter
[EMAIL PROTECTED]
--- kernel/sched.c.orig
5 matches
Mail list logo
