Efficient Model to Query and Visualize the System States Extracted from Trace Data

Alexandre Montplaisir; Naser Ezzati-Jivan; Florian Wininger; Michel R. Dagenais

doi:10.1007/978-3-642-40787-1_13

2013 · Runtime Verification 2013 (RV 2013)

Efficient Model to Query and Visualize the System States Extracted from Trace Data

Alexandre Montplaisir | Naser Ezzati-Jivan | Florian Wininger | Michel R. Dagenais

Evidence basis: abstract-and-metadata-reviewed · Review status: catalog-reviewed; paper-author approval pending

trace-abstraction trace-visualization trace-analysis performance-analysis

system states trace queries trace visualization interval data tree-based storage online analysis offline analysis

Core contribution: The abstract presents a model for querying and visualizing system states extracted from very large traces.

Catalog abstract summary

The accessible chapter preview describes a tree-based model of system states and intervals extracted from traces, with online/offline operation and interactive analysis at approximately 1 TB trace scale.

Source: Springer two-page chapter preview, paraphrased; complete chapter not obtained.

Problem and motivation

State intervals extracted from traces need a representation that supports efficient queries and visualization at very large data volumes.

Method and contribution

The preview describes a tree-based state-history database that converts trace events into intervals and supports lookup for CPU, process, memory, file, and other resources at arbitrary timestamps. It names LTTng kernel/user-space tracing in the motivation and claims online and offline operation; the query language, storage details, and trace format require the complete chapter.

Findings and evidence

The preview reports interactive analysis of traces on the order of 1 TB and motivates avoiding repeated full-trace scans, but provides no reproducible dataset, benchmark table, throughput, latency, or comparison result.

Limitations and future directions

Limitations: Only the official two-page Springer preview was accessible; the complete algorithms, evaluation, limitations, and future-work section remain unavailable.

Future work: The paper-specific future-work section remains unverified because the complete chapter was not accessible.

Sources and identifiers

Published version published
Springer two-page chapter preview public_preview

When to cite this paper

Cite this paper when its specific method, evidence, or benchmark is directly relevant.

The paper's method is directly relevant.
The paper's evidence or benchmark is directly relevant.

Citation

@inproceedings{ezzatiJivan2013efficientmodel,
  author = {Alexandre Montplaisir and Naser Ezzati-Jivan and Florian Wininger and Michel R. Dagenais},
  title = {Efficient Model to Query and Visualize the System States Extracted from Trace Data},
  year = {2013},
  booktitle = {Runtime Verification 2013 (RV 2013)},
  pages = {219-234},
  publisher = {Springer Berlin Heidelberg},
  issn = {0302-9743, 1611-3349},
  isbn = {9783642407864, 9783642407871},
  doi = {10.1007/978-3-642-40787-1_13},
  url = {https://doi.org/10.1007/978-3-642-40787-1_13}
}

Other citation formats for Word and reference managers

Montplaisir, A., Ezzati-Jivan, N., Wininger, F., & Dagenais, M. R. (2013). Efficient Model to Query and Visualize the System States Extracted from Trace Data. In Runtime Verification 2013 (RV 2013) (pp. 219-234). https://doi.org/10.1007/978-3-642-40787-1_13

A. Montplaisir, N. Ezzati-Jivan, F. Wininger, and M. R. Dagenais, "Efficient Model to Query and Visualize the System States Extracted from Trace Data," in Runtime Verification 2013 (RV 2013), pp. 219-234, 2013, doi: 10.1007/978-3-642-40787-1_13

Readable Markdown record · JSON record · Download RIS