|
Size: 2966
Comment:
|
Size: 3210
Comment:
|
| Deletions are marked like this. | Additions are marked like this. |
| Line 3: | Line 3: |
| [[MailTo(nitingupta.mail AT gmail DOT com)]] ---- This page contains list of patches and other relatd code as it is being developed for Compressed Caching (for 2.6.x kernels) project. You can always find most up-to-date code at Project CVS (at linuxcompressed.sourceforge.net). Code is placed here when it achieves any particular (maybe small) thing. The code is presently very raw but its helping me getting more experience with VMM code and how things are to be done :) |
[[MailTo(nitingupta910 AT gmail DOT com)]] |
| Line 10: | Line 6: |
| === Kernel changes to support Compressed Caching: === * [attachment:toy-cc-2.6.16-rc4.diff Toy ccache patch]: These are few lines I added to 2.6.16-rc4 while going through VMM code. Just some printk()s to simply highlight some kernel entry points for compressed caching work. * [attachment:patch-cc-2.6.16-radix-replace-stable.diff patch-cc-2.6.16-radix-replace-stable]: Replace original page (for now, only clean page cache pages) with a 'chunk head' when it is to be freed under memory pressure and simply store original page uncompressed. When page cache lookup is performed, again replace the 'chunk head' with original page. This patch uses simplified (and inefficient) locking in page cache lookup functions to make it stable for now. * [attachment:patch-cc-2.6.16-better-locking-unstable.diff patch-cc-2.6.16-better-locking-unstable]: This was an attempt to get a better (more efficint) locking in page cache lookup functions but it is not quite as stable as previous simplified patch. It causes apps to freeze as swap usage increase. |
. This page contains some prototype code developed for CompressedCaching project. After seriously insufficient testing, each of these components were eventually merged into final implementation on 2.6.x kernels. |
| Line 18: | Line 8: |
| || [http://linuxcompressed.sourceforge.net/ Project Home Page] || CompressedCaching || [http://sourceforge.net/project/showfiles.php?group_id=13472 Patches] || | |
| Line 27: | Line 18: |
| ---- | |
| Line 32: | Line 22: |
| 1. compress: compress data witten to it and store in internal buffer. | 1. ''compress'': compress data witten to it and store in internal buffer. |
| Line 34: | Line 24: |
| 2. algo_idx: write index of algo you want to test (0: WKdm, 1: WK4x4, 2: LZO) | 2. ''algo_idx'': write index of algo you want to test (0: WKdm, 1: WK4x4, 2: LZO) |
| Line 38: | Line 28: |
| 1. compress: show original and compressed size (TODO: add other stats like time taken too) | 1. ''compress'': show original and compressed size (TODO: add other stats like time taken too) |
| Line 40: | Line 30: |
| 2. decompress: decompress compressed data stored in internal buffer. | 2. ''decompress'': decompress compressed data stored in internal buffer. |
| Line 42: | Line 32: |
| 3. algo_idx: shows list of algos supported with their index. | 3. ''algo_idx'': shows list of algos supported with their index. |
| Line 45: | Line 35: |
| === Compression Structure Implementation: === attachment:storage-test.tar.gz : This module implements compression structure as described on CompressedCaching. |
|
| Line 46: | Line 38: |
| Also commited all these algos to CVS in linux26/lib/{WKdm, WK4x4, LZO} | * The storage begins as a single page. As you add pages to it, it expands till it reaches its max limit. As you take out pages, it shrinks, freeing up pages when it has no chunks left. * Adjacent free chunks are merged together. * Each page can be compressed using different algo. Please see README for usage. ''' In short:''' Interface is via /proc: /proc/storage-test/{readpage, writepage, show_structure} 1. ''writepage'': write a page on this to compress and store it in ccache. 2. ''readpage'': write 'id' (see README) of page you want. 3. ''show_structure'': read to show current snapshot of ccache storage. ---- . [[BR]] [[BR]] '' There was a university where computer science students could ask programming questions to faculty staff. [[BR]][[BR]] '' ''However, before taking their problem and question to the staff, they first had to explain their problem and ask their question to a teddy bear in the lobby. Legend has it that 90% of the students found the answer to their question after putting their problem in words, just by asking it to the teddy bear. [[BR]][[BR]] '' ''They never needed to ask the staff, all they needed was to organize their thoughts.[[BR]] '' -- picked up from kernelnewbies.org |
[:NitinGupta:Nitin Gupta]
MailTo(nitingupta910 AT gmail DOT com)
This page contains some prototype code developed for CompressedCaching project. After seriously insufficient testing, each of these components were eventually merged into final implementation on 2.6.x kernels.
[http://linuxcompressed.sourceforge.net/ Project Home Page] |
[http://sourceforge.net/project/showfiles.php?group_id=13472 Patches] |
Compression algorithms to kernel mode:
Kernel module to test de/compression algorithms (WKdm, WK4x4, LZO): attachment:compress-test.tar.gz
There are basically three main algorithms that are well studied w.r.t compressed caching by previous works -- WKdm, WK4x4, LZO.
Of these, WKdm, WK4x4 are designed to handle anon pages (non filesystem pages) while LZO is more suitable for filesystem data. (Also, in general, compression speed is in order: WKdm > WK4x4 > LZO, while compression factor order is, in general, reverse).
Now, all three algos are ported to kernel space - WKdm, WK4x4 and LZO. You can test them all using this module. It creates 3 /proc entries: /proc/compress-test/{compress, decompress, algo_idx} as described below: (for some detail see README with this module)
In short:
Write to /proc/compress-test entries:
1. compress: compress data witten to it and store in internal buffer.
2. algo_idx: write index of algo you want to test (0: WKdm, 1: WK4x4, 2: LZO)
Read from /proc/compress-test entries:
1. compress: show original and compressed size (TODO: add other stats like time taken too)
2. decompress: decompress compressed data stored in internal buffer.
3. algo_idx: shows list of algos supported with their index.
Compression Structure Implementation:
attachment:storage-test.tar.gz : This module implements compression structure as described on CompressedCaching.
- The storage begins as a single page. As you add pages to it, it expands till it reaches its max limit. As you take out pages, it shrinks, freeing up pages when it has no chunks left.
- Adjacent free chunks are merged together.
- Each page can be compressed using different algo.
Please see README for usage.
In short:
Interface is via /proc:
/proc/storage-test/{readpage, writepage, show_structure}
1. writepage: write a page on this to compress and store it in ccache.
2. readpage: write 'id' (see README) of page you want.
3. show_structure: read to show current snapshot of ccache storage.
There was a university where computer science students could ask programming questions to faculty staff. BRBR
However, before taking their problem and question to the staff, they first had to explain their problem and ask their question to a teddy bear in the lobby. Legend has it that 90% of the students found the answer to their question after putting their problem in words, just by asking it to the teddy bear. BRBR
They never needed to ask the staff, all they needed was to organize their thoughts.BR -- picked up from kernelnewbies.org