Outperforming LRU with an adaptive replacement cache algorithm
| Autor: | Nimrod Megiddo, Dharmendra S. Modha |
|---|---|
| Rok vydání: | 2004 |
| Předmět: |
Web server
General Computer Science Computer science RAID Cache coloring CPU cache Distributed computing Parallel computing Cache-oblivious algorithm Cache pollution computer.software_genre law.invention law Cache invalidation Write-once Cache algorithms Auxiliary memory Snoopy cache Hardware_MEMORYSTRUCTURES Memory hierarchy Adaptive replacement cache Smart Cache Page cache Cache computer Algorithm |
| Zdroj: | Computer. 37:58-65 |
| ISSN: | 0018-9162 |
| DOI: | 10.1109/mc.2004.1297303 |
| Popis: | The self-tuning, low-overhead, scan-resistant adaptive replacement cache algorithm outperforms the least-recently-used algorithm by dynamically responding to changing access patterns and continually balancing between workload recency and frequency features. Caching, a fundamental metaphor in modern computing, finds wide application in storage systems, databases, Web servers, middleware, processors, file systems, disk drives, redundant array of independent disks controllers, operating systems, and other applications such as data compression and list updating. In a two-level memory hierarchy, a cache performs faster than auxiliary storage, but it is more expensive. Cost concerns thus usually limit cache size to a fraction of the auxiliary memory's size. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|