Research of Task Scheduling Mechanism Based on Prediction of Memory Utilization

Author(s):  
Juan Fang ◽  
Mengxuan Wang ◽  
Hao Sun

Task scheduling is still a challenge in cloud computing as no existing scheduling algorithms are not effectively provisioning and scheduling the resources in the cloud. Existing authors considered only metrics like makespan, execution time and turnaround time etc. and the previous authors concentrated only to optimize the above mentioned metrics. But no existing authors were considered about the effective provisioning of the resources in the cloud i.e, compute, storage and network capacities and still many resources in the cloud were underutilized. In this paper, we want to propose an algorithm which can effectively utilize the resources in the cloud by extending Particle Swarm Optimization by addressing the metrics Bandwidth utilization and Memory utilization particularly. We have simulated this algorithm by using cloudsim and compared the modified Dynamic PSO with the PSO algorithm and it outperforms in terms of Bandwidth and Memory utilization and the makespan is also optimized.


2006 ◽  
Author(s):  
Patrice D. Tremoulet ◽  
Kathleen M. Stibler ◽  
Patrick Craven ◽  
Joyce Barton ◽  
Adam Gifford ◽  
...  

Author(s):  
Shailendra Raghuvanshi ◽  
Priyanka Dubey

Load balancing of non-preemptive independent tasks on virtual machines (VMs) is an important aspect of task scheduling in clouds. Whenever certain VMs are overloaded and remaining VMs are under loaded with tasks for processing, the load has to be balanced to achieve optimal machine utilization. In this paper, we propose an algorithm named honey bee behavior inspired load balancing, which aims to achieve well balanced load across virtual machines for maximizing the throughput. The proposed algorithm also balances the priorities of tasks on the machines in such a way that the amount of waiting time of the tasks in the queue is minimal. We have compared the proposed algorithm with existing load balancing and scheduling algorithms. The experimental results show that the algorithm is effective when compared with existing algorithms. Our approach illustrates that there is a significant improvement in average execution time and reduction in waiting time of tasks on queue using workflowsim simulator in JAVA.


2020 ◽  
Vol 16 (10) ◽  
pp. 1627
Author(s):  
Pei Shujun ◽  
Zhang Yu ◽  
Liang Chao

Author(s):  
Ramandeep Kaur ◽  
Navpreet Kaur

The cloud computing can be essentially expressed as aconveyance of computing condition where distinctive assets are conveyed as a support of the client or different occupants over the web. The task scheduling basically concentrates on improving the productive use of assets and henceforth decrease in task fruition time. Task scheduling is utilized to allot certain tasks to specific assets at a specific time occurrence. A wide range of systems has been exhibited to take care of the issues of scheduling of various tasks. Task scheduling enhances the productive use of asset and yields less reaction time with the goal that the execution of submitted tasks happens inside a conceivable least time. This paper talks about the investigation of need, length and due date based task scheduling calculations utilized as a part of cloud computing.


Sign in / Sign up

Export Citation Format

Share Document