The Library

WMTrace : a lightweight memory allocation tracker and analysis framework

Tools

Perks, O. F. J., Hammond, Simon D., Pennycook, Simon J. and Jarvis, Stephen A. (2011) WMTrace : a lightweight memory allocation tracker and analysis framework. In: UK Performance Engineering Workshop (UKPEW'11), Bradford, United Kingdom, 7-8 July 2011 (Unpublished)

Preview

PDF
WRAP_Perks_ukpew2011_submission_26.pdf - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
Download (543Kb) | Preview

Official URL: http://www.inf.brad.ac.uk/ukpew11/index.php

Abstract

The diverging gap between processor and memory performance has been a well discussed aspect of computer architecture literature for some years. The use of multi-core processor designs has, however, brought new problems to the design of memory architectures - increased core density without matched improvement in memory capacity is reduc- ing the available memory per parallel process. Multiple cores accessing memory simultaneously degrades performance as a result of resource con- tention for memory channels and physical DIMMs. These issues combine to ensure that memory remains an on-going challenge in the design of parallel algorithms which scale. In this paper we present WMTrace, a lightweight tool to trace and analyse memory allocation events in parallel applications. This tool is able to dynamically link to pre-existing application binaries requiring no source code modification or recompilation. A post-execution analysis stage enables in-depth analysis of traces to be performed allowing memory allocations to be analysed by time, size or function. The second half of this paper features a case study in which we apply WMTrace to five parallel scientific applications and benchmarks, demonstrating its effectiveness at recording high-water mark memory consumption as well as memory use per-function over time. An in-depth analysis is provided for an unstructured mesh benchmark which reveals significant memory allocation imbalance across its participating processes.

Item Type:

Conference Item (Paper)

Subjects:

Q Science > QA Mathematics > QA76 Electronic computers. Computer science. Computer software

Divisions:

Faculty of Science > Computer Science

Library of Congress Subject Headings (LCSH):

Memory management (Computer science), Multiprocessors, Parallel processing (Electronic computers)

Official Date:

July 2011

Dates:

Date	Event
July 2011	Available

Status:

Peer Reviewed

Publication Status:

Unpublished

Funder:

Science Research Investment Fund (SRIF)

Conference Paper Type:

Paper

Title of Event:

UK Performance Engineering Workshop (UKPEW'11)

Type of Event:

Workshop

Location of Event:

Bradford, United Kingdom

Date(s) of Event:

7-8 July 2011

References:

1. memP, 2011. http://sourceforge.net/projects/memp/.
2. Valgrind, 2011. http://valgrind.org/info/.
3. S. Budanur, F. Mueller, and T. Gamblin. Memory Trace Compression and Replay
for SPMD Systems using Extended PRSDs. SIGMETRICS Perform. Eval. Rev.,
38:30{36, March 2011.
4. M. Burtscher. Vpc3: a fast and effective trace-compression algorithm. SIGMET-RICS Perform. Eval. Rev., 32:167{176, June 2004.
5. P. Deutsch and G. J-L. ZLIB Compressed Data Format Specification (version 3.3).
Request for Comments RFC:1950, Internet Engineering Task Force (IETF), May
1996.
6. C. keung Luk, R. Cohn, R. Muth, H. Patil, A. Klauser, G. Lowney, S. Wallace,
V. Janapa, and R. K. Hazelwood. Pin: Building Customized Program Analysis
Tools with Dynamic Instrumentation. In Programming Language Design and Implementation, pages 190{200. ACM Press, 2005.
7. M. Koop, T. Jones, and D. Panda. Reducing Connection Memory Requirements
of MPI for InfiniBand Clusters: A Message Coalescing Approach. In Proceedings
of the 7th IEEE International Symposium on Cluster Computing and the Grid
(CCGRID 2007), pages 495 {504, May 2007.
8. M. J. Koop, S. Sur, Q. Gao, and D. K. Panda. High Performance MPI Design
using Unreliable Datagram for Ultra-scale InfiniBand Clusters. In Proceedings of
the 21st IEEE/ACM International Conference on Supercomputing, ICS '07, pages
180{189, New York, NY, USA, 2007. ACM.
9. J. Liu, B. Chandrasekaran, J. Wu, W. Jiang, S. Kini, W. Yu, D. Buntinas, P. Wycko, and D. K. Panda. Performance Comparison of MPI Implementations over
InfiniBand, Myrinet and Quadrics. In Proceedings of the 2003 ACM/IEEE International Conference on Supercomputing, SC '03, pages 58{, New York, NY, USA,
2003. ACM.
10. N. Nethercote and J. Seward. How to Shadow Every Byte of Memory used by a
Program. In Proceedings of the 3rd International Conference on Virtual Execution
Environments, VEE '07, pages 65{74, New York, NY, USA, 2007. ACM.
11. N. Nethercote and J. Seward. Valgrind: a Framework for Heavyweight Dynamic
Binary Instrumentation. In Proceedings of the 2007 ACM SIGPLAN Conference
on Programming Language Design and Implementation, PLDI '07, pages 89{100,
New York, NY, USA, 2007. ACM.
12. W. A. Wulf and S. A. McKee. Hitting the Memory Wall: Implications of the
Obvious. SIGARCH Comput. Archit. News, 23:20{24, March 1995.
13. B. Zorn and P. Hilfinger. A Memory Allocation Profiler for C and Lisp Programs.
In Proceedings of the Summer 1988 USENIX Conference, pages 223{237, 1988.