As if Time Had Stopped – Checking Memory Dumps for Quasi-Instantaneous Consistency

07/22/2023
by   Jenny Ottmann, et al.
0

Memory dumps that are acquired while the system is running often contain inconsistencies like page smearing which hamper the analysis. One possibility to avoid inconsistencies is to pause the system during the acquisition and take an instantaneous memory dump. While this is possible for virtual machines, most systems cannot be frozen and thus the ideal dump can only be quasi-instantaneous, i.e., consistent despite the system running. In this article, we introduce a method allowing us to measure quasi-instantaneous consistency and show both, theoretically, and practically, that our method is valid but that in reality, dumps can be but usually are not quasi-instantaneously consistent. For the assessment, we run a pivot program enabling the evaluation of quasi-instantaneous consistency for its heap and allowing us to pinpoint where exactly inconsistencies occurred.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/21/2020

A Framework for Consistency Algorithms

We present a framework that provides deterministic consistency algorithm...
research
01/20/2023

Ideal presentations and numberings of some classes of effective quasi-Polish spaces

The well known ideal presentations of countably based domains were recen...
research
04/20/2020

Quasi-planar monomials over finite fields

Motivated by several recent results, we give some new classes of quasi-p...
research
11/19/2019

Cichlid: Explicit physical memory management for large machines

In this paper, we rethink how an OS supports virtual memory. Classical V...
research
06/30/2021

Constructing the space of valuations of a quasi-Polish space as a space of ideals

We construct the space of valuations on a quasi-Polish space in terms of...
research
06/28/2019

Robustness Against Transactional Causal Consistency

Distributed storage systems and databases are widely used by various typ...
research
11/10/2021

Rooted quasi-Stirling permutations of general multisets

Given a general multiset ℳ={1^m_1,2^m_2,…,n^m_n}, where i appears m_i ti...

Please sign up or login with your details

Forgot password? Click here to reset