Proceedings of the 11th ACM International Conference on Distributed and Event-Based Systems 2017
DOI: 10.1145/3093742.3093921
|View full text |Cite
|
Sign up to set email alerts
|

Maximizing Determinism in Stream Processing Under Latency Constraints

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
13
0

Year Published

2018
2018
2022
2022

Publication Types

Select...
4
3
1

Relationship

1
7

Authors

Journals

citations
Cited by 27 publications
(13 citation statements)
references
References 18 publications
0
13
0
Order By: Relevance
“…We assumed a hierarchical organization of edge nodes; multiple event sinks within non-hierarchical systems [28] can achieve highly decentralized systems and compositional applications. Moreover, we ignored management of outof-order events [29] and their effect [30], rendering our approach opportunistic. Furthermore, hyperproperties relating multiple computation traces with each other have been theoretically investigated; in such properties, it is necessary to store previously seen traces, and to relate new traces to the traces seen so far.…”
Section: Complex Event Processing and Data Streamsmentioning
confidence: 99%
“…We assumed a hierarchical organization of edge nodes; multiple event sinks within non-hierarchical systems [28] can achieve highly decentralized systems and compositional applications. Moreover, we ignored management of outof-order events [29] and their effect [30], rendering our approach opportunistic. Furthermore, hyperproperties relating multiple computation traces with each other have been theoretically investigated; in such properties, it is necessary to store previously seen traces, and to relate new traces to the traces seen so far.…”
Section: Complex Event Processing and Data Streamsmentioning
confidence: 99%
“…Stream Processing in a nutshell. Stream processing is leveraged in large distributed systems [1,2,7,9,10,13,22,23] to process unbounded streams of tuples. Stream processing applications are defined as Directed Acyclic Graphs of operators that transform the tuples delivered by a set of data sources and produce new streams of tuples that are eventually delivered to end-users.…”
Section: Talk Overviewmentioning
confidence: 99%
“…Most recently, reference [31] utilizes workload estimation from [32] together with operator-profiling for parallelizing. Reference [33] handles unordered arrival of multiple unsynchronized input sources by newly defining slack-ready tuple to provide a deterministic solution while keeping real-time requirement satisfaction. Reference [34] maps workload partitioning and scheduling in clustered Storm [11] which is stream-based engine into the graph-partitioning problem to come through the high performance of resource utilization which reducing network loads.…”
Section: Task Distribution Provision On Cepmentioning
confidence: 99%