1. ECE462/562 Class Project Intelligent Cache Replacement Policy Team member : Chen, Kemeng Gregory A Reida

2. ECE 462/562 Class Project Intelligent replacement policy: Kill+LRU find the block that is unlikely to access (dead block) and replace it upon a cache miss Current replacement policy: LRU passive reactive little use of historical information

3. ECE 462/562 Class Project Architecture:

4. ECE 462/562 Class Project Signature generating functions: 1. new_sig = current_sig ^ (PC of load/store) 2. new_sig = current_sig ^ (PC of load/store << num_access) 3. new_sig = last n bit of branch_history 4. new_sig = (sum of PC of load/store) Mod n

5. ECE 462/562 Class Project Verification: 1.Generate trace for L1 cache (small cache) from both the cold start and middle of the execution using Simplescalar 3.0 2. Direct mapped cache : 100 access 2-way associativity 2 sets: 500 access 16-way associativity 32 sets : 200 access only one set followed for 16-way

6. ECE 462/562 Class Project Simulation: Nine benchmarks from spec2000 : applu apsi art crafty equake gap gcc gzip swim Configuration : Associativity : 2 4 8 Block size : 2 4 8 (word) Cache size : 16 K

7. ECE 456/562 Class Project

8. ECE 462/562 Class Project Analysis: 1.Kill policy : no better performance when simulated without targeting on specific arrays of memory access compared with LRU 2.Hardware : signature table will be very large 3.Speed : kill policy may take longer time to execute in hardware than LRU 4.Power : kill policy may consume more power than LRU

9. ECE 462/562 Class Project Questions?