Makespan Improvement of PSO-based Dynamic Scheduling in Cloud Environment

نویسندگانازاده خلیلی اردلی,سید مرتضی بابامیر
همایشبیست و سومین کنفرانس مهندسی برق ایران
تاریخ برگزاری همایش۲۰۱۵-۵-۱۰
محل برگزاری همایشتهران
نوع ارائهسخنرانی
سطح همایشملی

چکیده مقاله

Abstract—the latest generation of distributed systems is cloud computing that has been acclaimed scientifically and commercially. CloudSim is one of the simulation tools that enables the evaluation and testing cloud services and infrastructures before development on a real cloud. For optimal use of the cloud’s potential power, efficient and effective scheduling algorithms are required which can select the best resources for execution tasks. The matter of mapping and scheduling the tasks is assigning tasks to run on the existing resources in the manner that helps to maximize utilization and minimize makespan. The total time that is needed for all tasks/jobs to be finished is known as makespan. And utilization is the measure of how well the overall capacity of the cloud (network resources) is used. Due to the heterogeneity and dynamic resources, task scheduling is known as NP-complete problem and metaheuristics are needed to find the best scheduling combination. The main objective of this paper is to optimize task scheduling that uses the particle swarm optimization algorithm to minimize the makespan. Different inertia weights have been used. The Linear Descending Inertia Weight (LDIW) with an average 22.7% reduction in makespan shows the best performance.