buzzword
Differences
This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision Next revision | Previous revision Next revision Both sides next revision | ||
|
buzzword [2014/03/19 18:16] rachata |
buzzword [2014/03/24 18:16] rachata |
||
|---|---|---|---|
| Line 729: | Line 729: | ||
| * Approximate LRU | * Approximate LRU | ||
| * Victim and next Victim policy | * Victim and next Victim policy | ||
| + | |||
| + | ===== Lecture 20 (3/21 Fri.) ===== | ||
| + | |||
| + | * Set thrashing | ||
| + | * Working set is bigger than the associativity | ||
| + | * Belady's OPT | ||
| + | * Is this optimal? | ||
| + | * Complexity? | ||
| + | * Similarity between cache and page table | ||
| + | * Number of blocks vs pages | ||
| + | * Time to find the block/page to replace | ||
| + | * Handling writes | ||
| + | * Write through | ||
| + | * Need a modified bit to make sure accesses to data got the updated data | ||
| + | * Write back | ||
| + | * Simpler, no consistency issues | ||
| + | * Sectored cache | ||
| + | * Use subblock | ||
| + | * lower bandwidth | ||
| + | * more complex | ||
| + | * Instruction vs data cache | ||
| + | * Where to place instructions | ||
| + | * Unified vs. separated | ||
| + | * In the first level cache | ||
| + | * Cache access | ||
| + | * First level access | ||
| + | * Second level access | ||
| + | * When to start the second level access | ||
| + | * Performance vs. energy | ||
| + | * Address translation | ||
| + | * Homonym and Synonyms | ||
| + | * Homonym: Same VA but maps to different PA | ||
| + | * With multiple processes | ||
| + | * Synonyms: Multiple VAs map to the same PA | ||
| + | * Shared libraries, shared data, copy-on-write | ||
| + | * I/O | ||
| + | * Can these create problems when we have the cache | ||
| + | * How to eliminate these problems? | ||
| + | * Page coloring | ||
| + | * Interaction between cache and TLB | ||
| + | * Virtually indexed vs. physically indexed | ||
| + | * Virtually tagged vs. physically tagged | ||
| + | * Virtually indexed physically tagged | ||
| + | * Virtual memory in DRAM | ||
| + | * Control where data is mapped to in channel/rank/bank | ||
| + | * More parallelism | ||
| + | * Reduce interference | ||
| + | |||
| + | ===== Lecture 21 (3/24 Mon.) ===== | ||
| + | |||
| + | |||
| + | |||
| + | * Different parameters that affect cache miss | ||
| + | * Thrashing | ||
| + | * Different types of cache misses | ||
| + | * Compulsory misses | ||
| + | * Can mitigate with prefetches | ||
| + | * Capacity misses | ||
| + | * More assoc | ||
| + | * Victim cache | ||
| + | * Conflict misses | ||
| + | * Hashing | ||
| + | * Large block vs. small block | ||
| + | * Subblocks | ||
| + | * Victim cache | ||
| + | * Small, but fully assoc. cache behind the actual cache | ||
| + | * Cached misses cache block | ||
| + | * Prevent ping-ponging | ||
| + | * Pseudo associtivity | ||
| + | * Simpler way to implement associative cache | ||
| + | * Skewed assoc. cache | ||
| + | * Different hashing functions for each way | ||
| + | * Restructure data access pattern | ||
| + | * Order of loop traversal | ||
| + | * Blocking | ||
| + | * Memory level parallelism | ||
| + | * Cost per miss of a parallel cache miss is less costly compared to serial misses | ||
| + | * MSHR | ||
| + | * Keep track of pending cache | ||
| + | * Think of this as the load/store buffer-ish for cache | ||
| + | * What information goes into the MSHR? | ||
| + | * When do you access the MSHR? | ||
buzzword.txt · Last modified: 2015/04/27 18:20 by rachata
Page Tools
Except where otherwise noted, content on this wiki is licensed under the following license: CC Attribution-Share Alike 3.0 Unported
