Computationally intensive applications embodied as workflows entail interdependent tasks that involve multifarious computation requirements and necessitate Heterogeneous Distributed Computing Systems(HDCS)to attain hi...Computationally intensive applications embodied as workflows entail interdependent tasks that involve multifarious computation requirements and necessitate Heterogeneous Distributed Computing Systems(HDCS)to attain high performance.The scheduling of workflows on HDCS was demonstrated as an NP-Complete problem.In the current work,a new heuristic based Branch and Bound(BnB)technique namely Critical Path_finish Time First(CPTF)algorithm is proposed for workflow scheduling on HDCS to achieve the best solutions.The primary merits of CPTF algorithm are due to the bounding functions that are tight and of less complexity.The sharp bounding functions could precisely estimate the promise of each state and aid in pruning infeasible states.Thus,the search space size is reduced.The CPTF algorithm explores the most promising states in the search space and converges to the solution quickly.Therefore,high performance is achieved.The experimental results on random and scientific workflows reveal that CPTF algorithm could effectively exploit high potency of BnB technique in realizing better quality solutions against the widely referred heuristic scheduling algorithms.The results on the benchmark workflows show that CPTF algorithm has improved schedules for 89.36%of the cases.展开更多
CCF Computility is established as a premier platform for industry professionals,academic scholars,and researchers to exchange innovative ideas,methodologies,and technological advancements in the field of distributed c...CCF Computility is established as a premier platform for industry professionals,academic scholars,and researchers to exchange innovative ideas,methodologies,and technological advancements in the field of distributed computing systems.Formerly known as the CCF(China Computer Federation)Annual Conference on Distributed and Parallel Computing Systems(CCF DPCS),CCF Computility has evolved to better address the rapidly growing importance of computility(算力)a new dimension of productive capacity that is driving transformative development across multiple sectors.展开更多
摘要Computationally intensive applications embodied as workflows entail interdependent tasks that involve multifarious computation requirements and necessitate Heterogeneous Distributed Computing Systems(HDCS)to attain high performance.The scheduling of workflows on HDCS was demonstrated as an NP-Complete problem.In the current work,a new heuristic based Branch and Bound(BnB)technique namely Critical Path_finish Time First(CPTF)algorithm is proposed for workflow scheduling on HDCS to achieve the best solutions.The primary merits of CPTF algorithm are due to the bounding functions that are tight and of less complexity.The sharp bounding functions could precisely estimate the promise of each state and aid in pruning infeasible states.Thus,the search space size is reduced.The CPTF algorithm explores the most promising states in the search space and converges to the solution quickly.Therefore,high performance is achieved.The experimental results on random and scientific workflows reveal that CPTF algorithm could effectively exploit high potency of BnB technique in realizing better quality solutions against the widely referred heuristic scheduling algorithms.The results on the benchmark workflows show that CPTF algorithm has improved schedules for 89.36%of the cases.
摘要CCF Computility is established as a premier platform for industry professionals,academic scholars,and researchers to exchange innovative ideas,methodologies,and technological advancements in the field of distributed computing systems.Formerly known as the CCF(China Computer Federation)Annual Conference on Distributed and Parallel Computing Systems(CCF DPCS),CCF Computility has evolved to better address the rapidly growing importance of computility(算力)a new dimension of productive capacity that is driving transformative development across multiple sectors.