Home // MMEDIA 2017, The Ninth International Conferences on Advances in Multimedia // View article

A Node Access Frequency based Graph Partitioning Technique for Efficient Dynamic Dependency Analysis

Authors:
Kazuma Kusu
Izuru Kume
Kenji Hatano

Keywords: Dynamic Dependency Analysis; Back-in-time Debugger; Debugging Support; Graph Database; Graph Search; Java.

Abstract:
Program execution traces (simply “traces” for short) contain data/control dependency information, and are indispensable to novel kinds of debugging such as back-in-time debugging. However, traces easily become large and complicated. For a practical use, maintainers need to be able to interactively invoke an analysis process when required and obtain rapid feedback. To this end, the authors develop an approach for efficient macroscopic analysis of traces of large sizes with complex data structures. We propose an approach that involves storing graphs in a database that reduces the number of attributes in the main memory during dependency analysis. We also introduce a criterion for the application of this approach that can maximize its effectiveness. Finally, we conduct experiments to assess its effectiveness for efficient dependency analysis.

Pages: 73 to 78

Copyright: Copyright (c) IARIA, 2017

Publication date: April 23, 2017

Published in: conference

ISSN: 2308-4448

ISBN: 978-1-61208-548-7

Location: Venice, Italy

Dates: from April 23, 2017 to April 27, 2017