Search

Cloud computing is an emerging distributed system that provides flexible and dynamically scalable computing resources for use at low cost. Task scheduling in cloud computing environment is one of the main problems that need to be addressed in order to improve system performance and increase cloud consumer satisfaction. Although there are many task scheduling algorithms, existing approaches mainly focus on minimizing the total completion time while ignoring workload balancing. Moreover, managing the quality of service (QoS) of the existing approaches still needs to be improved. In this paper, we propose a novel algorithm named MGGS (modified genetic algorithm (GA) combined with greedy strategy). The proposed algorithm leverages the modified GA algorithm combined with greedy strategy to optimize task scheduling process. Different from existing algorithms, MGGS can find an optimal solution using fewer number of iterations. To evaluate the performance of MGGS, we compared the performance of the proposed algorithm with several existing algorithms based on the total completion time, average response time, and QoS parameters. The results obtained from the experiments show that MGGS performs well as compared to other task scheduling algorithms. [ABSTRACT FROM AUTHOR]

To deal with the problem of unbalanced load and ignoring task priority in previous task scheduling algorithms, this paper proposes a task scheduling algorithm named P-Min-Min-Max, which combines with priority and greedy strategy. Under the condition of considering the task priority, the algorithm leverages the execution time of tasks for greedy strategy, and binding large task and small task in the task list to form "task pair" to perform scheduling, so as to effectively solve the problem of unbalanced load. To reduce the average response time of tasks, the algorithm priority schedules the small task from the "task pair". The experimental results show that, compared with the Min-Min and P-Min-Min algorithm, the proposed algorithm improves the system resource utilization and service quality of user, and saves the total execution time for tasks. Compared with Max-Min and P-Max-Min algorithm, the proposed algorithm improves the system resource utilization and service quality of user, and reduces the total completion time and average response time. [ABSTRACT FROM AUTHOR]