Hybrid Harmony Search with Firefly Algorithm for Job Scheduling in Big Data

Authors

  • D. S. Dayana  Department of Computer Applications, SRM Institute of Science and Technology, Chennai, Tamil Nadu, India

Keywords:

Firefly Algorithm, Multi-Stage Stochastic Integer Programming, hybrid HS/FA, Scheduling, Harmony Search, Ambiguity, Convergence Rate

Abstract

The bulk quantity of data can be allowed to dig out and to mine unknown information using the applications of big data analytics. In the proposed work, scheduling of jobs can be accomplished using Firefly Algorithm (FA). The objective is to minimize the job execution time, make best use of resources load. The difficulty in scheduling of jobs can be rectified using Multi-Stage Stochastic Integer Programming (MSSIP) and used to process ambiguity. This paper resolve ambiguity problem in big data analytics. To resolve job scheduling problem, Harmony Search Algorithm (HSA) and Firefly Algorithm (FA) is used, so that it make use of resources efficiently. It permits the resources to take the scheduling decisions on their own. The outcome demonstrates that the ambiguity can be resolved and the convergence rate can be improved using MSSIP algorithms in big data analytics.

References

  1. Hadoop. Apache Software Foundation, http://hadoop.apache.org,2015.
  2. K. Deb, "An introduction to genetic algorithms", Sadhana,vol. 24,no.4-5,pp.293

Downloads

Published

2018-02-28

Issue

Section

Research Articles

How to Cite

[1]
D. S. Dayana, " Hybrid Harmony Search with Firefly Algorithm for Job Scheduling in Big Data, IInternational Journal of Scientific Research in Computer Science, Engineering and Information Technology(IJSRCSEIT), ISSN : 2456-3307, Volume 3, Issue 1, pp.1540-1543, January-February-2018.