Umbra: Efficient and scalable memory shadowing
Author(s)
Zhao, Qin; Bruening, Derek; Amarasinghe, Saman P.
DownloadAmarasinghe_Umbra efficient.pdf (328.6Kb)
OPEN_ACCESS_POLICY
Open Access Policy
Creative Commons Attribution-Noncommercial-Share Alike
Terms of use
Metadata
Show full item recordAbstract
Shadow value tools use metadata to track properties of application data at the granularity of individual machine instructions. These tools provide effective means of monitoring and analyzing the runtime behavior of applications. However, the high runtime overhead stemming from fine-grained monitoring often limits the use of such tools. Furthermore, 64-bit architectures pose a new challenge to the building of efficient memory shadowing tools. Current tools are not able to efficiently monitor the full 64-bit address space due to limitations in their shadow metadata translation.
This paper presents an efficient and scalable memory shadowing framework called Umbra. Employing a novel translation scheme, Umbra supports efficient mapping from application data to shadow metadata for both 32-bit and 64-bit applications. Umbra's translation scheme does not rely on any platform features and is not restricted to any specific shadow memory size. We also present several mapping optimizations and general dynamic instrumentation techniques that substantially reduce runtime overhead, and demonstrate their effectiveness on a real-world shadow value tool. We show that shadow memory translation overhead can be reduced to just 133% on average.
Date issued
2010-04Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence LaboratoryJournal
Proceedings of the 8th annual IEEE/ACM international symposium on Code generation and optimization
Publisher
Association for Computing Machinery
Citation
Zhao, Qin, Derek Bruening, and Saman Amarasinghe. “Umbra: Efficient and Scalable Memory Shadowing.” Proceedings of the 8th Annual IEEE/ACM International Symposium on Code Generation and Optimization. Toronto, Ontario, Canada: ACM, 2010. 22-31.
Version: Author's final manuscript
ISBN
978-1-60558-635-9