slides - Computing Systems Laboratory

More documents

Recommendations

Info

ABFCP : Way Partitioning• Way Partitioning support [Suh et al. HPCA ’02, Qureshi andPatt MICRO ’06]• Each line has a core-id field• On a miss the ways occupied by the miss-causingapplication are counted– ways_occupied < partition_limit → victim is the LRU line of anotherapplication– Otherwise the victim is the LRU line of the miss-causing application
Evaluation• Configuration– 2,4,8 single-issue, in-order cores– Private L1 I and D caches (32KB, 4-wayassociative, 32B line size, 1 cycleaccess latency)– Unified shared on-chip L2 cache (4MB,32-way associative, 32B line size, 16cycle access latency)– Main memory (32 outstanding requests,100 cycle access latency)• Benchmarks– 9 apps from JavaGrande + NAS– One application per processor– Simulation stops when one of thebenchmarks finishes
Page 2 and 3: Introduction• Cores in CMPs typic
Page 4 and 5: Motivation• Applications can becl
Page 6 and 7: Motivation• Saturating Utility•
Page 8 and 9: Static Cache Partitioning• Two ma
Page 10 and 11: ABFCP : Overview• Adaptive Bloom
Page 12 and 13: ABFCP : Partitioning Algorithm• 2
Page 16 and 17: Results (Dual core system)
Page 18 and 19: Results (Quad core system)
Page 20 and 21: Evaluation• Increasing promise as
Page 22 and 23: Related Work• Cache Partitioning
Page 24 and 25: Any Questions?Thank you!
Page 26 and 27: Utility-Based Cache Partitioning•
Page 28 and 29: ABFCP Comparison with UCP• UCP ha
Page 30 and 31: CPARP
Page 32: Evaluation• UCP acquires a moreac

slides - Computing Systems Laboratory

Create successful ePaper yourself

Delete template?

Save as template?