Trace-driven simulation of memory system scheduling in multithread application

  • Authors:

  • Pengfei Zhu;Mingyu Chen;Yungang Bao;Licheng Chen;Yongbing Huang

  • Affiliations:

  • Chinese Academy of Sciences, Beijing, China, and Graduate School of Chinese Academy of Sciences, Beijing, China;Chinese Academy of Sciences, Beijing, China;Chinese Academy of Sciences, Beijing, China;Chinese Academy of Sciences, Beijing, China, and Graduate School of Chinese Academy of Sciences, Beijing, China;Chinese Academy of Sciences, Beijing, China, and Graduate School of Chinese Academy of Sciences, Beijing, China

  • Venue:
  • Proceedings of the 2012 ACM SIGPLAN Workshop on Memory Systems Performance and Correctness
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

Along with commercial chip-multiprocessors (CMPs) integrating more and more cores, memory systems are playing an increasingly important role in multithread applications. Currently, trace-driven simulation is widely adopted in memory system scheduling research, since it is faster than execution-driven simulation and does not require data computation. On the contrary, due to the same reason, its trace replay for concurrent thread execution lacks data information and contains only addresses, so misplacement occurs in simulations when the trace of one thread runs ahead or behind others. This kind of distortion can cause remarkable errors during research. As shown in our experiment, trace misplacement causes an error rate of up to 10.22% in the metrics, including weighted IPC speedup, harmonic mean of IPC, and CPI throughput. This paper presents a methodology to avoid trace misplacement in trace-driven simulation and to ensure the accuracy of memory scheduling simulation in multithread applications, thus revealing a reliable means to study inter-thread actions in memory systems.