A Dynamic Scheduling Workflow Algorithm Based On Critical Path
Abstract With the explosion in the size of scientific workflows, local workflows can no longer satisfy existing computing needs, and cloud computing platforms have become the first choice for scientific workflows. Compared with traditional local computing, cloud computing platform not only needs to...
Saved in:
Published in | Journal of physics. Conference series Vol. 1994; no. 1; pp. 12039 - 12047 |
---|---|
Main Authors | , |
Format | Journal Article |
Language | English |
Published |
Bristol
IOP Publishing
01.08.2021
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Abstract | Abstract
With the explosion in the size of scientific workflows, local workflows can no longer satisfy existing computing needs, and cloud computing platforms have become the first choice for scientific workflows. Compared with traditional local computing, cloud computing platform not only needs to consider the loss of scheduling time and transmission time, but also involves the cost of cloud resources. Therefore, whether the scheduling scheme is reasonable becomes the decisive factor of workflow efficiency. Aiming at how to achieve efficient scheduling under cost constraints, a dynamic scheduling algorithm based on critical path is proposed. The algorithm uses the optimized Dijkstra algorithm to classify the task nodes, guarantees the completion time of key nodes in the scheduling process, adjusts the priority of nodes dynamically, and selects the best resources according to the loss weight. Experiments show that the optimization rate increases with the increase of the number of task nodes. The algorithm proposed in this paper is suitable for large-scale workflow operation and can effectively reduce the scheduling time. |
---|---|
AbstractList | With the explosion in the size of scientific workflows, local workflows can no longer satisfy existing computing needs, and cloud computing platforms have become the first choice for scientific workflows. Compared with traditional local computing, cloud computing platform not only needs to consider the loss of scheduling time and transmission time, but also involves the cost of cloud resources. Therefore, whether the scheduling scheme is reasonable becomes the decisive factor of workflow efficiency. Aiming at how to achieve efficient scheduling under cost constraints, a dynamic scheduling algorithm based on critical path is proposed. The algorithm uses the optimized Dijkstra algorithm to classify the task nodes, guarantees the completion time of key nodes in the scheduling process, adjusts the priority of nodes dynamically, and selects the best resources according to the loss weight. Experiments show that the optimization rate increases with the increase of the number of task nodes. The algorithm proposed in this paper is suitable for large-scale workflow operation and can effectively reduce the scheduling time. Abstract With the explosion in the size of scientific workflows, local workflows can no longer satisfy existing computing needs, and cloud computing platforms have become the first choice for scientific workflows. Compared with traditional local computing, cloud computing platform not only needs to consider the loss of scheduling time and transmission time, but also involves the cost of cloud resources. Therefore, whether the scheduling scheme is reasonable becomes the decisive factor of workflow efficiency. Aiming at how to achieve efficient scheduling under cost constraints, a dynamic scheduling algorithm based on critical path is proposed. The algorithm uses the optimized Dijkstra algorithm to classify the task nodes, guarantees the completion time of key nodes in the scheduling process, adjusts the priority of nodes dynamically, and selects the best resources according to the loss weight. Experiments show that the optimization rate increases with the increase of the number of task nodes. The algorithm proposed in this paper is suitable for large-scale workflow operation and can effectively reduce the scheduling time. |
Author | Tongyue, Zhu Wenhui, Yang |
Author_xml | – sequence: 1 givenname: Zhu surname: Tongyue fullname: Tongyue, Zhu organization: School of Information Science and Technology,Chengdu University of Technology , China – sequence: 2 givenname: Yang surname: Wenhui fullname: Wenhui, Yang organization: School of Information Science and Technology, Chengdu University of Technology , China |
BookMark | eNqFkF1LwzAUhoNMcJv-BgPeCbX5apPeCLN-M9hgipchTZqts2tquiH797ZUJoLguck5yfu-4TwjMKhclQNwjtEVRkKEmDMSxFEShzhJWIhDhAmiyREYHl4Gh16IEzBqmjVCtC0-BNcTeLuv1KbQcKFXudmVRbWEb86_29J9wkm5dL7YrjbwRjW5gbMKpu1caFXCudquTsGxVWWTn32fY_B6f_eSPgbT2cNTOpkGmnCWBMREhhquBdYc6wjpzCiCOGMJ0XkUCYVYFnHeLpDpLG5vTcyYUIJbaklmKR2Diz639u5jlzdbuXY7X7VfShK1G4qE0U7Fe5X2rml8bmXti43ye4mR7GDJDoPskMgOlsSyh9U6ae8sXP0T_b_r8g_X8zxd_BbK2lj6BYMDeRc |
Cites_doi | 10.1016/j.future.2017.03.008 10.1016/j.future.2019.08.012 10.1007/s10723-014-9294-7 10.1109/71.993206 10.1016/j.ins.2020.04.039 |
ContentType | Journal Article |
Copyright | Published under licence by IOP Publishing Ltd 2021. This work is published under http://creativecommons.org/licenses/by/3.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. |
Copyright_xml | – notice: Published under licence by IOP Publishing Ltd – notice: 2021. This work is published under http://creativecommons.org/licenses/by/3.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. |
DBID | O3W TSCCA AAYXX CITATION 8FD 8FE 8FG ABUWG AFKRA ARAPS AZQEC BENPR BGLVJ CCPQU DWQXO H8D HCIFZ L7M P5Z P62 PIMPY PQEST PQQKQ PQUKI PRINS |
DOI | 10.1088/1742-6596/1994/1/012039 |
DatabaseName | Institute of Physics Open Access Journal Titles IOPscience (Open Access) CrossRef Technology Research Database ProQuest SciTech Collection ProQuest Technology Collection ProQuest Central (Alumni) ProQuest Central Advanced Technologies & Aerospace Collection ProQuest Central Essentials ProQuest Central Technology Collection ProQuest One Community College ProQuest Central Korea Aerospace Database SciTech Premium Collection Advanced Technologies Database with Aerospace Advanced Technologies & Aerospace Database ProQuest Advanced Technologies & Aerospace Collection Publicly Available Content Database ProQuest One Academic Eastern Edition (DO NOT USE) ProQuest One Academic ProQuest One Academic UKI Edition ProQuest Central China |
DatabaseTitle | CrossRef Publicly Available Content Database Advanced Technologies & Aerospace Collection Technology Collection Technology Research Database ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Essentials ProQuest One Academic Eastern Edition ProQuest Central (Alumni Edition) SciTech Premium Collection ProQuest One Community College ProQuest Technology Collection ProQuest SciTech Collection ProQuest Central China ProQuest Central Advanced Technologies & Aerospace Database Aerospace Database ProQuest One Academic UKI Edition ProQuest Central Korea ProQuest One Academic Advanced Technologies Database with Aerospace |
DatabaseTitleList | Publicly Available Content Database CrossRef |
Database_xml | – sequence: 1 dbid: O3W name: Institute of Physics Open Access Journal Titles url: http://iopscience.iop.org/ sourceTypes: Enrichment Source Publisher – sequence: 2 dbid: 8FG name: ProQuest Technology Collection url: https://search.proquest.com/technologycollection1 sourceTypes: Aggregation Database |
DeliveryMethod | fulltext_linktorsrc |
Discipline | Physics |
EISSN | 1742-6596 |
ExternalDocumentID | 10_1088_1742_6596_1994_1_012039 JPCS_1994_1_012039 |
GroupedDBID | 1JI 29L 2WC 4.4 5B3 5GY 5PX 5VS 7.Q AAJIO AAJKP ABHWH ACAFW ACHIP AEFHF AEJGL AFKRA AFYNE AIYBF AKPSB ALMA_UNASSIGNED_HOLDINGS ARAPS ASPBG ATQHT AVWKF AZFZN BENPR BGLVJ CCPQU CEBXE CJUJL CRLBU CS3 DU5 E3Z EBS EDWGO EQZZN F5P FRP GROUPED_DOAJ GX1 HCIFZ HH5 IJHAN IOP IZVLO J9A KNG KQ8 LAP N5L N9A O3W OK1 P2P PIMPY PJBAE RIN RNS RO9 ROL SY9 T37 TR2 TSCCA UCJ W28 XSB ~02 AAYXX CITATION 8FD 8FE 8FG ABUWG AZQEC DWQXO H8D L7M P62 PQEST PQQKQ PQUKI PRINS |
ID | FETCH-LOGICAL-c2749-2d5d3d7c81c71c50cbda2074492ce558a04b577199bcb6492d6448a87f3f2bf33 |
IEDL.DBID | BENPR |
ISSN | 1742-6588 |
IngestDate | Thu Oct 10 18:44:56 EDT 2024 Fri Aug 23 02:52:27 EDT 2024 Wed Aug 21 03:33:01 EDT 2024 Tue Aug 20 22:16:47 EDT 2024 |
IsDoiOpenAccess | true |
IsOpenAccess | true |
IsPeerReviewed | true |
IsScholarly | true |
Issue | 1 |
Language | English |
License | Content from this work may be used under the terms of the Creative Commons Attribution 3.0 licence. Any further distribution of this work must maintain attribution to the author(s) and the title of the work, journal citation and DOI. |
LinkModel | DirectLink |
MergedId | FETCHMERGED-LOGICAL-c2749-2d5d3d7c81c71c50cbda2074492ce558a04b577199bcb6492d6448a87f3f2bf33 |
OpenAccessLink | https://www.proquest.com/docview/2559689433?pq-origsite=%requestingapplication% |
PQID | 2559689433 |
PQPubID | 4998668 |
PageCount | 9 |
ParticipantIDs | proquest_journals_2559689433 crossref_primary_10_1088_1742_6596_1994_1_012039 iop_journals_10_1088_1742_6596_1994_1_012039 |
PublicationCentury | 2000 |
PublicationDate | 20210801 |
PublicationDateYYYYMMDD | 2021-08-01 |
PublicationDate_xml | – month: 08 year: 2021 text: 20210801 day: 01 |
PublicationDecade | 2020 |
PublicationPlace | Bristol |
PublicationPlace_xml | – name: Bristol |
PublicationTitle | Journal of physics. Conference series |
PublicationTitleAlternate | J. Phys.: Conf. Ser |
PublicationYear | 2021 |
Publisher | IOP Publishing |
Publisher_xml | – name: IOP Publishing |
References | Zhang (JPCS_1994_1_012039bib9) 2020; 37 Arabnejad (JPCS_1994_1_012039bib13) 2014; 12 Chen (JPCS_1994_1_012039bib10) 2020; 40 Chen (JPCS_1994_1_012039bib14) 2017; 74 Sakellariou (JPCS_1994_1_012039bib12) 2005 Ahmad (JPCS_1994_1_012039bib2) 2021 Liao (JPCS_1994_1_012039bib11) 2020; 42 Jia (JPCS_1994_1_012039bib1) 2021; 6 Ismayilov (JPCS_1994_1_012039bib5) 2020; 102 Yu (JPCS_1994_1_012039bib7) 2005 Zhang (JPCS_1994_1_012039bib15) 2020; 6 Gao (JPCS_1994_1_012039bib6) 2019 Raman (JPCS_1994_1_012039bib3) 2021; 10 Topcuoglu (JPCS_1994_1_012039bib8) 2002; 13 Lz (JPCS_1994_1_012039bib4) 2020; 531 |
References_xml | – volume: 74 start-page: 1 year: 2017 ident: JPCS_1994_1_012039bib14 article-title: Efficient task scheduling for budget constrained parallel applications on heterogeneous cloud computing systems publication-title: J. Future Generation Computer Systems doi: 10.1016/j.future.2017.03.008 contributor: fullname: Chen – volume: 102 start-page: 307 year: 2020 ident: JPCS_1994_1_012039bib5 article-title: Neural network based multi-objective evolutionary algorithm for dynamic workflow scheduling in cloud computing publication-title: Future Generation Computer Systems doi: 10.1016/j.future.2019.08.012 contributor: fullname: Ismayilov – start-page: 114 year: 2019 ident: JPCS_1994_1_012039bib6 article-title: Minimizing financial cost of scientific workflows under deadline constraint multi-cloud environments contributor: fullname: Gao – volume: 40 start-page: 103 year: 2020 ident: JPCS_1994_1_012039bib10 article-title: Data-intensive workflow scheduling based on phase division in cloud environment publication-title: Journal of Nanjing University of Posts and Telecommunications(Natural Science Edition) contributor: fullname: Chen – volume: 12 start-page: 665 year: 2014 ident: JPCS_1994_1_012039bib13 article-title: A budget constrained scheduling algorithm for workflow applications publication-title: Journal of Grid Computing doi: 10.1007/s10723-014-9294-7 contributor: fullname: Arabnejad – volume: 42 start-page: 1957 year: 2020 ident: JPCS_1994_1_012039bib11 article-title: Configuration and scheduling mechanism of spot instances meeting the execution time limit of workflow contributor: fullname: Liao – start-page: 347 year: 2005 ident: JPCS_1994_1_012039bib12 contributor: fullname: Sakellariou – volume: 6 start-page: 1 year: 2021 ident: JPCS_1994_1_012039bib1 article-title: A novel cloud workflow scheduling algorithm based on stable matching game theory publication-title: The Journal of Supercomputing contributor: fullname: Jia – volume: 10 year: 2021 ident: JPCS_1994_1_012039bib3 article-title: Computation of workflow scheduling using backpropagation neural network in cloud computing: a virtual machine placement approach publication-title: The Journal of Supercomputing contributor: fullname: Raman – start-page: 140 year: 2005 ident: JPCS_1994_1_012039bib7 article-title: cost-based scheduling of scientific workflow application on utility grids The 1st International Conference on E-Science and Grid Computing contributor: fullname: Yu – volume: 6 start-page: 1182 year: 2020 ident: JPCS_1994_1_012039bib15 article-title: Efficient Work Flow Scheduling Algorithm Under Cost Budget Constraint in Heterogeneous Cloud Systems publication-title: Journal of Chinese Computer Systems contributor: fullname: Zhang – volume: 13 start-page: 260 year: 2002 ident: JPCS_1994_1_012039bib8 article-title: Performance-effective and low-complexity task scheduling for heterogeneous computing publication-title: IEEE Transactions on Parallel and Distributed Systems doi: 10.1109/71.993206 contributor: fullname: Topcuoglu – year: 2021 ident: JPCS_1994_1_012039bib2 article-title: An energyefficient big data workflow scheduling algorithm under budget constraints for heterogeneous cloud environment contributor: fullname: Ahmad – volume: 37 start-page: 178 year: 2020 ident: JPCS_1994_1_012039bib9 article-title: A Multi-Stage Workflow Task Scheduling Algorithm in Cloud Environment publication-title: Computer Applications and Software contributor: fullname: Zhang – volume: 531 start-page: 31 year: 2020 ident: JPCS_1994_1_012039bib4 article-title: Efficient scientific workflow scheduling for deadline-constrained parallel tasks in cloud computing environments - sciencedirect publication-title: Information Sciences doi: 10.1016/j.ins.2020.04.039 contributor: fullname: Lz |
SSID | ssj0033337 |
Score | 2.3207583 |
Snippet | Abstract
With the explosion in the size of scientific workflows, local workflows can no longer satisfy existing computing needs, and cloud computing platforms... With the explosion in the size of scientific workflows, local workflows can no longer satisfy existing computing needs, and cloud computing platforms have... |
SourceID | proquest crossref iop |
SourceType | Aggregation Database Enrichment Source Publisher |
StartPage | 12039 |
SubjectTerms | Algorithms Cloud computing Completion time Critical path Dijkstra's algorithm Nodes Optimization Priority scheduling Resource scheduling Scheduling Task scheduling Workflow |
SummonAdditionalLinks | – databaseName: Institute of Physics Open Access Journal Titles dbid: O3W link: http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1ZS8NAEF6sIvginlgvFvTR2GSP7OZFqFWRgrZQi31bskeqUNvSVvz7zuZAi4iYpxAmyeab7Mw3ycwsQuecck1sogOWEhYwzcNAZjCvrNZSkNQxqX2988NjfN9n7QEffK-FmUxL038Ju0Wj4ALCMiFONoBDkyDmSdzwfW0bUcPXf9KkhtbA-eYkqUOfK2tMYRNFUaQ_Scoqx-v3Cy15qBqM4oeZzn3P3RbaLEkjbhZD3EYrbryD1vPkTTPfRVdNfFMsLI97oAPrk8uH2H8Gz0aTD9wcDSez18XLG74Gl2VxZ4yrBQ5wFwjgHurf3T617oNyXYTAQAyZBMRyS60wMjIiMjw02qYEqABLiHGcyzQEzIWAh9JGx3DU-iAslSKjGdEZpftodTwZuwOEaRxJ0A8ToXUscS4xLLKRg5jEcsMyUUdhhYWaFu0vVP7bWkrl4VMePuXhU5Eq4KujC8BMlVNh_rf42ZJ4u9vqLUuoqc3q6LhSwZeoj4Zi3z-eHv7vnkdog_jUlDyP7xitLmbv7gS4xUKf5i_PJ1envVs priority: 102 providerName: IOP Publishing |
Title | A Dynamic Scheduling Workflow Algorithm Based On Critical Path |
URI | https://iopscience.iop.org/article/10.1088/1742-6596/1994/1/012039 https://www.proquest.com/docview/2559689433 |
Volume | 1994 |
hasFullText | 1 |
inHoldings | 1 |
isFullTextHit | |
isPrint | |
link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwhV1ZT-MwELYoaKV9QRyLthyVJXgkauIjdl5A5SiHBK1g0fJmxUfYlaAttIi_z0wOAUKCPPjBmRd_Y8_l8QwhO5JLy3xmI5EzEQkr40gXcK68tVqxPAht8b3zxWV6eiPOb-VtHXCb1mmVjUwsBbUfO4yRd9H0TbFYON-fPEbYNQpvV-sWGi2ywBKB17QLB8eXw6tGFnP4VPUkkkWga3WT4QVuXz2XpV0sj9tNuviMFHuGv9NPrf_jySchXWqe_hJZrE1G2qt4vEzmwmiF_ChTN910lez16FHVVp5eAwc8ppbfUQyCF_fjF9q7v4NlzP490ANQWJ4ORrRpb0CHYP79Ijf94z-Hp1HdFSFy4EFmEfPSc6-cTpxKnIyd9TkDQ0BkzAUpdR4D4krBoqyzKcx6dMFyrQpeMFtwvkbmR-NR-E0oTxMN3BEq9kFkIWROJD4J4JF46USh2iRusDCTqviFKS-ttTYIn0H4DMJnElPB1ya7gJmpD8L0e_LtD-Tnw8PrjxRm4os22WxY8Eb6tiHWv_69QX4yTEQps_Y2yfzs6TlsgSUxsx3S0v2TTr1pOijVJYxngyGMA_73FQnzwlA |
link.rule.ids | 315,786,790,12792,21416,27955,27956,33406,33777,38898,38923,43633,43838,53875,53901 |
linkProvider | ProQuest |
linkToHtml | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwhV1JTxsxFLZKKkQvVcsiQim1BEdGmfEy9lyoUmiaAglIgMTNGi8TKoUkkCD-Pu_NIkBIdI6ed_Hn57f5LYTsSS4t85mNRM5EJKyMI13AvfLWasXyILTFeufBMO1fieNreV0H3OZ1WmUjE0tB7acOY-QdNH1TbBbOf87uIpwaha-r9QiNJfJR8JQjn-ven0YSc_hUVRDJItC0usnvAqevXsvSDjbH7SQdLCLFieEvtNPSv-nsjYgu9U7vC_lcG4y0W53wV_IhTFbJcpm46eZr5KBLj6qh8vQC8PeYWD6iGAIvxtNH2h2PYBOLm1v6C9SVp2cT2gw3oOdg_K2Tq97vy8N-VM9EiBz4j1nEvPTcK6cTpxInY2d9zsAMEBlzQUqdx4C3UrAp62wKqx4dsFyrghfMFpxvkNZkOgmbhPI00XA2QsU-iCyEzInEJwH8ES-dKFSbxA0WZla1vjDlk7XWBuEzCJ9B-ExiKvjaZB8wM_U1mP-ffPcV-fH54cVrCjPzRZtsN0fwTPrMDlvv__5BVvqXg1Nz-nd48o18YpiSUubvbZPW4v4hfAebYmF3SsZ5Ar-bwAg |
linkToPdf | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1Zb9NAEB4lRUV9qQoFkR6wEjxibO_hXb8gpS1RKZBEaiPytvIeLpXaOGpT9e8z66MoqhDCT5Y1ttff7M6xngPgg2DCUJebiBeUR9yIJFIlritnjJK08FyZkO_8Y5ydzvjZXMx7MHrMhamWrej_hKdNoeAGwjYgTsVoQ9MoE3kWh7q2cRqH_E-Wx0tX9uGZCE48zusJ-9lJZIaHbBIjw41KdXFef3_Ympbq40ieiOpa_4x2YLs1HMmwGeYL6PnFS9isAzjt3S58HpKTprk8OUc-uBBgfknCVnh5XT2Q4fVldXu1-nVDjlBtOTJZkK7JAZmiEfgKZqMvF8enUdsbIbLoR-YRdcIxJ61KrUytSKxxBUVzgOfUeiFUkSDuUuJHGWsyvOqCI1YoWbKSmpKx17CxqBb-DRCWpQp5xGXiPM-9zy1PXerRL3HC8lIOIOmw0MumBIauf10rpQN8OsCnA3w61Q18A_iImOl2Odz9m_z9GvnZ9Ph8nUIjcwdw0LHgD2nwiLJQQ57t_d8738Hz6clIf_86_rYPWzREqtRhfQewsbq994doaqzM23oe_QZdWsFP |
openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=A+Dynamic+Scheduling+Workflow+Algorithm+Based+On+Critical+Path&rft.jtitle=Journal+of+physics.+Conference+series&rft.au=Zhu+Tongyue&rft.au=Yang%2C+Wenhui&rft.date=2021-08-01&rft.pub=IOP+Publishing&rft.issn=1742-6588&rft.eissn=1742-6596&rft.volume=1994&rft.issue=1&rft_id=info:doi/10.1088%2F1742-6596%2F1994%2F1%2F012039 |
thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1742-6588&client=summon |
thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1742-6588&client=summon |
thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1742-6588&client=summon |