A concurrent dynamic analysis framework for multicore hardware

Software has spent the bounty of Moore’s law by solving harder problems and exploiting abstractions, such as highlevel languages, virtual machine technology, binary rewritdynamic analysis. Abstractions make programmers more productive and programs more portable, but usually slow them down. Since Moore’s law is now delivering multiple cores instead of faster processors, future systems must ear a relatively higher cost for abstractions or use es to help tolerate abstraction costs. This paper presents the design, implementation, and evaluation of a novel concurrent, configurable dynamic analysis framework that efficiently utilizes multicore cache architectures. It introduces Cache-friendly Asymmetric Buffering (CAB), a lock-free ring buffer that implements efficient communication between application and analysis threads. We guide the design and implementation of our framework with a model of dynamic analysis overheads. The framework implements exhaustive and sampling event process...

• Type: Conference
• Year: 2009
• Where: OOPSLA
• Authors: Jungwoo Ha, Matthew Arnold, Stephen M. Blackburn, Kathryn S. McKinley
• Keywords: Abstractions Make Programmers, Dynamic Analysis, Dynamic Analysis Framework, OOPSLA 2009, Security Privacy