cleancache.txt 14 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277
  1. MOTIVATION
  2. Cleancache is a new optional feature provided by the VFS layer that
  3. potentially dramatically increases page cache effectiveness for
  4. many workloads in many environments at a negligible cost.
  5. Cleancache can be thought of as a page-granularity victim cache for clean
  6. pages that the kernel's pageframe replacement algorithm (PFRA) would like
  7. to keep around, but can't since there isn't enough memory. So when the
  8. PFRA "evicts" a page, it first attempts to use cleancache code to
  9. put the data contained in that page into "transcendent memory", memory
  10. that is not directly accessible or addressable by the kernel and is
  11. of unknown and possibly time-varying size.
  12. Later, when a cleancache-enabled filesystem wishes to access a page
  13. in a file on disk, it first checks cleancache to see if it already
  14. contains it; if it does, the page of data is copied into the kernel
  15. and a disk access is avoided.
  16. Transcendent memory "drivers" for cleancache are currently implemented
  17. in Xen (using hypervisor memory) and zcache (using in-kernel compressed
  18. memory) and other implementations are in development.
  19. FAQs are included below.
  20. IMPLEMENTATION OVERVIEW
  21. A cleancache "backend" that provides transcendent memory registers itself
  22. to the kernel's cleancache "frontend" by calling cleancache_register_ops,
  23. passing a pointer to a cleancache_ops structure with funcs set appropriately.
  24. The functions provided must conform to certain semantics as follows:
  25. Most important, cleancache is "ephemeral". Pages which are copied into
  26. cleancache have an indefinite lifetime which is completely unknowable
  27. by the kernel and so may or may not still be in cleancache at any later time.
  28. Thus, as its name implies, cleancache is not suitable for dirty pages.
  29. Cleancache has complete discretion over what pages to preserve and what
  30. pages to discard and when.
  31. Mounting a cleancache-enabled filesystem should call "init_fs" to obtain a
  32. pool id which, if positive, must be saved in the filesystem's superblock;
  33. a negative return value indicates failure. A "put_page" will copy a
  34. (presumably about-to-be-evicted) page into cleancache and associate it with
  35. the pool id, a file key, and a page index into the file. (The combination
  36. of a pool id, a file key, and an index is sometimes called a "handle".)
  37. A "get_page" will copy the page, if found, from cleancache into kernel memory.
  38. An "invalidate_page" will ensure the page no longer is present in cleancache;
  39. an "invalidate_inode" will invalidate all pages associated with the specified
  40. file; and, when a filesystem is unmounted, an "invalidate_fs" will invalidate
  41. all pages in all files specified by the given pool id and also surrender
  42. the pool id.
  43. An "init_shared_fs", like init_fs, obtains a pool id but tells cleancache
  44. to treat the pool as shared using a 128-bit UUID as a key. On systems
  45. that may run multiple kernels (such as hard partitioned or virtualized
  46. systems) that may share a clustered filesystem, and where cleancache
  47. may be shared among those kernels, calls to init_shared_fs that specify the
  48. same UUID will receive the same pool id, thus allowing the pages to
  49. be shared. Note that any security requirements must be imposed outside
  50. of the kernel (e.g. by "tools" that control cleancache). Or a
  51. cleancache implementation can simply disable shared_init by always
  52. returning a negative value.
  53. If a get_page is successful on a non-shared pool, the page is invalidated
  54. (thus making cleancache an "exclusive" cache). On a shared pool, the page
  55. is NOT invalidated on a successful get_page so that it remains accessible to
  56. other sharers. The kernel is responsible for ensuring coherency between
  57. cleancache (shared or not), the page cache, and the filesystem, using
  58. cleancache invalidate operations as required.
  59. Note that cleancache must enforce put-put-get coherency and get-get
  60. coherency. For the former, if two puts are made to the same handle but
  61. with different data, say AAA by the first put and BBB by the second, a
  62. subsequent get can never return the stale data (AAA). For get-get coherency,
  63. if a get for a given handle fails, subsequent gets for that handle will
  64. never succeed unless preceded by a successful put with that handle.
  65. Last, cleancache provides no SMP serialization guarantees; if two
  66. different Linux threads are simultaneously putting and invalidating a page
  67. with the same handle, the results are indeterminate. Callers must
  68. lock the page to ensure serial behavior.
  69. CLEANCACHE PERFORMANCE METRICS
  70. If properly configured, monitoring of cleancache is done via debugfs in
  71. the /sys/kernel/debug/cleancache directory. The effectiveness of cleancache
  72. can be measured (across all filesystems) with:
  73. succ_gets - number of gets that were successful
  74. failed_gets - number of gets that failed
  75. puts - number of puts attempted (all "succeed")
  76. invalidates - number of invalidates attempted
  77. A backend implementation may provide additional metrics.
  78. FAQ
  79. 1) Where's the value? (Andrew Morton)
  80. Cleancache provides a significant performance benefit to many workloads
  81. in many environments with negligible overhead by improving the
  82. effectiveness of the pagecache. Clean pagecache pages are
  83. saved in transcendent memory (RAM that is otherwise not directly
  84. addressable to the kernel); fetching those pages later avoids "refaults"
  85. and thus disk reads.
  86. Cleancache (and its sister code "frontswap") provide interfaces for
  87. this transcendent memory (aka "tmem"), which conceptually lies between
  88. fast kernel-directly-addressable RAM and slower DMA/asynchronous devices.
  89. Disallowing direct kernel or userland reads/writes to tmem
  90. is ideal when data is transformed to a different form and size (such
  91. as with compression) or secretly moved (as might be useful for write-
  92. balancing for some RAM-like devices). Evicted page-cache pages (and
  93. swap pages) are a great use for this kind of slower-than-RAM-but-much-
  94. faster-than-disk transcendent memory, and the cleancache (and frontswap)
  95. "page-object-oriented" specification provides a nice way to read and
  96. write -- and indirectly "name" -- the pages.
  97. In the virtual case, the whole point of virtualization is to statistically
  98. multiplex physical resources across the varying demands of multiple
  99. virtual machines. This is really hard to do with RAM and efforts to
  100. do it well with no kernel change have essentially failed (except in some
  101. well-publicized special-case workloads). Cleancache -- and frontswap --
  102. with a fairly small impact on the kernel, provide a huge amount
  103. of flexibility for more dynamic, flexible RAM multiplexing.
  104. Specifically, the Xen Transcendent Memory backend allows otherwise
  105. "fallow" hypervisor-owned RAM to not only be "time-shared" between multiple
  106. virtual machines, but the pages can be compressed and deduplicated to
  107. optimize RAM utilization. And when guest OS's are induced to surrender
  108. underutilized RAM (e.g. with "self-ballooning"), page cache pages
  109. are the first to go, and cleancache allows those pages to be
  110. saved and reclaimed if overall host system memory conditions allow.
  111. And the identical interface used for cleancache can be used in
  112. physical systems as well. The zcache driver acts as a memory-hungry
  113. device that stores pages of data in a compressed state. And
  114. the proposed "RAMster" driver shares RAM across multiple physical
  115. systems.
  116. 2) Why does cleancache have its sticky fingers so deep inside the
  117. filesystems and VFS? (Andrew Morton and Christoph Hellwig)
  118. The core hooks for cleancache in VFS are in most cases a single line
  119. and the minimum set are placed precisely where needed to maintain
  120. coherency (via cleancache_invalidate operations) between cleancache,
  121. the page cache, and disk. All hooks compile into nothingness if
  122. cleancache is config'ed off and turn into a function-pointer-
  123. compare-to-NULL if config'ed on but no backend claims the ops
  124. functions, or to a compare-struct-element-to-negative if a
  125. backend claims the ops functions but a filesystem doesn't enable
  126. cleancache.
  127. Some filesystems are built entirely on top of VFS and the hooks
  128. in VFS are sufficient, so don't require an "init_fs" hook; the
  129. initial implementation of cleancache didn't provide this hook.
  130. But for some filesystems (such as btrfs), the VFS hooks are
  131. incomplete and one or more hooks in fs-specific code are required.
  132. And for some other filesystems, such as tmpfs, cleancache may
  133. be counterproductive. So it seemed prudent to require a filesystem
  134. to "opt in" to use cleancache, which requires adding a hook in
  135. each filesystem. Not all filesystems are supported by cleancache
  136. only because they haven't been tested. The existing set should
  137. be sufficient to validate the concept, the opt-in approach means
  138. that untested filesystems are not affected, and the hooks in the
  139. existing filesystems should make it very easy to add more
  140. filesystems in the future.
  141. The total impact of the hooks to existing fs and mm files is only
  142. about 40 lines added (not counting comments and blank lines).
  143. 3) Why not make cleancache asynchronous and batched so it can
  144. more easily interface with real devices with DMA instead
  145. of copying each individual page? (Minchan Kim)
  146. The one-page-at-a-time copy semantics simplifies the implementation
  147. on both the frontend and backend and also allows the backend to
  148. do fancy things on-the-fly like page compression and
  149. page deduplication. And since the data is "gone" (copied into/out
  150. of the pageframe) before the cleancache get/put call returns,
  151. a great deal of race conditions and potential coherency issues
  152. are avoided. While the interface seems odd for a "real device"
  153. or for real kernel-addressable RAM, it makes perfect sense for
  154. transcendent memory.
  155. 4) Why is non-shared cleancache "exclusive"? And where is the
  156. page "invalidated" after a "get"? (Minchan Kim)
  157. The main reason is to free up space in transcendent memory and
  158. to avoid unnecessary cleancache_invalidate calls. If you want inclusive,
  159. the page can be "put" immediately following the "get". If
  160. put-after-get for inclusive becomes common, the interface could
  161. be easily extended to add a "get_no_invalidate" call.
  162. The invalidate is done by the cleancache backend implementation.
  163. 5) What's the performance impact?
  164. Performance analysis has been presented at OLS'09 and LCA'10.
  165. Briefly, performance gains can be significant on most workloads,
  166. especially when memory pressure is high (e.g. when RAM is
  167. overcommitted in a virtual workload); and because the hooks are
  168. invoked primarily in place of or in addition to a disk read/write,
  169. overhead is negligible even in worst case workloads. Basically
  170. cleancache replaces I/O with memory-copy-CPU-overhead; on older
  171. single-core systems with slow memory-copy speeds, cleancache
  172. has little value, but in newer multicore machines, especially
  173. consolidated/virtualized machines, it has great value.
  174. 6) How do I add cleancache support for filesystem X? (Boaz Harrash)
  175. Filesystems that are well-behaved and conform to certain
  176. restrictions can utilize cleancache simply by making a call to
  177. cleancache_init_fs at mount time. Unusual, misbehaving, or
  178. poorly layered filesystems must either add additional hooks
  179. and/or undergo extensive additional testing... or should just
  180. not enable the optional cleancache.
  181. Some points for a filesystem to consider:
  182. - The FS should be block-device-based (e.g. a ram-based FS such
  183. as tmpfs should not enable cleancache)
  184. - To ensure coherency/correctness, the FS must ensure that all
  185. file removal or truncation operations either go through VFS or
  186. add hooks to do the equivalent cleancache "invalidate" operations
  187. - To ensure coherency/correctness, either inode numbers must
  188. be unique across the lifetime of the on-disk file OR the
  189. FS must provide an "encode_fh" function.
  190. - The FS must call the VFS superblock alloc and deactivate routines
  191. or add hooks to do the equivalent cleancache calls done there.
  192. - To maximize performance, all pages fetched from the FS should
  193. go through the do_mpag_readpage routine or the FS should add
  194. hooks to do the equivalent (cf. btrfs)
  195. - Currently, the FS blocksize must be the same as PAGESIZE. This
  196. is not an architectural restriction, but no backends currently
  197. support anything different.
  198. - A clustered FS should invoke the "shared_init_fs" cleancache
  199. hook to get best performance for some backends.
  200. 7) Why not use the KVA of the inode as the key? (Christoph Hellwig)
  201. If cleancache would use the inode virtual address instead of
  202. inode/filehandle, the pool id could be eliminated. But, this
  203. won't work because cleancache retains pagecache data pages
  204. persistently even when the inode has been pruned from the
  205. inode unused list, and only invalidates the data page if the file
  206. gets removed/truncated. So if cleancache used the inode kva,
  207. there would be potential coherency issues if/when the inode
  208. kva is reused for a different file. Alternately, if cleancache
  209. invalidated the pages when the inode kva was freed, much of the value
  210. of cleancache would be lost because the cache of pages in cleanache
  211. is potentially much larger than the kernel pagecache and is most
  212. useful if the pages survive inode cache removal.
  213. 8) Why is a global variable required?
  214. The cleancache_enabled flag is checked in all of the frequently-used
  215. cleancache hooks. The alternative is a function call to check a static
  216. variable. Since cleancache is enabled dynamically at runtime, systems
  217. that don't enable cleancache would suffer thousands (possibly
  218. tens-of-thousands) of unnecessary function calls per second. So the
  219. global variable allows cleancache to be enabled by default at compile
  220. time, but have insignificant performance impact when cleancache remains
  221. disabled at runtime.
  222. 9) Does cleanache work with KVM?
  223. The memory model of KVM is sufficiently different that a cleancache
  224. backend may have less value for KVM. This remains to be tested,
  225. especially in an overcommitted system.
  226. 10) Does cleancache work in userspace? It sounds useful for
  227. memory hungry caches like web browsers. (Jamie Lokier)
  228. No plans yet, though we agree it sounds useful, at least for
  229. apps that bypass the page cache (e.g. O_DIRECT).
  230. Last updated: Dan Magenheimer, April 13 2011