Efficient online algorithm for identifying useless states in distributed systems

Abstract

In a distributed system, detecting whether a given logical predicate is true on the global states is fundamental for testing and debugging the program. Detecting predicates by examining all global states is intractable due to the combinatorial nature of the problem. This work designs an efficient online algorithm that identifies the consistent and useless states each time a new state is reported. This paper formulates the optimality of detecting algorithms in terms of pseudo states, which are employed to represent unknown states to the monitor process. Based on this technique, memory space of the debugger can be minimized by removing the useless states without affecting the debugging results. While minimizing memory space, the proposed algorithm requires only O( p 2 M) time in total, where p is the number of processes, and M is the number of reported states.

Design of a Sliding Window over Distributed and Asynchronous Event Streams

“…One critical challenge is that the lattice of snapshots evolves to exponential size in the worst-case. Various schemes are used to cope with the lattice explosion problem [24], [25], [27], [10], [28]. For example, in [24], [25], the authors proposed the computation slice to efficiently compute all global states which satisfy a regular predicate [24].…”