linux-mm.kvack.org archive mirror
 help / color / mirror / Atom feed
* questions about LRU
@ 2000-11-17 23:02 Min San Co
  2000-11-17 23:13 ` Roger Larsson
  0 siblings, 1 reply; 2+ messages in thread
From: Min San Co @ 2000-11-17 23:02 UTC (permalink / raw)
  To: linux-mm

Hi!

I am trying to implement the LRU page replacement scheme (Least-Recently 
Used).  My idea is to what create a queue that contains pointers to every 
page held by every process in the system.  This queue should be sorted to 
reflect the most recently used pages, which should be at the front.  I am 
thinking of manipulating this list on every timer interrupt (ie 10 msec).  
After every interrupt, the ordering of pages on the queue will be updated 
based on what pages have been accessed since the last timer interrupt.  I am 
thinking of using the reference bit to determine which page has been 
accessed since the last timer interrupt.  The pages that have been recently 
used will be moved to the front of the queue.

Any ideas on where to put the queue?

Cheers!

Max C.

_________________________________________________________________________
Get Your Private, Free E-mail from MSN Hotmail at http://www.hotmail.com.

Share information about yourself, create your own public profile at 
http://profiles.msn.com.

--
To unsubscribe, send a message with 'unsubscribe linux-mm' in
the body to majordomo@kvack.org.  For more info on Linux MM,
see: http://www.linux.eu.org/Linux-MM/

^ permalink raw reply	[flat|nested] 2+ messages in thread

* Re: questions about LRU
  2000-11-17 23:02 questions about LRU Min San Co
@ 2000-11-17 23:13 ` Roger Larsson
  0 siblings, 0 replies; 2+ messages in thread
From: Roger Larsson @ 2000-11-17 23:13 UTC (permalink / raw)
  To: Min San Co, linux-mm

On Saturday 18 November 2000 00:02, Min San Co wrote:
> Hi!
>
> I am trying to implement the LRU page replacement scheme (Least-Recently
> Used).  My idea is to what create a queue that contains pointers to every
> page held by every process in the system.  This queue should be sorted to
> reflect the most recently used pages, which should be at the front.  I am
> thinking of manipulating this list on every timer interrupt (ie 10 msec).

pages are already placed in a ring using the page struct field lru(!)

> After every interrupt, the ordering of pages on the queue will be updated
> based on what pages have been accessed since the last timer interrupt.  I
> am thinking of using the reference bit to determine which page has been
> accessed since the last timer interrupt.  The pages that have been recently
> used will be moved to the front of the queue.

This will not scale - think about 64GB machines... You would need to scan all
pages every timer interrupt...

>
> Any ideas on where to put the queue?
>
Use the existing queues - like active_list (introduced in 2.4.0-test9)
It is scanned but slower than you suggest...

> Cheers!
>
> Max C.
>
> _________________________________________________________________________
> Get Your Private, Free E-mail from MSN Hotmail at http://www.hotmail.com.
>
> Share information about yourself, create your own public profile at
> http://profiles.msn.com.
>
> --
> To unsubscribe, send a message with 'unsubscribe linux-mm' in
> the body to majordomo@kvack.org.  For more info on Linux MM,
> see: http://www.linux.eu.org/Linux-MM/

-- 
--
Home page:
  http://www.norran.net/nra02596/
--
To unsubscribe, send a message with 'unsubscribe linux-mm' in
the body to majordomo@kvack.org.  For more info on Linux MM,
see: http://www.linux.eu.org/Linux-MM/

^ permalink raw reply	[flat|nested] 2+ messages in thread

end of thread, other threads:[~2000-11-17 23:13 UTC | newest]

Thread overview: 2+ messages (download: mbox.gz / follow: Atom feed)
-- links below jump to the message on this page --
2000-11-17 23:02 questions about LRU Min San Co
2000-11-17 23:13 ` Roger Larsson

This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox