Exploit temporal locality of shared data in SRC enabled CMP

  • Authors:
  • Haixia Wang;Dongsheng Wang;Peng Li;Jinglei Wang;XianPing Fu

  • Affiliations:
  • Research Institute of Information Technology, National Laboratory for Information Science and Technology, Tsinghua University, Beijing, P.R. China;Research Institute of Information Technology, National Laboratory for Information Science and Technology, Tsinghua University, Beijing, P.R. China;Research Institute of Information Technology, National Laboratory for Information Science and Technology, Tsinghua University, Beijing, P.R. China;Research Institute of Information Technology, National Laboratory for Information Science and Technology, Tsinghua University, Beijing, P.R. China;Research Institute of Information Technology, National Laboratory for Information Science and Technology, Tsinghua University, Beijing, P.R. China

  • Venue:
  • NPC'07 Proceedings of the 2007 IFIP international conference on Network and parallel computing
  • Year:
  • 2007

Quantified Score

Hi-index 0.01

Visualization

Abstract

By run-time characteristic analysis of parallel workloads, we found that a majority of shared data accesses of parallel workload has temporal locality. Based on this characteristic, we present a sharing relation cache (SRC for short) based CMP architecture, saving recently used sharing relations to provide destination set information for following cache-to-cache miss requests. Token-SRC protocol integrates SRC into token protocol,reducing network traffic of token protocol.Simulations using SPLASH-2 benchmarks show that, a 16-core CMP system with token-SRC achieved average 15% network traffic reduction of that with token protocol.