Published Articles >> Table of Contents >> Abstract

Data Compression Conference (DCC'05)   pp. 113-122
Performance Comparison of Path Matching Algorithms over Compressed Control Flow Traces
Yongjing Lin, The University of Texas at Dallas
Youtao Zhang, The University of Texas at Dallas

Full Article Text:

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/DCC.2005.72
Send link to a friend

Abstract
A control flow trace captures the complete sequence of dynamically executed basic blocks and function calls. It is usually stored in compressed form due to its large size. Matching an intraprocedural path in a control flow trace faces path interruption and path context problems and therefore requires the extension of traditional pattern matching algorithms. In this paper we evaluate different path matching schemes including those match in the compressed data directly and those match after the decompression. We design simple indices for the compressed data and show that they can greatly improve the performance. Our experimental results show that these schemes are useful and can be adapted to environments with different hardware settings and path matching requests.
Back to Top Additional Information
Citation:  Yongjing Lin, Youtao Zhang, "Performance Comparison of Path Matching Algorithms over Compressed Control Flow Traces," dcc, pp. 113-122,  Data Compression Conference (DCC'05),  2005