i-manager Publications

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.

Periodicity:December - February'2018
DOI : 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.

Keywords

Soft Computing, Task Scheduling, Parallel Processing, Directed Neural Network (DNN), Directed Search Optimization (DSO), Genetic Algorithm (GA), Ant Colony Optimization (ACO), Particle Swarm Optimization (PSO)

How to Cite this Article?

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

References

[1]. Ahmad, I., & Kwok, Y.-K. (1994). A New Approach to Scheduling Parallel Programs Using Task Duplication. Parallel Processing, 1994. ICPP 1994 International Conference on (Vol. 2, pp. 47-51).

[2]. Boeres, C., Filho, J. V., & Rebello, V. E. F. (2004). A cluster- based strategy for scheduling task on heterogeneous processors. In Proceedings - Symposium on Computer Architecture and High Performance Computing (pp. 214-221).

[3]. Fan, C., Deng, H., Wang, F., Wei, S., Dai, W., & Liang, B. (2015). A Sur vey on Task Scheduling Method in Heterogeneous Computing System. 2015 8^th International Conference on Intelligent Networks and Intelligent Systems (ICINIS) (Vol. 1, pp. 90-93).

[4]. Hagras, T., & Janeček, J. (2004). A near lower-bound complexity algorithm for compile-time task-scheduling in heterogeneous computing systems. In Proceedings - ISPDC 2004: Third International Symposium on Parallel and Distributed Computing/HeteroPar '04: Third International Workshop on Algorithms, Models and Tools for Parallel Computing on Heterogeneous Networks (pp. 106-113).

[5]. Kafil, M., & Ahmad, I. (1998). Optimal task assignment in heterogeneous distributed computing systems. IEEE Concurrency, 6(3), 42-50.

[6]. Liu, C.-H., Li, C.-F., Lai, K.-C., & Wu, C.-C. (2006). A dynamic critical path duplication task scheduling algorithm for distributed heterogeneous computing systems. In 12^th International Conference on Parallel and Distributed Systems, 2006. (ICPADS) 2006 (Vol. 1, p. 8).

[7]. Omara, F. A., & Arafa, M. M. (2010). Genetic algorithms for task scheduling problem. Journal of Parallel and Distributed Computing, 70(1), 13-22.

[8]. Page, A. J., & Naughton, T. J. (2005). Dynamic Task Scheduling using Genetic Algorithms for Heterogeneous Distributed Computing. Parallel and Distributed Processing Symposium, 2005. Proceedings. 19^th IEEE International.

[9]. Tiwari, P. K., & Vidyarthi, D. P. (2016). Improved auto control ant colony optimization using lazy ant approach for grid scheduling problem. Future Generation Computer Systems, 60, 78-89.

[10]. Topcuoglu, H., Hariri, S., & Wu, M. (2002). Performance-effective and low-complexity task scheduling for heterogeneous computing. Parallel and Distributed Systems, 13(3), 260-274.

[11]. Tripathy, B., Dash, S., & Padhy, S. K. (2015a). Dynamic task scheduling using a directed neural network. Journal of Parallel and Distributed Computing, 75, 101-106.

[12]. Tripathy, B., Dash, S., & Padhy, S. K. (2015b). Multiprocessor scheduling and neural network training methods using shuffled frog-leaping algorithm. Computers & Industrial Engineering, 80, 154-158.

[13]. Visalakshi, P., & Sivanandam, S. N. (2009). Dynamic task scheduling with load balancing using hybrid particle swarm optimization. Int. J. Open Problems Compt. Math, 2(3), 475-488.

	North Americas,UK, Middle East,Europe		India	Rest of world
	USD	EUR	INR	USD-ROW
Pdf	35	35	200	20
Online	35	35	200	15
Pdf & Online	35	35	400	25

A Comparative Study on Dynamic Task Scheduling algorithms

Abstract

Keywords

How to Cite this Article?

References

If you have access to this article please login to view the article or kindly login to purchase the article

Purchase Instant Access

Options for accessing this content: