Cache write policies and performance
Author:
- Norman P. JouppiNJNorman P. Jouppi
Open Access
- 1 May 1993
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGARCH Computer Architecture News
- Vol. 21 (2) , 191-201
Abstract
This paper investigates issues involving writes and caches. First, tradeoffs on writes that miss in the cache are investigated. In particular, whether the missed cache block is fetched on a write miss, whether the missed cache block is allocated in the cache, and whether the cache line is written before hit or miss is known are considered. Depending on the combination of these polices chosen, the entire cache miss rate can vary by a factor of two on some applications. The combination of no-fetch-on-write and write-allocate can provide better performance than cache line allocation instructions. Second, tradeoffs between write-through and write-back caching when writes hit in a cache are considered. A mixture of these two alternatives, called write caching is proposed. Write caching places a small fully-associative cache behind a write-through cache. A write cache can eliminate almost as much write traffic as a write-back cache.Keywords
This publication has 11 references indexed in Scilit:
- Second bibliography on Cache memoriesACM SIGARCH Computer Architecture News, 1991
- Improving direct-mapped cache performance by the addition of a small fully-associative cache and prefetch buffers1990
- Performance-Directed Cache Design1990
- Architectural and organizational tradeoffs in the design of the MultiTitan CPU1989
- Bibliography and reading on CPU cache memories and related topicsACM SIGARCH Computer Architecture News, 1986
- Cache Performance in the VAX-11/780ACM Transactions on Computer Systems, 1983
- Using cache memory to reduce processor-memory traffic1983
- Cache MemoriesACM Computing Surveys, 1982
- The 801 minicomputer1982
- Characterizing the Storage Process and Its Effect on the Update of Main Memory by Write ThroughJournal of the ACM, 1979