Reducing overheads for acquiring dynamic memory traces

被引:0
|
作者
Gao, XF [1 ]
Laurenzano, M [1 ]
Simon, B [1 ]
Snavely, A [1 ]
机构
[1] San Diego Supercomp Ctr, San Diego, CA 92093 USA
来源
IISWC - 2005: PROCEEDINGS OF THE 2005 IEEE INTERNATIONAL SYMPOSIUM ON WORKLOAD CHARACTERIZATION | 2005年
关键词
D O I
暂无
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Tools for acquiring dynamic memory address information for large scale applications are important for performance modeling, optimization, and for trace-driven simulation. However, straightforward use of binary instrumentation tools for such a fine-grained task as address tracing can cause astonishing slowdown in application run time. For example, in a large scale FY05 collaboration with the Department of Defense High Performance Computing Modernization Office (HPCMO), over I million processor hours were expended in order to gather address information on 7 parallel applications. In this work, we discuss in detail the issues surrounding the performance of memory address acquisition using low-level binary instrumentation tracing. We present three techniques and optimizations to improve performance: 1) SimPoint-guided sampling, 2) instrumentation tool routine optimization, and 3) reduction of instrumentation points through static application analysis. The use of these three techniques together reduces instrumented application slowdown by an order of magnitude. The techniques are generally applicable and have been deployed in the MetaSim tracer thereby enabling memory address acquisition for real-sized applications. We expect the optimizations reported here will reduce the HPCMO effort by approximately 80% in FY06.
引用
收藏
页码:46 / 55
页数:10
相关论文
共 50 条
  • [31] Exploiting Data Locality in Memory for ORAM to Reduce Memory Access Overheads
    Kuang, Jinxi
    Shen, Minghua
    Lu, Yutong
    Xiao, Nong
    PROCEEDINGS OF THE 59TH ACM/IEEE DESIGN AUTOMATION CONFERENCE, DAC 2022, 2022, : 703 - 708
  • [32] Emergence of Dynamic Memory Traces in Cortical Microcircuit Models through STDP
    Klampfl, Stefan
    Maass, Wolfgang
    JOURNAL OF NEUROSCIENCE, 2013, 33 (28) : 11515 - 11529
  • [33] A new technique for reducing MAC address overheads in sensor networks
    Chin, Kwan-Wu
    Lowe, Darryn
    Sanchez, Ricardo Gandia
    IEEE COMMUNICATIONS LETTERS, 2006, 10 (05) : 338 - 340
  • [34] Reducing Communication and Merging Overheads for Distributed Clustering Algorithms on the Cloud
    Chen, Chun-Chieh
    Huang, Jen-Wei
    Chen, Tze-Yu
    Chen, Ming-Syan
    2015 INTERNATIONAL CONFERENCE ON CLOUD COMPUTING AND BIG DATA (CCBD), 2015, : 41 - 48
  • [35] Reducing Library Overheads through Source-to-Source Translation
    King, Alden
    Baden, Scott
    PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON COMPUTATIONAL SCIENCE, ICCS 2012, 2012, 9 : 1930 - 1939
  • [36] Reduce: A Framework for Reducing the Overheads of Fault-Aware Retraining
    Hanif, Muhammad Abdullah
    Shafique, Muhammad
    2023 DESIGN, AUTOMATION & TEST IN EUROPE CONFERENCE & EXHIBITION, DATE, 2023,
  • [37] Reducing system overheads in home-based software DSMs
    Hu, WW
    Shi, WS
    Tang, ZM
    IPPS/SPDP 1999: 13TH INTERNATIONAL PARALLEL PROCESSING SYMPOSIUM & 10TH SYMPOSIUM ON PARALLEL AND DISTRIBUTED PROCESSING, PROCEEDINGS, 1999, : 167 - 173
  • [38] Reducing system overheads in home-based software DSMs
    Hu, Weiwu
    Shi, Weisong
    Tang, Zhimin
    Proceedings of the International Parallel Processing Symposium, IPPS, 1999, : 167 - 173
  • [39] Understand the Overheads of Storage Data Structures on Persistent Memory
    Islam, Abdullah Al Raqibul
    Dai, Dong
    PROCEEDINGS OF THE 25TH ACM SIGPLAN SYMPOSIUM ON PRINCIPLES AND PRACTICE OF PARALLEL PROGRAMMING (PPOPP '20), 2020, : 435 - 436
  • [40] STRUCTURE OF MEMORY TRACES
    TULVING, E
    WATKINS, MJ
    PSYCHOLOGICAL REVIEW, 1975, 82 (04) : 261 - 275