Task scheduling in Cloud computing
Authors:
- 1 April 2016
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-5
Abstract
Wireless Cloud computing delivers the data and computing resources through the internet, on a pay for usage basis. By using this, we can automatically update our software. We can use only the space required for the server, which reduces the carbon footprint. Task scheduling is the main problem in cloud computing which reduces the system performance. To improve system performance, there is need of an efficient task-scheduling algorithm. Existing task-scheduling algorithms focus on task-resource requirements, CPU memory, execution time and execution cost. However, these do not consider network bandwidth. In this paper, we introduce an efficient task-scheduling algorithm, which presents divisible task scheduling by considering network bandwidth. By this, we can allocate the workflow based on the availability of network bandwidth. Our proposed task-scheduling algorithm uses a nonlinear programming model for divisible task scheduling, which assigns the correct number of tasks to each virtual machine. Based on the allocation, we design an algorithm for divisible load scheduling by considering the network bandwidth.Keywords
This publication has 5 references indexed in Scilit:
- Unfolding the Distributed Computing Paradigms2010
- A Task Scheduling Algorithm Based on Load Balancing in Cloud Computing2010
- Minimizing Execution Costs when Using Globally Distributed Cloud Services2010
- Schedule Distributed Virtual Machines in a Service Oriented Environment2010
- Heuristic for resources allocation on utility computing infrastructures2008