TY - GEN
T1 - SPECTRE
T2 - 18th ACM/IFIP/USENIX Middleware Conference, Middleware 2017
AU - Mayer, Ruben
AU - Slo, Ahmad
AU - Tariq, Muhammad Adnan
AU - Rothermel, Kurt
AU - Graber, Manuel
AU - Ramachandran, Umakishore
N1 - Publisher Copyright:
© 2017 ACM.
PY - 2017/12/11
Y1 - 2017/12/11
N2 - Distributed Complex Event Processing (DCEP) is a paradigm to infer the occurrence of complex situations in the surrounding world from basic events like sensor readings. In doing so, DCEP operators detect event patterns on their incoming event streams. To yield high operator throughput, data parallelization frameworks divide the incoming event streams of an operator into overlapping windows that are processed in parallel by a number of operator instances. In doing so, the basic assumption is that the difierent windows can be processed independently from each other. However, consumption policies enforce that events can only be part of one pattern instance; then, they are consumed, i.e., removed from further pattern detection. That implies that the constituent events of a pattern instance detected in one window are excluded from all other windows as well, which breaks the data parallelism between difierent windows. In this paper, we tackle this problem by means of speculation: Based on the likelihood of an event's consumption in a window, subsequent windows may speculatively suppress that event. We propose the SPECTRE framework for speculative processing of multiple dependent windows in parallel. Our evaluations show an up to linear scalability of SPECTRE with the number of CPU cores.
AB - Distributed Complex Event Processing (DCEP) is a paradigm to infer the occurrence of complex situations in the surrounding world from basic events like sensor readings. In doing so, DCEP operators detect event patterns on their incoming event streams. To yield high operator throughput, data parallelization frameworks divide the incoming event streams of an operator into overlapping windows that are processed in parallel by a number of operator instances. In doing so, the basic assumption is that the difierent windows can be processed independently from each other. However, consumption policies enforce that events can only be part of one pattern instance; then, they are consumed, i.e., removed from further pattern detection. That implies that the constituent events of a pattern instance detected in one window are excluded from all other windows as well, which breaks the data parallelism between difierent windows. In this paper, we tackle this problem by means of speculation: Based on the likelihood of an event's consumption in a window, subsequent windows may speculatively suppress that event. We propose the SPECTRE framework for speculative processing of multiple dependent windows in parallel. Our evaluations show an up to linear scalability of SPECTRE with the number of CPU cores.
KW - Complex Event Processing
KW - Consumption Policy
KW - Data Parallelization
KW - Event Consumption
KW - Speculation
UR - http://www.scopus.com/inward/record.url?scp=85041207903&partnerID=8YFLogxK
U2 - 10.1145/3135974.3135983
DO - 10.1145/3135974.3135983
M3 - Conference contribution
AN - SCOPUS:85041207903
T3 - Middleware 2017 - Proceedings of the 2017 International Middleware Conference
SP - 161
EP - 173
BT - Middleware 2017 - Proceedings of the 2017 International Middleware Conference
PB - Association for Computing Machinery, Inc
Y2 - 11 December 2017 through 15 December 2017
ER -