Online Nonstop Task Management for Storm-Based Distributed Stream Processing Engines

被引:0
|
作者
Zhang, Zhou [1 ,2 ]
Jin, Pei-Quan [1 ,2 ]
Xie, Xi-Ke [1 ]
Wang, Xiao-Liang [1 ,2 ]
Liu, Rui-Cheng [1 ,2 ]
Wan, Shou-Hong [1 ,2 ]
机构
[1] Univ Sci & Technol China, Sch Comp Sci & Technol, Hefei 230026, Peoples R China
[2] Chinese Acad Sci, Key Lab Electromagnet Space Informat, Hefei 230026, Peoples R China
基金
中国国家自然科学基金;
关键词
distributed stream processing engine (DSPE); Apache Storm; online task migration; online task deployment; REAL-TIME;
D O I
10.1007/s11390-021-1629-9
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Most distributed stream processing engines (DSPEs) do not support online task management and cannot adapt to time-varying data flows. Recently, some studies have proposed online task deployment algorithms to solve this problem. However, these approaches do not guarantee the Quality of Service (QoS) when the task deployment changes at runtime, because the task migrations caused by the change of task deployments will impose an exorbitant cost. We study one of the most popular DSPEs, Apache Storm, and find out that when a task needs to be migrated, Storm has to stop the resource (implemented as a process of Worker in Storm) where the task is deployed. This will lead to the stop and restart of all tasks in the resource, resulting in the poor performance of task migrations. Aiming to solve this problem, in this paper, we propose N-Storm (Nonstop Storm), which is a task-resource decoupling DSPE. N-Storm allows tasks allocated to resources to be changed at runtime, which is implemented by a thread-level scheme for task migrations. Particularly, we add a local shared key/value store on each node to make resources aware of the changes in the allocation plan. Thus, each resource can manage its tasks at runtime. Based on N-Storm, we further propose Online Task Deployment (OTD). Differing from traditional task deployment algorithms that deploy all tasks at once without considering the cost of task migrations caused by a task re-deployment, OTD can gradually adjust the current task deployment to an optimized one based on the communication cost and the runtime states of resources. We demonstrate that OTD can adapt to different kinds of applications including computation- and communication-intensive applications. The experimental results on a real DSPE cluster show that N-Storm can avoid the system stop and save up to 87% of the performance degradation time, compared with Apache Storm and other state-of-the-art approaches. In addition, OTD can increase the average CPU usage by 51% for computation-intensive applications and reduce network communication costs by 88% for communication-intensive applications.
引用
收藏
页码:116 / 138
页数:23
相关论文
共 50 条
  • [1] Throughput optimization for Storm-based processing of stream data on clouds
    Cao, Huiyan
    Wu, Chase Q.
    Bao, Liang
    Hou, Aiqin
    Shen, Wei
    FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE, 2020, 112 (112): : 567 - 579
  • [2] Storm-based distributed sampling system for multi-source stream environment
    Cho, Wonhyeong
    Gil, Myeong-Seon
    Choi, Mi-Jung
    Moon, Yang-Sae
    INTERNATIONAL JOURNAL OF DISTRIBUTED SENSOR NETWORKS, 2018, 14 (11):
  • [3] E-Storm: Replication-based State Management in Distributed Stream Processing Systems
    Liu, Xunyun
    Harwood, Aaron
    Karunasekera, Shanika
    Rubinstein, Benjamin
    Buyya, Rajkumar
    2017 46TH INTERNATIONAL CONFERENCE ON PARALLEL PROCESSING (ICPP), 2017, : 571 - 580
  • [4] A Storm-based Sampling System for Multi-source Stream Environment
    Cho, Wonhyeong
    Gil, Myeong-Seon
    Lee, Sanghun
    Moon, Yang-Sae
    2018 IEEE INTERNATIONAL CONFERENCE ON BIG DATA AND SMART COMPUTING (BIGCOMP), 2018, : 503 - 506
  • [5] Task Allocation for Distributed Stream Processing
    Eidenbenz, Raphael
    Locher, Thomas
    IEEE INFOCOM 2016 - THE 35TH ANNUAL IEEE INTERNATIONAL CONFERENCE ON COMPUTER COMMUNICATIONS, 2016,
  • [6] SLA-Based Adaptation Schemes in Distributed Stream Processing Engines
    Hanif, Muhammad
    Kim, Eunsam
    Helal, Sumi
    Lee, Choonhwa
    APPLIED SCIENCES-BASEL, 2019, 9 (06):
  • [7] Rhino: Efficient Management of Very Large Distributed State for Stream Processing Engines
    Del Monte, Bonaventura
    Zeuch, Steffen
    Rabl, Tilmann
    Markl, Volker
    SIGMOD'20: PROCEEDINGS OF THE 2020 ACM SIGMOD INTERNATIONAL CONFERENCE ON MANAGEMENT OF DATA, 2020, : 2471 - 2486
  • [8] Duality-Based Locality-Aware Stream Partitioning in Distributed Stream Processing Engines
    Son, Siwoon
    Moon, Yang-Sae
    EURO-PAR 2019: PARALLEL PROCESSING WORKSHOPS, 2020, 11997 : 725 - 730
  • [9] How to Measure Scalability of Distributed Stream Processing Engines?
    Henning, Soeren
    Hasselbring, Wilhelm
    COMPANION OF THE ACM/SPEC INTERNATIONAL CONFERENCE ON PERFORMANCE ENGINEERING, ICPE 2021, 2021, : 85 - 88
  • [10] A Backpressure Mitigation Scheme in Distributed Stream Processing Engines
    Hanif, Muhammad
    Yoon, Hyeongdeok
    Lee, Choonhwa
    2020 34TH INTERNATIONAL CONFERENCE ON INFORMATION NETWORKING (ICOIN 2020), 2020, : 713 - 716