Ahmad Habibizad Navin

Work place: Department of Computer, East Azarbaijan Science and Research Branch, Islamic Azad University, Tabriz, Iran

E-mail: habibizad@iauasrb.ac.ir

Website:

Research Interests: Robotics, Computer Architecture and Organization, Systems Architecture, Data Structures and Algorithms

Biography

Ahmad Habibizad Navin was born in 1971. He received his H.N.D in electronic in1997 and B.Sc. degree in applied mathematics from Tabriz University, Tabriz, Iran, in 1999. He received his M.Sc. degree in computer architecture from Science and Research Branch of Islamic Azad University, Tehran, Iran, in 2003 and his Ph.D. in computer hardware from Science and Research Branch, Islamic Azad University, Tehran, Iran, in 2007. His research interest includes computer architecture, data-oriented approach, robotic, soft computing and probability and statistic.

Author Articles
Multi-Objective Task Scheduling in the Cloud Computing based on the Patrice Swarm Optimization

By Farnaz Sharifi Milani Ahmad Habibizad Navin

DOI: https://doi.org/10.5815/ijitcs.2015.05.09, Pub. Date: 8 Apr. 2015

Cloud computing is the latest emerging trend in distributed computing, where shared resources are provided to end-users in an on demand fashion that brings many advantages, including data ubiquity, flexibility of access, high availability of resources, and flexibility. In this type of systems many challenges are existed that the task scheduling problem is one of them. The task scheduling problem in Cloud computing is an NP-hard problem. Therefore, many heuristics have been proposed, from low level execution of tasks in multiple processors to high level execution of tasks. In this paper, we propose a new algorithm based on PSO to schedule the tasks in the Cloud. The results demonstrated that the proposed algorithm has a better operation in terms of task execution time, waiting time and missed tasks in comparison of First Come First Served (FCFS), Shortest Process Next (SPN) and Highest Response Ratio Next (HRRN).

[...] Read more.
Other Articles