Budget-deadline constrained approach for scientific workflows scheduling in a cloud environment
In cloud computing environments, it is a great challenge to schedule a workflow application because it is an NP-complete problem. Particularly, scheduling workflows with different Quality of Service (QoS) constraints makes the problem more complex. Several approaches have been proposed for QoS workf...
Gespeichert in:
Veröffentlicht in: | Cluster computing 2023-06, Vol.26 (3), p.1737-1751 |
---|---|
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 | 1751 |
---|---|
container_issue | 3 |
container_start_page | 1737 |
container_title | Cluster computing |
container_volume | 26 |
creator | Zhou, Naqin Lin, Weiwei Feng, Wei Shi, Fang Pang, Xiongwen |
description | In cloud computing environments, it is a great challenge to schedule a workflow application because it is an NP-complete problem. Particularly, scheduling workflows with different Quality of Service (QoS) constraints makes the problem more complex. Several approaches have been proposed for QoS workflow scheduling, but most of them are focused on a single QoS constraint. Therefore, this paper presents a new algorithm for multi-QoS constrained workflow scheduling, cost, and time, named Budget-Deadline Constrained Workflow Scheduling (BDCWS). The algorithm builds the task optimistic available budget based on the execution cost of the task on the slowest virtual machine and the optimistic spare budget, and then builds the set of affordable virtual machines according to the task optimistic available budget to control the range of virtual machine selection, and thus effectively controls the task execution cost. Finally, a new balance factor and selection strategy are given according to the optimistic spare deadline and the optimistic spare budget, so that the execution cost and time consumption of the control task are more effective. To evaluate the proposed algorithm, we experimentally evaluated our algorithm using real-world workflow applications. The experimental results show that compared with DBWS (Deadline-Budget Workflow Scheduling) and BDAS (Budget-Deadline Aware Scheduling), the proposed algorithm has a 26.3–79.7% higher success rate. Especially when the deadline and budget are tight, the improvement is more obvious. In addition, the best cost frequency of our algorithm achieves a 98%, which is more cost-competitive than DBWS. |
doi_str_mv | 10.1007/s10586-020-03176-1 |
format | Article |
fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_2918272652</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2918272652</sourcerecordid><originalsourceid>FETCH-LOGICAL-c319t-ccf716e9b0f63b30558571690f6a887fd432fb0d7e0b3caf850cf15b119742413</originalsourceid><addsrcrecordid>eNp9UMlOwzAUtBBIlMIPcLLEOfBsx3FyhIpNqsQFzpbjpU1J7WInVPw9LkHixultM_NGg9AlgWsCIG4SAV5XBVAogBFRFeQIzQgXrBC8ZMe5Z_ksai5O0VlKGwBoBG1mSN6NZmWHwlhl-s5brINPQ1S5NVjtdjEovcYuRJx0Z_3QuU7jfYjvrg_7lJdra8ZMXOHOY4V1H0aDrf_sYvDbjD9HJ071yV781jl6e7h_XTwVy5fH58XtstCMNEOhtROksk0LrmItA86zVVI1eVR1LZwpGXUtGGGhZVq5moN2hLeENKKkJWFzdDXpZscfo02D3IQx-vxS0obUVNCK04yiE0rHkFK0Tu5it1XxSxKQhyDlFKTMQcqfIOVBmk2klMF-ZeOf9D-sbwqCdxA</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2918272652</pqid></control><display><type>article</type><title>Budget-deadline constrained approach for scientific workflows scheduling in a cloud environment</title><source>SpringerLink Journals</source><source>ProQuest Central UK/Ireland</source><source>ProQuest Central</source><creator>Zhou, Naqin ; Lin, Weiwei ; Feng, Wei ; Shi, Fang ; Pang, Xiongwen</creator><creatorcontrib>Zhou, Naqin ; Lin, Weiwei ; Feng, Wei ; Shi, Fang ; Pang, Xiongwen</creatorcontrib><description>In cloud computing environments, it is a great challenge to schedule a workflow application because it is an NP-complete problem. Particularly, scheduling workflows with different Quality of Service (QoS) constraints makes the problem more complex. Several approaches have been proposed for QoS workflow scheduling, but most of them are focused on a single QoS constraint. Therefore, this paper presents a new algorithm for multi-QoS constrained workflow scheduling, cost, and time, named Budget-Deadline Constrained Workflow Scheduling (BDCWS). The algorithm builds the task optimistic available budget based on the execution cost of the task on the slowest virtual machine and the optimistic spare budget, and then builds the set of affordable virtual machines according to the task optimistic available budget to control the range of virtual machine selection, and thus effectively controls the task execution cost. Finally, a new balance factor and selection strategy are given according to the optimistic spare deadline and the optimistic spare budget, so that the execution cost and time consumption of the control task are more effective. To evaluate the proposed algorithm, we experimentally evaluated our algorithm using real-world workflow applications. The experimental results show that compared with DBWS (Deadline-Budget Workflow Scheduling) and BDAS (Budget-Deadline Aware Scheduling), the proposed algorithm has a 26.3–79.7% higher success rate. Especially when the deadline and budget are tight, the improvement is more obvious. In addition, the best cost frequency of our algorithm achieves a 98%, which is more cost-competitive than DBWS.</description><identifier>ISSN: 1386-7857</identifier><identifier>EISSN: 1573-7543</identifier><identifier>DOI: 10.1007/s10586-020-03176-1</identifier><language>eng</language><publisher>New York: Springer US</publisher><subject>Algorithms ; Budgets ; Cloud computing ; Computer Communication Networks ; Computer Science ; Constraints ; Control tasks ; Costs ; Critical path ; Deadlines ; Heuristic ; Operating Systems ; Optimization ; Processor Architectures ; Quality of service ; Scheduling ; Task scheduling ; Virtual environments ; Workflow software</subject><ispartof>Cluster computing, 2023-06, Vol.26 (3), p.1737-1751</ispartof><rights>Springer Science+Business Media, LLC, part of Springer Nature 2020</rights><rights>Springer Science+Business Media, LLC, part of Springer Nature 2020.</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c319t-ccf716e9b0f63b30558571690f6a887fd432fb0d7e0b3caf850cf15b119742413</citedby><cites>FETCH-LOGICAL-c319t-ccf716e9b0f63b30558571690f6a887fd432fb0d7e0b3caf850cf15b119742413</cites><orcidid>0000-0001-6876-1795</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/s10586-020-03176-1$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://www.proquest.com/docview/2918272652?pq-origsite=primo$$EHTML$$P50$$Gproquest$$H</linktohtml><link.rule.ids>314,780,784,21388,27924,27925,33744,41488,42557,43805,51319,64385,64389,72469</link.rule.ids></links><search><creatorcontrib>Zhou, Naqin</creatorcontrib><creatorcontrib>Lin, Weiwei</creatorcontrib><creatorcontrib>Feng, Wei</creatorcontrib><creatorcontrib>Shi, Fang</creatorcontrib><creatorcontrib>Pang, Xiongwen</creatorcontrib><title>Budget-deadline constrained approach for scientific workflows scheduling in a cloud environment</title><title>Cluster computing</title><addtitle>Cluster Comput</addtitle><description>In cloud computing environments, it is a great challenge to schedule a workflow application because it is an NP-complete problem. Particularly, scheduling workflows with different Quality of Service (QoS) constraints makes the problem more complex. Several approaches have been proposed for QoS workflow scheduling, but most of them are focused on a single QoS constraint. Therefore, this paper presents a new algorithm for multi-QoS constrained workflow scheduling, cost, and time, named Budget-Deadline Constrained Workflow Scheduling (BDCWS). The algorithm builds the task optimistic available budget based on the execution cost of the task on the slowest virtual machine and the optimistic spare budget, and then builds the set of affordable virtual machines according to the task optimistic available budget to control the range of virtual machine selection, and thus effectively controls the task execution cost. Finally, a new balance factor and selection strategy are given according to the optimistic spare deadline and the optimistic spare budget, so that the execution cost and time consumption of the control task are more effective. To evaluate the proposed algorithm, we experimentally evaluated our algorithm using real-world workflow applications. The experimental results show that compared with DBWS (Deadline-Budget Workflow Scheduling) and BDAS (Budget-Deadline Aware Scheduling), the proposed algorithm has a 26.3–79.7% higher success rate. Especially when the deadline and budget are tight, the improvement is more obvious. In addition, the best cost frequency of our algorithm achieves a 98%, which is more cost-competitive than DBWS.</description><subject>Algorithms</subject><subject>Budgets</subject><subject>Cloud computing</subject><subject>Computer Communication Networks</subject><subject>Computer Science</subject><subject>Constraints</subject><subject>Control tasks</subject><subject>Costs</subject><subject>Critical path</subject><subject>Deadlines</subject><subject>Heuristic</subject><subject>Operating Systems</subject><subject>Optimization</subject><subject>Processor Architectures</subject><subject>Quality of service</subject><subject>Scheduling</subject><subject>Task scheduling</subject><subject>Virtual environments</subject><subject>Workflow software</subject><issn>1386-7857</issn><issn>1573-7543</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2023</creationdate><recordtype>article</recordtype><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><sourceid>GNUQQ</sourceid><recordid>eNp9UMlOwzAUtBBIlMIPcLLEOfBsx3FyhIpNqsQFzpbjpU1J7WInVPw9LkHixultM_NGg9AlgWsCIG4SAV5XBVAogBFRFeQIzQgXrBC8ZMe5Z_ksai5O0VlKGwBoBG1mSN6NZmWHwlhl-s5brINPQ1S5NVjtdjEovcYuRJx0Z_3QuU7jfYjvrg_7lJdra8ZMXOHOY4V1H0aDrf_sYvDbjD9HJ071yV781jl6e7h_XTwVy5fH58XtstCMNEOhtROksk0LrmItA86zVVI1eVR1LZwpGXUtGGGhZVq5moN2hLeENKKkJWFzdDXpZscfo02D3IQx-vxS0obUVNCK04yiE0rHkFK0Tu5it1XxSxKQhyDlFKTMQcqfIOVBmk2klMF-ZeOf9D-sbwqCdxA</recordid><startdate>20230601</startdate><enddate>20230601</enddate><creator>Zhou, Naqin</creator><creator>Lin, Weiwei</creator><creator>Feng, Wei</creator><creator>Shi, Fang</creator><creator>Pang, Xiongwen</creator><general>Springer US</general><general>Springer Nature B.V</general><scope>AAYXX</scope><scope>CITATION</scope><scope>8FE</scope><scope>8FG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>GNUQQ</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K7-</scope><scope>P5Z</scope><scope>P62</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><orcidid>https://orcid.org/0000-0001-6876-1795</orcidid></search><sort><creationdate>20230601</creationdate><title>Budget-deadline constrained approach for scientific workflows scheduling in a cloud environment</title><author>Zhou, Naqin ; Lin, Weiwei ; Feng, Wei ; Shi, Fang ; Pang, Xiongwen</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c319t-ccf716e9b0f63b30558571690f6a887fd432fb0d7e0b3caf850cf15b119742413</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2023</creationdate><topic>Algorithms</topic><topic>Budgets</topic><topic>Cloud computing</topic><topic>Computer Communication Networks</topic><topic>Computer Science</topic><topic>Constraints</topic><topic>Control tasks</topic><topic>Costs</topic><topic>Critical path</topic><topic>Deadlines</topic><topic>Heuristic</topic><topic>Operating Systems</topic><topic>Optimization</topic><topic>Processor Architectures</topic><topic>Quality of service</topic><topic>Scheduling</topic><topic>Task scheduling</topic><topic>Virtual environments</topic><topic>Workflow software</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Zhou, Naqin</creatorcontrib><creatorcontrib>Lin, Weiwei</creatorcontrib><creatorcontrib>Feng, Wei</creatorcontrib><creatorcontrib>Shi, Fang</creatorcontrib><creatorcontrib>Pang, Xiongwen</creatorcontrib><collection>CrossRef</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Central UK/Ireland</collection><collection>Advanced Technologies & Aerospace Collection</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>ProQuest Central Student</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Computer Science Collection</collection><collection>Computer Science Database</collection><collection>Advanced Technologies & Aerospace Database</collection><collection>ProQuest Advanced Technologies & Aerospace Collection</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><jtitle>Cluster computing</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Zhou, Naqin</au><au>Lin, Weiwei</au><au>Feng, Wei</au><au>Shi, Fang</au><au>Pang, Xiongwen</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Budget-deadline constrained approach for scientific workflows scheduling in a cloud environment</atitle><jtitle>Cluster computing</jtitle><stitle>Cluster Comput</stitle><date>2023-06-01</date><risdate>2023</risdate><volume>26</volume><issue>3</issue><spage>1737</spage><epage>1751</epage><pages>1737-1751</pages><issn>1386-7857</issn><eissn>1573-7543</eissn><abstract>In cloud computing environments, it is a great challenge to schedule a workflow application because it is an NP-complete problem. Particularly, scheduling workflows with different Quality of Service (QoS) constraints makes the problem more complex. Several approaches have been proposed for QoS workflow scheduling, but most of them are focused on a single QoS constraint. Therefore, this paper presents a new algorithm for multi-QoS constrained workflow scheduling, cost, and time, named Budget-Deadline Constrained Workflow Scheduling (BDCWS). The algorithm builds the task optimistic available budget based on the execution cost of the task on the slowest virtual machine and the optimistic spare budget, and then builds the set of affordable virtual machines according to the task optimistic available budget to control the range of virtual machine selection, and thus effectively controls the task execution cost. Finally, a new balance factor and selection strategy are given according to the optimistic spare deadline and the optimistic spare budget, so that the execution cost and time consumption of the control task are more effective. To evaluate the proposed algorithm, we experimentally evaluated our algorithm using real-world workflow applications. The experimental results show that compared with DBWS (Deadline-Budget Workflow Scheduling) and BDAS (Budget-Deadline Aware Scheduling), the proposed algorithm has a 26.3–79.7% higher success rate. Especially when the deadline and budget are tight, the improvement is more obvious. In addition, the best cost frequency of our algorithm achieves a 98%, which is more cost-competitive than DBWS.</abstract><cop>New York</cop><pub>Springer US</pub><doi>10.1007/s10586-020-03176-1</doi><tpages>15</tpages><orcidid>https://orcid.org/0000-0001-6876-1795</orcidid></addata></record> |
fulltext | fulltext |
identifier | ISSN: 1386-7857 |
ispartof | Cluster computing, 2023-06, Vol.26 (3), p.1737-1751 |
issn | 1386-7857 1573-7543 |
language | eng |
recordid | cdi_proquest_journals_2918272652 |
source | SpringerLink Journals; ProQuest Central UK/Ireland; ProQuest Central |
subjects | Algorithms Budgets Cloud computing Computer Communication Networks Computer Science Constraints Control tasks Costs Critical path Deadlines Heuristic Operating Systems Optimization Processor Architectures Quality of service Scheduling Task scheduling Virtual environments Workflow software |
title | Budget-deadline constrained approach for scientific workflows scheduling in a cloud environment |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-01T14%3A04%3A14IST&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=Budget-deadline%20constrained%20approach%20for%20scientific%20workflows%20scheduling%20in%20a%20cloud%20environment&rft.jtitle=Cluster%20computing&rft.au=Zhou,%20Naqin&rft.date=2023-06-01&rft.volume=26&rft.issue=3&rft.spage=1737&rft.epage=1751&rft.pages=1737-1751&rft.issn=1386-7857&rft.eissn=1573-7543&rft_id=info:doi/10.1007/s10586-020-03176-1&rft_dat=%3Cproquest_cross%3E2918272652%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=2918272652&rft_id=info:pmid/&rfr_iscdi=true |