slides - Computing Systems Laboratory

More documents

Recommendations

Info

ABFCP : Overview• Adaptive Bloom Filter Cache Partitioning (ABFCP)• Partitioning Module– Track misses and hits– Partitioning Algorithm– Replacement support toenforce partitionsCORE nCORE 0I−CacheD−Cache.I−CachePartitioningModuleSharedL2 CacheD−CacheDRAM
ABFCP : Tracking system• Far Misses– Misses that would have been hits had the application beenallowed to use more cache ways– Tracked by Bloom filters
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 12 and 13: ABFCP : Partitioning Algorithm• 2
Page 14 and 15: ABFCP : Way Partitioning• Way Par
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?