Coterminous locality and coterminous group data prefetching on chip-multiprocessors

  • Authors:
  • Xudong Shi;Zhen Yang;Jih-Kwon Peir;Lu Peng;Yen-Kuang Chen;Victor Lee;Bob Liang

  • Affiliations:
  • Computer & Information Science & Engineering, University of Florida, Gainesville, FL;Computer & Information Science & Engineering, University of Florida, Gainesville, FL;Computer & Information Science & Engineering, University of Florida, Gainesville, FL;Electrical & Computer Engineering, Louisiana State University, Baton Rouge, LA;Architecture Research Lab, Intel Corporation, Santa Clara, CA;Architecture Research Lab, Intel Corporation, Santa Clara, CA;Architecture Research Lab, Intel Corporation, Santa Clara, CA

  • Venue:
  • IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

Due to shared cache contentions and interconnect delays, data prefetching is more critical in alleviating penalties from increasing memory latencies and demands on Chip-Multiprocessors (CMPs). Through deep analysis of SPEC2000 applications, we find that a part of the nearby data memory references often exhibit highlyrepeated patterns with long, but equal block reuse distance. These references can form a coterminous group (CG). Coterminous locality is introduced as that when a member in a CG is referenced, the remaining members will likely be referenced in the near future. Based on the coterminous locality behavior, we implement a novel CG data prefetcher on CMPs. Performance evaluations show that the proposed prefetcher can accurately cover up to 40-50% of the total misses, and result in 50-60% of potential performance improvement for several selected workload mixes.