zswap.txt 3.3 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768
  1. Overview:
  2. Zswap is a lightweight compressed cache for swap pages. It takes pages that are
  3. in the process of being swapped out and attempts to compress them into a
  4. dynamically allocated RAM-based memory pool. zswap basically trades CPU cycles
  5. for potentially reduced swap I/O.  This trade-off can also result in a
  6. significant performance improvement if reads from the compressed cache are
  7. faster than reads from a swap device.
  8. NOTE: Zswap is a new feature as of v3.11 and interacts heavily with memory
  9. reclaim. This interaction has not be fully explored on the large set of
  10. potential configurations and workloads that exist. For this reason, zswap
  11. is a work in progress and should be considered experimental.
  12. Some potential benefits:
  13. * Desktop/laptop users with limited RAM capacities can mitigate the
  14.     performance impact of swapping.
  15. * Overcommitted guests that share a common I/O resource can
  16.     dramatically reduce their swap I/O pressure, avoiding heavy handed I/O
  17. throttling by the hypervisor. This allows more work to get done with less
  18. impact to the guest workload and guests sharing the I/O subsystem
  19. * Users with SSDs as swap devices can extend the life of the device by
  20.     drastically reducing life-shortening writes.
  21. Zswap evicts pages from compressed cache on an LRU basis to the backing swap
  22. device when the compressed pool reaches it size limit. This requirement had
  23. been identified in prior community discussions.
  24. To enabled zswap, the "enabled" attribute must be set to 1 at boot time. e.g.
  25. zswap.enabled=1
  26. Design:
  27. Zswap receives pages for compression through the Frontswap API and is able to
  28. evict pages from its own compressed pool on an LRU basis and write them back to
  29. the backing swap device in the case that the compressed pool is full.
  30. Zswap makes use of zbud for the managing the compressed memory pool. Each
  31. allocation in zbud is not directly accessible by address. Rather, a handle is
  32. return by the allocation routine and that handle must be mapped before being
  33. accessed. The compressed memory pool grows on demand and shrinks as compressed
  34. pages are freed. The pool is not preallocated.
  35. When a swap page is passed from frontswap to zswap, zswap maintains a mapping
  36. of the swap entry, a combination of the swap type and swap offset, to the zbud
  37. handle that references that compressed swap page. This mapping is achieved
  38. with a red-black tree per swap type. The swap offset is the search key for the
  39. tree nodes.
  40. During a page fault on a PTE that is a swap entry, frontswap calls the zswap
  41. load function to decompress the page into the page allocated by the page fault
  42. handler.
  43. Once there are no PTEs referencing a swap page stored in zswap (i.e. the count
  44. in the swap_map goes to 0) the swap code calls the zswap invalidate function,
  45. via frontswap, to free the compressed entry.
  46. Zswap seeks to be simple in its policies. Sysfs attributes allow for one user
  47. controlled policies:
  48. * max_pool_percent - The maximum percentage of memory that the compressed
  49. pool can occupy.
  50. Zswap allows the compressor to be selected at kernel boot time by setting the
  51. “compressor” attribute. The default compressor is lzo. e.g.
  52. zswap.compressor=deflate
  53. A debugfs interface is provided for various statistic about pool size, number
  54. of pages stored, and various counters for the reasons pages are rejected.