Dynamic algorithm selection for the logic of tasks in IoT stream processing systems
| Autor: | Ehsan Poormohammady, Jens Helge Reelfs, Klaus Wehrle, Apostolos Papageorgiou, Mirko Stoffers |
|---|---|
| Rok vydání: | 2017 |
| Předmět: |
0209 industrial biotechnology
Optimization problem business.industry Computer science Distributed computing Service management Cloud computing 02 engineering and technology Load balancing (computing) Stream processing Statistical classification 020901 industrial engineering & automation Dynamic problem 020204 information systems 0202 electrical engineering electronic engineering information engineering Use case business |
| Zdroj: | CNSM |
| DOI: | 10.23919/cnsm.2017.8256009 |
| Popis: | Various Internet of Things (IoT) and Industry 4.0 use cases, such as city-wide monitoring or machine control, require low-latency distributed processing of continuous data streams. This fact has boosted research on making Stream Processing Frameworks (SPFs) IoT-ready, meaning that their cloud and IoT service management mechanisms (e.g., task placement, load balancing, algorithm selection) need to consider new requirements, e.g., ultra low latency due to physical interactions. The algorithm selection problem refers to selecting dynamically which internal logic a deployed streaming task should use in case of various alternatives, but it is not sufficiently supported in current SPFs. To the best of our knowledge, this work is the first to add this capability to SPFs. Our solution is based on i) architectural extensions of typical SPF middleware, ii) a new schema for characterizing algorithmic performance in the targeted context, and iii) a streaming-specific optimization problem formulation. We implemented our solution as an extension to Apache Storm and demonstrate how it can reduce stream processing latency by up to a factor of 2.9 in the tested scenarios. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|