slides - Computing Systems Laboratory

More documents

Recommendations

Info

ABFCP Comparison with UCP• UCP has a lowerstorage overhead(‏‎8-core (70KB for an• If it attempted topartition on a linebasis, it would require11MB per processor• ABFCP is morerobust• ABFCP performsbetter as the numberof cores increases
ABFCP Comparison with UCP
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 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 30 and 31: CPARP
Page 32: Evaluation• UCP acquires a moreac

slides - Computing Systems Laboratory

Create successful ePaper yourself

Delete template?

Save as template?