Deadline – Cost Based Job Scheduling Using Greedy Approach in a Multi-Layer Environment
English

S Selvi, R Maheswari, Dr.B Kalaavathi
2014 International Journal of Computer Trends and Technology  
Cloud Computing is a well-liked computing model to support on demand services. With the use of Internet technologies, scalable resources are delivered as a service to external customers. Scheduling in cloud is responsible for selection of best suitable resources for task execution, by considering some static and dynamic parameters and restrictions of tasks into consideration. The user's perspective of efficient scheduling may be based on parameters like task completion time or task execution
more » ... r task execution cost etc. Both service providers and service consumers like to ensure that resources are utilized efficiently to do their best capacity. Both service providers and service consumers like to ensure that resources are utilized efficiently to do their best capacity. In this, we propose a scheduling algorithm which addresses the major challenges in cloud scheduling. Scheduling of jobs is done in two steps by considering parameters like deadline, cost, profit, response time, waiting time, turnaround time etc. Two-Level Scheduling technique is used for both scheduling and re-scheduling of jobs. Scheduling is done by considering deadline, waiting time parameters. Re-Scheduling is based on cost/profit parameters. Greedy approach is applied in both the levels to optimise the scheduling. Finally the simulation is carried out and its efficiency is analysed with existing scheduling algorithms.
doi:10.14445/22312803/ijctt-v11p116 fatcat:2l6mxvmttzdrvhyz27eopef7t4