Compression techniques to simplify the analysis of large execution traces

Hamou-Lhadj, Abdelwahab; Lethbridge, Timothy C.

doi:10.1109/wpc.2002.1021337

Cited by 54 publications

(51 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…A trace summarization technique for manipulating traces, based on metrics for measuring various properties of an execution trace, was introduced in [17]. It is proposed to use trace summaries to enable top-down analysis of traces as well as recovery of system behavioural models.…”

Section: Releated Workmentioning

confidence: 99%

System Runs Analysis with Process Mining

Shershakov¹,

Rubin

2016

Model. anal. inf. sist.

View full text Add to dashboard Cite

Information systems (IS) produce numerous traces and logs at runtime. In the context of SOA-based (service-oriented architecture) IS, these logs contain details about sequences of process and service calls. Modern application monitoring and error tracking tools provide only rather straightforward log search and filtering functionality. However, "clever" analysis of the logs is highly useful, since it can provide valuable insights into the system architecture, interaction of business domains and services. Here we took runs event logs (trace data) of a big booking system and discovered architectural guidelines violations and common anti-patterns. We applied mature process mining techniques for discovery and analysis of these logs. The aims of process mining are to discover, analyze, and improve processes on the basis of IS behavior recorded as event logs. In several specific examples, we show successful applications of process mining to system runtime analysis and motivate further research in this area.The article is published in the authors' wording.

show abstract

Section: Releated Workmentioning

confidence: 99%

System Runs Analysis with Process Mining

Shershakov¹,

Rubin

2016

Model. anal. inf. sist.

View full text Add to dashboard Cite

show abstract

“…The result are the input data that would trigger the change in the execution flow if inputted during execution. As far as the execution trace format is concerned, Hamou-Lhadj proposed several years ago an exchange format for the traces that he called the "Compact Trace Format" [11]. Later, he proposed a metamodel for execution traces [12].…”

Section: Related Workmentioning

confidence: 99%

Dynamic decision tree for legacy use-case recovery

Dugerdil

Sennhauser

2013

Proceedings of the 28th Annual ACM Symposium on Applied Computing

View full text Add to dashboard Cite

In the context of reverse-engineering project we designed a usecase specification recovery technique for legacy information systems. With our technique, we can recover the alternative flows of each use-case of the system. It is based on a dynamic (i.e. runtime) analysis of the working of the system using execution traces. But "traditional" execution trace format do not contain enough information for this approach to work. Then we designed a new execution trace format together with the associated tool to get the program's dynamic decision tree corresponding to each of the use-case scenario. These trees are then processed to find the possible variants from the main scenario of each use-case. In this paper we first present our approach to the use-case specification recovery technique and the new trace format we designed. Then the decision tree compression technique is showed with a feasibility study. The contribution of the paper is our approach to the recovery of legacy systems' use-case, the new trace format and the decision tree processing technique.

show abstract

“…Another option is to replace a sequence of repeating trace records by the corresponding repetition count. Hamou-Lhadj and Lethbridge [2002] propose one such technique for traces of procedure calls: a trace is first preprocessed to replace repeating sequences of calls with a number of repetitions, and then it is represented as an ordered labeled tree, where nodes are procedure calls and tree levels correspond to nesting levels. In a third phase, the tree is transformed into a dynamic acyclic graph.…”

Section: Related Workmentioning

confidence: 99%

An efficient single-pass trace compression technique utilizing instruction streams

Milenković

2007

ACM Trans. Model. Comput. Simul.

View full text Add to dashboard Cite

Trace-driven simulations have been widely used in computer architecture for quantitative evaluations of new ideas and design prototypes. Efficient trace compression and fast decompression are crucial for contemporary workloads, as representative benchmarks grow in size and number. This article presents Stream-Based Compression (SBC), a novel technique for single-pass compression of address traces. The SBC technique compresses both instruction and data addresses by associating them with a particular instruction stream, that is, a block of consecutively executing instructions. The compressed instruction trace is a trace of instruction stream identifiers. The compressed data address trace encompasses the data address stride and the number of repetitions for each memoryreferencing instruction in a stream, ordered by the corresponding stream appearances in the trace. SBC reduces the size of SPEC CPU2000 Dinero instruction and data address traces from 18 to 309 times, outperforming the best trace compression techniques presented in the open literature. SBC can be successfully combined with general-purpose compression techniques. The combined SBC-gzip compression ratio is from 80 to 35,595, and the SBC-bzip2 compression ratio is from 75 to 191,257. Moreover, SBC outperforms other trace compression techniques when both decompression time and compression time are considered. This article also shows how the SBC algorithm can be modified for hardware implementation with very modest resources and only a minor loss in compression ratio.

show abstract

Compression techniques to simplify the analysis of large execution traces

Cited by 54 publications

References 6 publications

System Runs Analysis with Process Mining

System Runs Analysis with Process Mining

Dynamic decision tree for legacy use-case recovery

An efficient single-pass trace compression technique utilizing instruction streams

Contact Info

Product

Resources

About