CIVILICA We Respect the Science
(ناشر تخصصی کنفرانسهای کشور / شماره مجوز انتشارات از وزارت فرهنگ و ارشاد اسلامی: ۸۹۷۱)

A bi-objective Particle Swarm Optimization for Task Scheduling in Cloud Computing Environments

عنوان مقاله: A bi-objective Particle Swarm Optimization for Task Scheduling in Cloud Computing Environments
شناسه ملی مقاله: ICTMNGT02_140
منتشر شده در دومین کنفرانس بین المللی مدیریت و فناوری اطلاعات و ارتباطات در سال 1395
مشخصات نویسندگان مقاله:

Fatemeh Alizadeh - M.A student of computer architecture, Department of Electrical and Computer Engineering, University of Mohaghegh Ardabili, Ardabil, Iran
Shahram Jamali - Associate professor Department of Electrical and Computer Engineering, University of Mohaghegh Ardabili Ardabil, Iran
Soheila Sadeqi - Instructor Department of Electrical and Computer Engineering, University of Mohaghegh Ardabili Ardabil, Iran

خلاصه مقاله:
Cloud computing is the growth of distributed computing, parallel computing, utility computing and grid computing, or defined as the commercial implementation of these computer science theories. One of the fundamental issues in cloud environment is the task scheduling which plays the key role of efficiency of the whole cloud computing facilities. Scheduling maps the user’s tasks to resources to be executed efficiently in order to benefit both the service providers and customers. Since the cloud task scheduling is an NP-hard optimization problem, many meta-heuristic algorithms have been proposed to solve it. In this paper a policy based on particle swarm optimization compared with genetic algorithm and FCFS, has been introduced. PSO is a population-based search algorithm based on the simulation of the social behavior of birds within the flock. The main goal in this research is minimizing the makespan and flowtime of a given tasks set. Proposed policy and two other algorithms have been simulated using Cloudsim toolkit package. The results showed that PSO performed better than genetic and FCFS algorithms

کلمات کلیدی:
Cloud computing, task scheduling, particle swarm optimization, makespan

صفحه اختصاصی مقاله و دریافت فایل کامل: https://civilica.com/doc/528536/