Talk:Adaptive replacement cache

This article is rated Start-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects:

Computing Low‑importance This article is within the scope of WikiProject Computing, a collaborative effort to improve the coverage of computers, computing, and information technology on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.ComputingWikipedia:WikiProject ComputingTemplate:WikiProject ComputingComputing articles Low This article has been rated as Low-importance on the project's importance scale.

I kept encountering references to the "ARC" in the

zfs discussion.

This article needs more work, but I just want a place where I can find this bit of background. I have yet to read the papers (link in the parent article), so I'm not yet quoting any claims about the workings of the algorithm. Maybe later this week. Henk Langeveld 23:12, 13 January 2007 (UTC)[reply]

The ASCII diagram could probably benefit from replacement with a real one. It would probably simplify the discussion that references it a great deal.

--69.108.105.157 22:54, 19 June 2007 (UTC)[reply]

> Entries (re-)entering the cache (T1, T2) will cause ! to move towards the target marker ^

Since earlier we were told "^ indicates the target size for T1, and may be equal to, smaller than, or larger than the actual size (as indicated by !)", I assume this isn't always the case? i.e. ! can move away from ^ on the right? Or does this claim, repeated under Replacement "A cache miss will not affect ^, but the ! boundary will move closer to ^." mean ! never crosses to the right of ^ ?

Is it "Adaptive replacement cache" or "Adaptive Replacement Cache"? This article is inconsistent. --Mortense (talk) 18:00, 15 August 2016 (UTC)[reply]

at the very bottom about VMware? Gisforgirard (talk) 18:39, 24 October 2019 (UTC)[reply]

currently redirects to an article that, alas, never mentions L2ARC. Should L2ARC instead redirect to the OpenZFS article or this adaptive replacement cache article, which at least mentions L2ARC? --DavidCary (talk) 03:40, 5 May 2021 (UTC)[reply]

This article mentions improved performance compared to the common Least Recently Used method, but doesn't go into any kind of comparison the performance. What are the advantages (and any disadvantages)? What are the best and worst case scenarios like? Probably better written by someone who's more familiar with ARC than I am (all I know is that the ARC in OpenZFS works extremely well). -- Haravikk (talk) 20:08, 5 July 2021 (UTC)[reply]

L'ordinateur cache une bombe dont les coordonnées sont Des entiers compris entre 0 et 100 inclus le joueur propose un point. si la distance entre la bombe et le point proposé est inférieure ou égale à 10, le programme affiche "bravo", sinon le joueur doit proposer à nouveau un point. Le nombre d'essais est limite à 5 102.158.134.115 (talk) 17:36, 5 December 2023 (UTC)[reply]