van Riel R. Page replacement in Linux 2.4 memory management. Proceedings of USENIX Annual Technical Conference (FREENIX track), Boston, MA, June 2001. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Managing Kernel Memory Resources from User Level - Haeberlen (2003) (Correct)
....available, new requests are always granted. When the pool is exhausted, no new metadata can be allocated, and the respective system call fails with an error code. In this case, the requestor can try to free up some memory, e.g. by deleting threads or address spaces. The Linux 2. 4 memory manager [44] dynamically assigns physical memory frames to one of multiple pools or caches. These caches include the buffer cache, the inode cache, a cache for process mapped virtual memory and a slab cache for kernel metadata. Most of the caches can grow and shrink on demand; thus, the kernel can free up ....
Rik van Riel. Page replacement in Linux 2.4 memory management. In Proceedings of the 2001.
Exploiting Gray-Box Knowledge of Buffer-Cache Management - Burnett, Bent.. (2002) (4 citations) (Correct)
....to verify that more pages in the first and third quarters are out of cache than in cache. Thus, this fingerprint is similar to the LRU fingerprint expected for a Clockbased replacement algorithm. Examination of the source code and documentation confirms that the replacement policy is Clock based [15, 34]. Finally, since the buffer cache size is very close to the amount of physical RAM in the system, we conclude a buffer cache that is integrated with the VM. The memory management system within Linux underwent a large revision between version 2.2 and 2.4, thus we see a very different fingerprint ....
....graph in Figure 13, suggests that Linux 2.4 uses both a recency and frequency component, and does not use Clock. Further, the second graph of Dust shows that Linux 2.4 does use history in its decision. Examination of the Linux 2.4. 14 source code and existing documentation confirms these results [15, 34]. Linux maintains two separate queues: an active and an inactive list. When memory becomes scarce, Linux shrinks the size of the buffer cache. In doing this, pages that have not been recently referenced (as indicated by their reference bit) are moved from an active list to an inactive list. The ....
R. van Riel. Page replacement in linux 2.4 memory management. http://www.surriel.com/lectures/linux24-vm.html, June 2001.
Software---Practice And Experience - Softw Pract Exper (Correct)
No context found.
van Riel R. Page replacement in Linux 2.4 memory management. Proceedings of USENIX Annual Technical Conference (FREENIX track), Boston, MA, June 2001.
Dynamic Tracking of Page Miss Ratio Curve for Memory.. - Zhou, Pandey.. (2004) (Correct)
No context found.
R. van Riel. Page replacement in linux 2.4 memory management. USENIX Annual Technical Conference - FREENIX Track, 2001.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC