Event Stream Processing with Multiple Threads

TL;DR

This paper introduces multi-threading extensions to the BeepBeep 3 event stream engine, significantly improving evaluation speed for large event traces through various parallelization strategies.

Contribution

It presents novel multi-threading strategies for event stream processing and empirically evaluates their effectiveness within the BeepBeep framework.

Findings

Multi-threading dramatically reduces processing time.

Parallelization strategies improve performance on large event traces.

Empirical evaluation confirms efficiency gains.

Abstract

Current runtime verification tools seldom make use of multi-threading to speed up the evaluation of a property on a large event trace. In this paper, we present an extension to the BeepBeep 3 event stream engine that allows the use of multiple threads during the evaluation of a query. Various parallelization strategies are presented and described on simple examples. The implementation of these strategies is then evaluated empirically on a sample of problems. Compared to the previous, single-threaded version of the BeepBeep engine, the allocation of just a few threads to specific portions of a query provides dramatic improvement in terms of running time.