Scheduling Algorithm for Bag-of-Tasks with Due Date Constraints on Hybrid Clouds
Bag-of-Tasks (BoT) applications consisting of multiple tasks are widely used in various fields.Different from the traditional deadline constraint in scheduling problems,a due date constraint allows the BoT applications to finish more than a predetermined due date,but would result in the tardiness pe...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | zho |
| Published: |
Editorial office of Computer Science
2022-05-01
|
| Series: | Jisuanji kexue |
| Subjects: | |
| Online Access: | https://www.jsjkx.com/fileup/1002-137X/PDF/1002-137X-2022-49-5-244.pdf |
| _version_ | 1797845071650881536 |
|---|---|
| author | YAN Lei, ZHANG Gong-xuan, WANG Tian, KOU Xiao-yong, WANG Guo-hong |
| author_facet | YAN Lei, ZHANG Gong-xuan, WANG Tian, KOU Xiao-yong, WANG Guo-hong |
| author_sort | YAN Lei, ZHANG Gong-xuan, WANG Tian, KOU Xiao-yong, WANG Guo-hong |
| collection | DOAJ |
| description | Bag-of-Tasks (BoT) applications consisting of multiple tasks are widely used in various fields.Different from the traditional deadline constraint in scheduling problems,a due date constraint allows the BoT applications to finish more than a predetermined due date,but would result in the tardiness penalty.In this case,in order to reduce the total cost,the efficient harmony search (EHS) algorithm is proposed to optimize the scheduling tasks in hybrid clouds.The algorithm obtains the initial task sequence by random search and fine tuning.By improving the harmony search steps and the way of generating new harmony memory,a large number of high-quality harmony can be obtained in one search process,which greatly improves the efficiency of harmony search and speeds up the convergence speed of the algorithm.Through continuous iteration,the global optimal solution is obtained,that is to say,BoT application scheduling scheme has the lowest total cost.Experimental results show that compared with other algorithms,the proposed algorithm has significant improvement in performance,which can effectively reduce the total cost of scheduling BoT applications. |
| first_indexed | 2024-04-09T17:32:35Z |
| format | Article |
| id | doaj.art-838412cbfba4408cbfeea2ea0f0fa000 |
| institution | Directory Open Access Journal |
| issn | 1002-137X |
| language | zho |
| last_indexed | 2024-04-09T17:32:35Z |
| publishDate | 2022-05-01 |
| publisher | Editorial office of Computer Science |
| record_format | Article |
| series | Jisuanji kexue |
| spelling | doaj.art-838412cbfba4408cbfeea2ea0f0fa0002023-04-18T02:35:57ZzhoEditorial office of Computer ScienceJisuanji kexue1002-137X2022-05-0149524424910.11896/jsjkx.210300120Scheduling Algorithm for Bag-of-Tasks with Due Date Constraints on Hybrid CloudsYAN Lei, ZHANG Gong-xuan, WANG Tian, KOU Xiao-yong, WANG Guo-hong0School of Computer Science and Technology,Nanjing University of Science and Technology,Nanjing 210094,ChinaBag-of-Tasks (BoT) applications consisting of multiple tasks are widely used in various fields.Different from the traditional deadline constraint in scheduling problems,a due date constraint allows the BoT applications to finish more than a predetermined due date,but would result in the tardiness penalty.In this case,in order to reduce the total cost,the efficient harmony search (EHS) algorithm is proposed to optimize the scheduling tasks in hybrid clouds.The algorithm obtains the initial task sequence by random search and fine tuning.By improving the harmony search steps and the way of generating new harmony memory,a large number of high-quality harmony can be obtained in one search process,which greatly improves the efficiency of harmony search and speeds up the convergence speed of the algorithm.Through continuous iteration,the global optimal solution is obtained,that is to say,BoT application scheduling scheme has the lowest total cost.Experimental results show that compared with other algorithms,the proposed algorithm has significant improvement in performance,which can effectively reduce the total cost of scheduling BoT applications.https://www.jsjkx.com/fileup/1002-137X/PDF/1002-137X-2022-49-5-244.pdfhybrid clouds|bag-of-tasks|due date|total cost minimization|efficient harmony search algorithm |
| spellingShingle | YAN Lei, ZHANG Gong-xuan, WANG Tian, KOU Xiao-yong, WANG Guo-hong Scheduling Algorithm for Bag-of-Tasks with Due Date Constraints on Hybrid Clouds Jisuanji kexue hybrid clouds|bag-of-tasks|due date|total cost minimization|efficient harmony search algorithm |
| title | Scheduling Algorithm for Bag-of-Tasks with Due Date Constraints on Hybrid Clouds |
| title_full | Scheduling Algorithm for Bag-of-Tasks with Due Date Constraints on Hybrid Clouds |
| title_fullStr | Scheduling Algorithm for Bag-of-Tasks with Due Date Constraints on Hybrid Clouds |
| title_full_unstemmed | Scheduling Algorithm for Bag-of-Tasks with Due Date Constraints on Hybrid Clouds |
| title_short | Scheduling Algorithm for Bag-of-Tasks with Due Date Constraints on Hybrid Clouds |
| title_sort | scheduling algorithm for bag of tasks with due date constraints on hybrid clouds |
| topic | hybrid clouds|bag-of-tasks|due date|total cost minimization|efficient harmony search algorithm |
| url | https://www.jsjkx.com/fileup/1002-137X/PDF/1002-137X-2022-49-5-244.pdf |
| work_keys_str_mv | AT yanleizhanggongxuanwangtiankouxiaoyongwangguohong schedulingalgorithmforbagoftaskswithduedateconstraintsonhybridclouds |