ACM Home Page
Please provide us with feedback. Feedback
Parallelizing dynamic information flow tracking
Full text PdfPdf (519 KB)
Source
ACM Symposium on Parallel Algorithms and Architectures archive
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures table of contents
Munich, Germany
SESSION: Special track: multicores table of contents
Pages 35-45  
Year of Publication: 2008
ISBN:978-1-59593-973-9
Authors
Olatunji Ruwase  Carnegie Mellon University, Pittsburgh, PA, USA
Phillip B. Gibbons  Intel Research Pittsburgh, Pittsburgh, PA, USA
Todd C. Mowry  Carnegie Mellon University and Intel Research Pittsburgh, Pittsburgh, PA, USA
Vijaya Ramachandran  University of Texas at Austin, Austin, TX, USA
Shimin Chen  Intel Research Pittsburgh, Pittsburgh, PA, USA
Michael Kozuch  Intel Research Pittsburgh, Pittsburgh, PA, USA
Michael Ryan  Intel Research Pittsburgh, Pittsburgh, PA, USA
Sponsors
ACM: Association for Computing Machinery
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGARCH: ACM Special Interest Group on Computer Architecture
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 8,   Downloads (12 Months): 126,   Citation Count: 1
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1378533.1378538
What is a DOI?

ABSTRACT

Dynamic information flow tracking (DIFT) is an important tool for detecting common security attacks and memory bugs. A DIFT tool tracks the flow of information through a monitored program's registers and memory locations as the program executes, detecting and containing/fixing problems on-the-fly. Unfortunately, sequential DIFT tools are quite slow, and DIFT is quite challenging to parallelize. In this paper, we present a new approach to parallelizing DIFT-like functionality. Extending our recent work on accelerating sequential DIFT, we consider a variant of DIFT that tracks the information flow only through unary operations relaxed DIFT, and yet makes sense for detecting security attacks and memory bugs. We present a parallel algorithm for relaxed DIFT, based on symbolic inheritance tracking, which achieves linear speed-up asymptotically. Moreover, we describe techniques for reducing the constant factors, so that speed-ups can be obtained even with just a few processors. We implemented the algorithm in the context of a Log-Based Architectures (LBA) system, which provides hardware support for logging a program trace and delivering it to other (monitoring) processors. Our simulation results on SPEC benchmarks and a video player show that our parallel relaxed DIFT reduces the overhead to as low as 1.2X using 9 monitoring cores on a 16-core chip multiprocessor.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
3
4
5
6
 
7
 
8
9
 
10
 
11
12
 
13
14
15
 
16
N. Nethercote. Dynamic Binary Analysis and Instrumentation. PhD thesis, U. Cambridge, 2004. http://valgrind.org.
 
17
N. Nethercote and J. Seward. Valgrind: A program supervision framework. Electronic Notes in Theoretical Computer Science, 89(2), 2003.
18
19
 
20
J. Newsome and D. Song. Dynamic taint analysis for automatic detection, analysis, and signature generation of exploits on commodity software. In NDSS, 2005.
21
 
22
 
23
24
 
25
26
27
 
28
The MITRE Corporation. Common vulnerabilities and exposures (cve). http://cve.mitre.org/.
 
29
G.-R. Uh, R. Cohn, B. Yadavalli, R. Peri, and R. Ayyagari. Analyzing dynamic binary instrumentation overhead. In WBIA Workshop at ASPLOS, 2006.
 
30
G. Venkataramani, I. Doudalis, Y. Solihin, and M. Prvulovic. FlexiTaint: A programmable accelerator for dynamic taint propagation. In HPCA, 2008.
 
31
 
32
J. Wilander and M. Kamkar. A comparison of publicly available tools for dynamic buffer overflow prevention. In NDSS, 2003.
33
34
 
35
36


Collaborative Colleagues:
Olatunji Ruwase: colleagues
Phillip B. Gibbons: colleagues
Todd C. Mowry: colleagues
Vijaya Ramachandran: colleagues
Shimin Chen: colleagues
Michael Kozuch: colleagues
Michael Ryan: colleagues