Task Scheduling Algorithms with Multiple Factor in Cloud Computing Environment Nidhi Bansal, Amit Awasthi and Shruti Bansal Abstract Optimized task scheduling concepts can meet user requirements ef ficiently by using priority concepts. Increasing the resource utilization and reducing the cost, both are compulsory factors to be compromise in task scheduling algorithms of cloud computation for executing many tasks. With updating the technology many new features in cloud computing introduced such as fault toler- ance, high resource utilization, expandability, flexibility, reduced overhead for users, reduced cost, required services etc., this paper discussed task scheduling algorithms based on priority for virtual machines and tasks. This algorithm per- forms good results with balance the load, but it’s not effective with cost perfor- mance. Secondly comparative study also has been done in this paper between various scheduling algorithms by CloudSim simulator. Keywords Cloud computing Á Task scheduling Á Cost Á Load balancing 1 Introduction In these days all the application runs via virtual machines and resources are allo- cated to all virtual machines. All applications are independent, unique in technology and has no connection to each other. Resources are compromised on every event or activity performed with all individual units of products and service. N. Bansal (&) Department of Computer Science and Engineering, Vidya College of Engineering, Meerut, India e-mail: nidhi18jul@gmail.com A. Awasthi Department of Computer Science and Engineering NITTTR, Chandigarh, India e-mail: awasthi.amit1989@gmail.com S. Bansal Department of Electronic & Communication, Shobhit University, Meerut, India e-mail: shruti_mrt@rediffmail.com © Springer India 2016 S.C. Satapathy et al. (eds.), Information Systems Design and Intelligent Applications, Advances in Intelligent Systems and Computing 433, DOI 10.1007/978-81-322-2755-7_64 619