Memory tagging in charm++

Filippo Gioachin, Laxmikant V. Kalé

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Many scientific applications are logically decomposed into modules, each module performing a different type of computation. These modules are then linked together inside the same executable. While these modules are logically independent, they are not physically independent: a faulty module can corrupt the state of another one. By identifying the different modules inside an application, tagging the memory according to the different modules, and performing extra runtime checks, we can automatically detect certain type of errors. We implemented our idea inside the CHARM++ runtime system, where modules can be easily identified. We illustrate the validity of our approach, and evaluate its overhead.

Original languageEnglish (US)
Title of host publication2008 International Symposium on Software Testing and Analysis - Proceedings of the 6th Workshop on Parallel and Distributed Systems
Subtitle of host publicationTesting, Analysis, and Debugging 2008, PADTAD'08
DOIs
StatePublished - 2008
Event6th Workshop on Parallel and Distributed Systems: Testing, Analysis, and Debugging 2008, PADTAD'08 - Seattle, WA, United States
Duration: Jul 20 2007Jul 21 2007

Publication series

Name2008 International Symposium on Software Testing and Analysis - Proceedings of the 6th Workshop on Parallel and Distributed Systems: Testing, Analysis, and Debugging 2008, PADTAD'08

Other

Other6th Workshop on Parallel and Distributed Systems: Testing, Analysis, and Debugging 2008, PADTAD'08
Country/TerritoryUnited States
CitySeattle, WA
Period7/20/077/21/07

Keywords

  • Debugging
  • Memory debugging
  • Memory tagging
  • Parallel debugging

ASJC Scopus subject areas

  • Computer Science Applications
  • Software

Fingerprint

Dive into the research topics of 'Memory tagging in charm++'. Together they form a unique fingerprint.

Cite this