A Comparative Study on Dynamic Task Scheduling algorithms

Volume 7 Issue 1 December - February 2018

Article

A Comparative Study on Dynamic Task Scheduling algorithms

Chouhan Kumar Rath*, Shashank Sekhar Suar**, Prasanti Biswal***

*-*** PG Scholar, Department of Computer Science Engineering, Sambalpur University, Odisha, India.

Rath , C.K., Suar , S.S., & Biswal , P. (2018). A Comparative Study on Dynamic Task Scheduling Algorithms. i-manager’s Journal on Information Technology, 7(1), 1-6. https://doi.org/10.26634/jit.7.1.14089

Abstract

Parallelism has been employed for many years, for high performance computing. Parallel computers can be classifiedaccording to the level at which the hardware supports parallelism with multi-core and multi-processor computers having multiple processing elements within a single machine, while clusters, Massively Parallel Processors (MPPs), and grids use multiple computer to work on the same task. Scheduling and Mapping of heterogeneous tasks to heterogeneous processor dynamically in a distributed environment has been one of the challenging area of research in the field of Grid Computing System. Several general purpose approaches with some modified techniques has been developed. This paper presents a comparative study of different algorithms such as Directed Search Optimization (DSO) trained Artificial Neural Network (ANN), Parallel Orthogonal Particle Swarm Optimization (POPSO), Lazy Ant Colony Optimization (LACO), and Genetic Algorithms (GA), in the basis of workflow scheduling in grid environment of multiprocessors. It also presents various heuristic based methods used in task scheduling.