Online Nonstop Task Management for Storm-Based Distributed Stream Processing Engines
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)...
Gespeichert in:
Veröffentlicht in: | Journal of computer science and technology 2024-02, Vol.39 (1), p.116-138 |
---|---|
Hauptverfasser: | , , , , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | 138 |
---|---|
container_issue | 1 |
container_start_page | 116 |
container_title | Journal of computer science and technology |
container_volume | 39 |
creator | Zhang, Zhou Jin, Pei-Quan Xie, Xi-Ke Wang, Xiao-Liang Liu, Rui-Cheng Wan, Shou-Hong |
description | 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. |
doi_str_mv | 10.1007/s11390-021-1629-9 |
format | Article |
fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_3037526587</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>3037526587</sourcerecordid><originalsourceid>FETCH-LOGICAL-c339t-6c749ca24b1f61744180d9d04f2ccecbf041c85034dd912201388e2a6cf126303</originalsourceid><addsrcrecordid>eNqFUE1LAzEQXUTBWv0B3gKeozNJurs5aq0fUK3Qeg5pNrts7WZrkh7896as4Em8zDyY9zG8LLtEuEaA4iYgcgkUGFLMmaTyKBthmQMVhZDHCQMAlWmcZmchbAB4AUKMstXCbVtnyWvvQux3ZKXDB3nRTje2sy6SuvdkGXvf0TsdbEXu2xB9u97HhJfRW92RN98bG0LrGjJzTTIL59lJrbfBXvzscfb-MFtNn-h88fg8vZ1Tw7mMNDfpN6OZWGOdYyEEllDJCkTNjLFmXYNAU06Ai6qSyBggL0vLdG5qZDkHPs6uBt-d7z_3NkS16ffepUiVrsWE5ZOy-I-FskzhiYUDy_g-BG9rtfNtp_2XQlCHitVQsUoVq0PFSiYNGzQhcV1j_a_z36JvIXt8oQ</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>3037198617</pqid></control><display><type>article</type><title>Online Nonstop Task Management for Storm-Based Distributed Stream Processing Engines</title><source>Springer Nature - Complete Springer Journals</source><creator>Zhang, Zhou ; Jin, Pei-Quan ; Xie, Xi-Ke ; Wang, Xiao-Liang ; Liu, Rui-Cheng ; Wan, Shou-Hong</creator><creatorcontrib>Zhang, Zhou ; Jin, Pei-Quan ; Xie, Xi-Ke ; Wang, Xiao-Liang ; Liu, Rui-Cheng ; Wan, Shou-Hong</creatorcontrib><description>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.</description><identifier>ISSN: 1000-9000</identifier><identifier>EISSN: 1860-4749</identifier><identifier>DOI: 10.1007/s11390-021-1629-9</identifier><language>eng</language><publisher>Singapore: Springer Nature Singapore</publisher><subject>Algorithms ; Artificial Intelligence ; Communication ; Computation ; Computer Science ; Data Structures and Information Theory ; Decoupling ; Engines ; Information Systems Applications (incl.Internet) ; Performance degradation ; Regular Paper ; Run time (computers) ; Software Engineering ; Stream flow ; Task analysis ; Theory of Computation</subject><ispartof>Journal of computer science and technology, 2024-02, Vol.39 (1), p.116-138</ispartof><rights>Institute of Computing Technology, Chinese Academy of Sciences 2024</rights><rights>Institute of Computing Technology, Chinese Academy of Sciences 2024.</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><cites>FETCH-LOGICAL-c339t-6c749ca24b1f61744180d9d04f2ccecbf041c85034dd912201388e2a6cf126303</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/s11390-021-1629-9$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/s11390-021-1629-9$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>314,780,784,27915,27916,41479,42548,51310</link.rule.ids></links><search><creatorcontrib>Zhang, Zhou</creatorcontrib><creatorcontrib>Jin, Pei-Quan</creatorcontrib><creatorcontrib>Xie, Xi-Ke</creatorcontrib><creatorcontrib>Wang, Xiao-Liang</creatorcontrib><creatorcontrib>Liu, Rui-Cheng</creatorcontrib><creatorcontrib>Wan, Shou-Hong</creatorcontrib><title>Online Nonstop Task Management for Storm-Based Distributed Stream Processing Engines</title><title>Journal of computer science and technology</title><addtitle>J. Comput. Sci. Technol</addtitle><description>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.</description><subject>Algorithms</subject><subject>Artificial Intelligence</subject><subject>Communication</subject><subject>Computation</subject><subject>Computer Science</subject><subject>Data Structures and Information Theory</subject><subject>Decoupling</subject><subject>Engines</subject><subject>Information Systems Applications (incl.Internet)</subject><subject>Performance degradation</subject><subject>Regular Paper</subject><subject>Run time (computers)</subject><subject>Software Engineering</subject><subject>Stream flow</subject><subject>Task analysis</subject><subject>Theory of Computation</subject><issn>1000-9000</issn><issn>1860-4749</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2024</creationdate><recordtype>article</recordtype><recordid>eNqFUE1LAzEQXUTBWv0B3gKeozNJurs5aq0fUK3Qeg5pNrts7WZrkh7896as4Em8zDyY9zG8LLtEuEaA4iYgcgkUGFLMmaTyKBthmQMVhZDHCQMAlWmcZmchbAB4AUKMstXCbVtnyWvvQux3ZKXDB3nRTje2sy6SuvdkGXvf0TsdbEXu2xB9u97HhJfRW92RN98bG0LrGjJzTTIL59lJrbfBXvzscfb-MFtNn-h88fg8vZ1Tw7mMNDfpN6OZWGOdYyEEllDJCkTNjLFmXYNAU06Ai6qSyBggL0vLdG5qZDkHPs6uBt-d7z_3NkS16ffepUiVrsWE5ZOy-I-FskzhiYUDy_g-BG9rtfNtp_2XQlCHitVQsUoVq0PFSiYNGzQhcV1j_a_z36JvIXt8oQ</recordid><startdate>20240201</startdate><enddate>20240201</enddate><creator>Zhang, Zhou</creator><creator>Jin, Pei-Quan</creator><creator>Xie, Xi-Ke</creator><creator>Wang, Xiao-Liang</creator><creator>Liu, Rui-Cheng</creator><creator>Wan, Shou-Hong</creator><general>Springer Nature Singapore</general><general>Springer Nature B.V</general><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>20240201</creationdate><title>Online Nonstop Task Management for Storm-Based Distributed Stream Processing Engines</title><author>Zhang, Zhou ; Jin, Pei-Quan ; Xie, Xi-Ke ; Wang, Xiao-Liang ; Liu, Rui-Cheng ; Wan, Shou-Hong</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c339t-6c749ca24b1f61744180d9d04f2ccecbf041c85034dd912201388e2a6cf126303</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2024</creationdate><topic>Algorithms</topic><topic>Artificial Intelligence</topic><topic>Communication</topic><topic>Computation</topic><topic>Computer Science</topic><topic>Data Structures and Information Theory</topic><topic>Decoupling</topic><topic>Engines</topic><topic>Information Systems Applications (incl.Internet)</topic><topic>Performance degradation</topic><topic>Regular Paper</topic><topic>Run time (computers)</topic><topic>Software Engineering</topic><topic>Stream flow</topic><topic>Task analysis</topic><topic>Theory of Computation</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Zhang, Zhou</creatorcontrib><creatorcontrib>Jin, Pei-Quan</creatorcontrib><creatorcontrib>Xie, Xi-Ke</creatorcontrib><creatorcontrib>Wang, Xiao-Liang</creatorcontrib><creatorcontrib>Liu, Rui-Cheng</creatorcontrib><creatorcontrib>Wan, Shou-Hong</creatorcontrib><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>Journal of computer science and technology</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Zhang, Zhou</au><au>Jin, Pei-Quan</au><au>Xie, Xi-Ke</au><au>Wang, Xiao-Liang</au><au>Liu, Rui-Cheng</au><au>Wan, Shou-Hong</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Online Nonstop Task Management for Storm-Based Distributed Stream Processing Engines</atitle><jtitle>Journal of computer science and technology</jtitle><stitle>J. Comput. Sci. Technol</stitle><date>2024-02-01</date><risdate>2024</risdate><volume>39</volume><issue>1</issue><spage>116</spage><epage>138</epage><pages>116-138</pages><issn>1000-9000</issn><eissn>1860-4749</eissn><abstract>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.</abstract><cop>Singapore</cop><pub>Springer Nature Singapore</pub><doi>10.1007/s11390-021-1629-9</doi><tpages>23</tpages><oa>free_for_read</oa></addata></record> |
fulltext | fulltext |
identifier | ISSN: 1000-9000 |
ispartof | Journal of computer science and technology, 2024-02, Vol.39 (1), p.116-138 |
issn | 1000-9000 1860-4749 |
language | eng |
recordid | cdi_proquest_journals_3037526587 |
source | Springer Nature - Complete Springer Journals |
subjects | Algorithms Artificial Intelligence Communication Computation Computer Science Data Structures and Information Theory Decoupling Engines Information Systems Applications (incl.Internet) Performance degradation Regular Paper Run time (computers) Software Engineering Stream flow Task analysis Theory of Computation |
title | Online Nonstop Task Management for Storm-Based Distributed Stream Processing Engines |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-15T03%3A07%3A29IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Online%20Nonstop%20Task%20Management%20for%20Storm-Based%20Distributed%20Stream%20Processing%20Engines&rft.jtitle=Journal%20of%20computer%20science%20and%20technology&rft.au=Zhang,%20Zhou&rft.date=2024-02-01&rft.volume=39&rft.issue=1&rft.spage=116&rft.epage=138&rft.pages=116-138&rft.issn=1000-9000&rft.eissn=1860-4749&rft_id=info:doi/10.1007/s11390-021-1629-9&rft_dat=%3Cproquest_cross%3E3037526587%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=3037198617&rft_id=info:pmid/&rfr_iscdi=true |