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 条
  • [21] The Power of Both Choices: Practical Load Balancing for Distributed Stream Processing Engines
    Nasir, Muhammad Anis Uddin
    De Francisci Morales, Gianmarco
    Garcia-Soriano, David
    Kourtellis, Nicolas
    Serafini, Marco
    2015 IEEE 31ST INTERNATIONAL CONFERENCE ON DATA ENGINEERING (ICDE), 2015, : 137 - 148
  • [22] Locality/Fairness-Aware Job Scheduling in Distributed Stream Processing Engines
    Son, Siwoon
    Moon, Yang-Sae
    ELECTRONICS, 2020, 9 (11) : 1 - 24
  • [23] Mobile Storm: Distributed Real-time Stream Processing for Mobile Clouds
    Ning, Qian
    Chen, Chien-An
    Stoleru, Radu
    Chen, Congcong
    2015 IEEE 4TH INTERNATIONAL CONFERENCE ON CLOUD NETWORKING (CLOUDNET), 2015, : 139 - 145
  • [24] SDDA-IoT: storm-based distributed detection approach for IoT network traffic-based DDoS attacks
    Shukla, Praveen
    Krishna, C. Rama
    Patil, Nilesh Vishwasrao
    CLUSTER COMPUTING-THE JOURNAL OF NETWORKS SOFTWARE TOOLS AND APPLICATIONS, 2024, 27 (05): : 6397 - 6424
  • [25] MF-Storm: a maximum flow-based job scheduler for stream processing engines on computational clusters to increase throughput
    Muhammad, Asif
    Qadir, Muhammad Abdul
    PEERJ COMPUTER SCIENCE, 2022, 8
  • [26] Distributed Linked Stream Data Query System Architecture Based on STORM
    Lu, Guanzi
    Zhu, Bin
    Li, Guanyu
    2017 IEEE 2ND INTERNATIONAL CONFERENCE ON BIG DATA ANALYSIS (ICBDA), 2017, : 129 - 134
  • [27] Rafiki: Task-Level Capacity Planning in Distributed Stream Processing Systems
    Pfister, Benjamin J. J.
    Lickefett, Wolf S.
    Nitschke, Jan
    Paul, Sumit
    Geldenhuys, Morgan K.
    Scheinert, Dominik
    Gontarska, Kordian
    Thamsen, Lauritz
    EURO-PAR 2021: PARALLEL PROCESSING WORKSHOPS, 2022, 13098 : 352 - 363
  • [28] Topology-Aware Task Allocation for Distributed Stream Processing with Latency Guarantee
    Wei, Xiaohui
    Wei, Xun
    Li, Hongliang
    Zhuang, Yuan
    Yue, Hengshan
    ICAIP 2018: 2018 THE 2ND INTERNATIONAL CONFERENCE ON ADVANCES IN IMAGE PROCESSING, 2018, : 245 - 251
  • [29] Toward Predictive Failure Management for Distributed Stream Processing Systems
    Gu, Xiaohui
    Papadimitriou, Spiros
    Yu, Philip S.
    Chang, Shu-Ping
    28TH INTERNATIONAL CONFERENCE ON DISTRIBUTED COMPUTING SYSTEMS, VOLS 1 AND 2, PROCEEDINGS, 2008, : 825 - +
  • [30] Comparison of Meta-Heuristic Algorithms for Task Scheduling in Distributed Stream Processing
    Kim, Dohan
    Wu, Aming
    Kwon, Young-Woo
    2022 IEEE 27TH PACIFIC RIM INTERNATIONAL SYMPOSIUM ON DEPENDABLE COMPUTING (PRDC), 2022, : 252 - 255