Placement of replicated tasks for distributed stream processing systems
Proceedings of the Fourth ACM International Conference on Distributed Event-Based Systems
M-TOP: multi-target operator placement of query graphs for data streams
Proceedings of the 15th Symposium on International Database Engineering & Applications
Elastic complex event processing
Proceedings of the 8th Middleware Doctoral Symposium
Processing flows of information: From data stream to complex event processing
ACM Computing Surveys (CSUR)
| Hi-index | 0.00 |
Optimally assigning streaming tasks to network machines is a key factor that influences a large data-stream-processing system's performance. Although researchers have prototyped and investigated various algorithms for task placement in data stream management systems, taxonomies and surveys of such algorithms are currently unavailable. To tackle this knowledge gap, the authors identify a set of core placement design characteristics and use them compare eight placement algorithms. They also present a heuristic decision tree that can help designers judge how suitable a given placement solutions might be to specific problems.