TPF and LIRS replacement algorithm

[Xiaodong Zhang <zhang@CS.WM.EDU>]

Dear Linux-MM Team, 

We would like to contribute two pieces of system work to you, 
and hope you are interested in further implementing them in Linux systems as
a part of the open source code. 

(1) Thrashing Protection Facility (TPF) 

Once TPF detects system thrashing, one of active processes will be identified 
for protection withing a short period of time. With the support of TPF, 
thrashing can be eliminated in its early stage by adaptive page replacement, 
so that process swapping will be avoided or delayed until it is truly 
necessary. 

Please access a related technical paper published in J. of Software: 
Practice and Experience at 
http://www.cs.wm.edu/hpcs/WWW/HTML/publications/papers/TR-02-3.pdf

(2) LIRS: a Low Inter-Reference recency Set replacement 

We have proposed and examined an efficient buffer cache replacement 
policy, called Low Inter-reference
Recency Set (LIRS).  LIRS fundamentally addresses the limits of LRU by
using recency to evaluate Inter-Reference Recency (IRR) for making a
replacement decision. This is in contrast to what LRU does: directly
using recency to predict next reference timing.  At the same time,
LIRS almost retains the same simple assumption of LRU to predict future
access behavior of blocks.  Our objectives are to effectively address the
limits of LRU in the general sense, to retain the low overhead merit of
LRU, and to outperform those replacement policies relying on the access
regularity detections.

Please access a related technical paper published in SIGMETRICS'02 at
http://www.cs.wm.edu/hpcs/WWW/HTML/publications/papers/TR-02-6.pdf

Your comments and suggestions are more than welcome. 

Regards. 

Xiaodong Zhang 
Professor of Computer Science 
College of William and Mary 
http://www.cs.wm.edu/~zhang

--
Linux-mm-www:   http://linux-mm.org/ website maintenance list
Archive:        http://mail.nl.linux.org/linux-mm-www/
Development:    linux-mm@kvack.org