|
Size: 2917
Comment: fix up first sentence (thank you Scott Kaplan)
|
Size: 3624
Comment: added link to peterz's clockpro page
|
| Deletions are marked like this. | Additions are marked like this. |
| Line 1: | Line 1: |
| Tbe basic assumptions behind LRU have been invalidated by streaming media, garbage collection and other things possible in large address spaces, but until 2002 there weren't many replacements available that are suitable to be implemented in a general purpose OS. However, with the advent of LIRS, ARC, Clock-pro and CAR/CART algorithms, it looks like there could be a benefit to Linux in implementing something better than LRU or the unbalanced use-once that is in use currently. | The basic assumptions behind ["LRU"] have been invalidated by streaming media, garbage collection and other things possible in large address spaces, but until 2002 there weren't many replacements available that are suitable to be implemented in a general purpose OS. However, with the advent of LIRS, ARC, Clock-pro and CAR/CART algorithms, it looks like there could be a benefit to Linux in implementing something better than LRU or the unbalanced use-once that is in use currently. |
| Line 5: | Line 5: |
| Please feel free to edit this page, after having created an account. | Please feel free to edit this page. |
| Line 14: | Line 14: |
| * ["PageReplacementRequirements"] | |
| Line 22: | Line 23: |
| == Proposals for dealing with non-resident pages == | == Linux implementations == |
| Line 24: | Line 25: |
| Rik's interface (for implementation, see NonResidentPages, code and patches on [http://surriel.com/patches/nonresident my home page]): | * Rahul Iyer's implementation of CART, ["RahulIyerCART"] * Rik van Riel's ClockProApproximation. * Rik van Riel's proposal for the tracking of NonResidentPages, which is used by both his ClockProApproximation and by Peter Zijlstra's [http://www.linux-mm.org/PeterZCart CART] and [http://linux-mm.org/PeterZClockPro2 Clock-pro] implementations. * Peter Zijlstra's CART ["PeterZCart"] * Peter Zijlstra's Clock-Pro ["PeterZClockPro2"] |
| Line 26: | Line 31: |
| {{{ extern int recently_evicted(struct address_space * mapping, unsigned long offset); extern int remember_page(struct address_space * mapping, unsigned long offset); }}} |
== NetBSD == |
| Line 31: | Line 33: |
| The ''recently_evicted'' function is queried by the pagein or page cache allocation code, to determine whether the data at the offset ''offset'' from the page cache or process object ''mapping'' was recently evicted. The function returns 0 if the page was not found, 1 if the page was found. | NetBSD folks are also discussing [http://marc.theaimsgroup.com/?l=netbsd-tech-kern&m=111806501516943&w=2 better] page replacement policies. |
| Line 33: | Line 35: |
| The ''remember_page'' function is called by the pageout code, telling the non-resident page management code to remember that a page at offset ''offset'' from ''mapping'' was just paged out. | == Advanced Replacement in other systems == |
| Line 35: | Line 37: |
| We use a hash of ''mapping->host->i_ino'' and ''mapping->host->i_sb'' (and/or possibly other fields) to keep things unique. | Operating systems are not the only place where advanced cache replacement algorithms have been studied and implemented. Databases and web proxies also tend to have fancy replacement algorithms. |
| Line 37: | Line 39: |
| == Status of CART implementation == I'm in the last phase of debugging. I seem to have a few errors with the page out code that i need to fix. Should be out soon... (Rahul Iyer, May-7-2005) |
Recently ARC was implemented in the [http://www.postgresql.org postgresql DB]. However, after it was discovered that ARC is patented (by IBM) it was removed again. You can see a patch that was sent to the ''pgsql-patches'' mail-list proposing that ARC be reverted back to LRU [http://archives.postgresql.org/pgsql-patches/2005-01/msg00253.php here]. More [http://www.varlena.com/varlena/GeneralBits/96.php details] about ARC removal from PostgreSQL. It looks like ARC has finally been [http://archives.postgresql.org/pgsql-patches/2005-02/msg00015.php replaced by the 2Q algorithm], which is a cache replacement algorithm designed for databases. == Benchmarking == Testing is an essential part of implementing one of the above page replacement algorithms on Linux. The PageReplacementTesting page points out problems with LRU worst cases and is used to collect benchmarks to demonstrate LRU deficiencies. For other pages in this category, see CategoryAdvancedPageReplacement |
The basic assumptions behind ["LRU"] have been invalidated by streaming media, garbage collection and other things possible in large address spaces, but until 2002 there weren't many replacements available that are suitable to be implemented in a general purpose OS. However, with the advent of LIRS, ARC, Clock-pro and CAR/CART algorithms, it looks like there could be a benefit to Linux in implementing something better than LRU or the unbalanced use-once that is in use currently.
The only problem is, the advanced page replacement algorithms need to keep a history of recently evicted pages, and we don't want to spend too much memory or cpu on that. This page is a template for brainstorming on how we can implement such a framework, and on which of the advanced page replacement algorithms we should experiment with.
Please feel free to edit this page.
Goals
- More robust in corner cases where LRU / use-once fail.
- Able to deal with long inter-reference distances, as a second level cache. Eg. caching for a database or being a file server.
- Clean implementation.
- SMP scalable.
- Still good performance as a generic VM.
The replacement algorithms
[http://www.almaden.ibm.com/StorageSystems/autonomic_storage/ARC/index.shtml ARC] Adaptive Replacement Cache.
[http://www.cs.wm.edu/~sjiang/lirs.htm LIRS] Low Inter-Reference Recency Set.
[http://www.cs.wm.edu/hpcs/WWW/HTML/publications/abs05-3.html CLOCK-Pro] an effective improvement of the CLOCK replacement, and the ClockProApproximation that Rik van Riel is planning to implement.
[http://www.almaden.ibm.com/cs/people/dmodha/clockfast.pdf CAR] Clock with Adaptive Replacement.
Linux implementations
- Rahul Iyer's implementation of CART, ["RahulIyerCART"]
Rik van Riel's ClockProApproximation.
Rik van Riel's proposal for the tracking of NonResidentPages, which is used by both his ClockProApproximation and by Peter Zijlstra's [http://www.linux-mm.org/PeterZCart CART] and [http://linux-mm.org/PeterZClockPro2 Clock-pro] implementations.
- Peter Zijlstra's CART ["PeterZCart"]
- Peter Zijlstra's Clock-Pro ["PeterZClockPro2"]
NetBSD
NetBSD folks are also discussing [http://marc.theaimsgroup.com/?l=netbsd-tech-kern&m=111806501516943&w=2 better] page replacement policies.
Advanced Replacement in other systems
Operating systems are not the only place where advanced cache replacement algorithms have been studied and implemented. Databases and web proxies also tend to have fancy replacement algorithms.
Recently ARC was implemented in the [http://www.postgresql.org postgresql DB]. However, after it was discovered that ARC is patented (by IBM) it was removed again. You can see a patch that was sent to the pgsql-patches mail-list proposing that ARC be reverted back to LRU [http://archives.postgresql.org/pgsql-patches/2005-01/msg00253.php here].
More [http://www.varlena.com/varlena/GeneralBits/96.php details] about ARC removal from PostgreSQL.
It looks like ARC has finally been [http://archives.postgresql.org/pgsql-patches/2005-02/msg00015.php replaced by the 2Q algorithm], which is a cache replacement algorithm designed for databases.
Benchmarking
Testing is an essential part of implementing one of the above page replacement algorithms on Linux.
The PageReplacementTesting page points out problems with LRU worst cases and is used to collect benchmarks to demonstrate LRU deficiencies.
For other pages in this category, see CategoryAdvancedPageReplacement