An optimal tasks scheduling algorithm based on QoS in cloud computing network
Cloud Computing has emerged as a service model that offers online accessible resources to the clients. These resources contain storage, servers, and other applications and it provides security, flexibility, and sealability. In Max-Min algorithm where the large tasks have their priority to be schedul...
Saved in:
| 主要作者: | |
|---|---|
| 格式: | Thesis |
| 語言: | English |
| 出版: |
2017
|
| 主題: | |
| 在線閱讀: | http://psasir.upm.edu.my/id/eprint/91947/1/FSKTM%202018%2036%20IR.pdf |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
| 總結: | Cloud Computing has emerged as a service model that offers online accessible resources to the clients. These resources contain storage, servers, and other applications and it provides security, flexibility, and sealability. In Max-Min algorithm where the large tasks have their priority to be scheduled first, this leads small tasks to stay longer in the queue until all large length tasks finished their execution. This study presents an optimal task scheduling algorithm by enhancing Max-Min and TS algorithm. Our proposed algorithm isolates the resources into two different groups where the first group contains the resources with maximum execution time while the second group contains the resources with minimum execution time. The main idea here is to choose the resource that takes less time to execute the selected job/task. Therefore, if the resource is from the first group then map the average length task to it and if the choosing resource is from the second group, then map the largest length task to it. The simulation tool used for testing the algorithm is WorkflowSim. We tested averages of execution time span of the proposed algorithm for 10 running times with 200-1000 tasks in 50 or 100 VMs. Test results show that the proposed algorithm represents enhanced resource utilization with better execution time. |
|---|