Memory Tagging in Charm++
Workshop on Parallel and Distributed Systems: Testing, Analysis, and Debugging at ISSTA (PADTAD) 2008
Publication Type: Paper
Repository URL: 2008_MemoryTagging
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.
TextRef
Filippo Gioachin, Laxmikant V. Kale.
"Memory Tagging in Charm++".
Proceedings of the 6th Workshop on Parallel and Distributed Systems: Testing, Analysis, and Debugging (PADTAD '08).
People
Research Areas