Skip to main content
Log in

An insect inspired approach for optimization of tasks scheduling in computational grids

  • Special Issue
  • Published:
Evolutionary Intelligence Aims and scope Submit manuscript

Abstract

The article suggests a novel optimization algorithm named Lepidoptera butterfly approach (LBA) that is inspired from the behavior of insects, American butterflies and their counterparts. This algorithm keenly observes the behavior of the Lepidoptera insects and tries to find an optimal solution through a larger solution space. The proposed algorithm LBA mimics the behavioral aspects of these insects. The insects (butterflies) migrate more often from one land to another in search of food particles and reproduction of offsprings. If they find the food particles and climate of the new land suitable, these insects often reproduce their offsprings in this new land. Hence, the suggested approach classifies the network of grids into two subnetworks (or two different lands) and thereby, generates two sub-populations. The algorithm then considers each individual subnetwork and their subpopulations. In our case, these are the jobs that contribute to each subnetwork and the offsprings that are reproduced are called as tasks. Our algorithm finds the best tasks and best jobs in every subnetwork and finally combines them and try to allocate the tasks/jobs to resources considering the constraints like cost and make-span time. However, this scheduling of tasks is considered as an NP-Complete problem. The algorithm is tested using 30 runs for simulation under these two constraints. This article makes a comparison with different existing optimization techniques like GA, TLBO, etc. The results signifies that our proposed approach of LBA performs better as compared to others. This inspires the authors to study the performance behavior of this approach in optimizing the scheduling problem in a computational grid environment under the constraints like time and cost.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13

Similar content being viewed by others

References

  1. Caminero A, Rana O, Caminero B, Carrión C (2011) Network-aware heuristics for inter-domain meta-scheduling in Grids. J Comput Syst Sci 77(2):262–281

    Article  MathSciNet  Google Scholar 

  2. Tiwari Pawan K, Vidyarthi DP (2016) Improved auto control ant colony optimization using lazy ant approach for grid scheduling problem. Future Gener Comput Syst 60:78–89

    Article  Google Scholar 

  3. Mathiyalagan P, Dhepthie UR, Sivanandam SN (2010) Grid scheduling using enhanced PSO algorithm. Int J Comput Sci Eng 2(2):140–145

    Google Scholar 

  4. Zhaohong J et al (2019) Ant colony optimization algorithm for scheduling jobs with fuzzy processing time on parallel batch machines with different capacities. Appl Soft Comput 75:548–561

    Article  Google Scholar 

  5. Izakian H, Ladani BT, Zamanifar K, Abraham A (2009) A novel particle swarm optimization approach for grid job scheduling. In: Proceedings of international conference on information systems, technology, and management. Springer, Berlin, pp 100–109

  6. Baykasoğlu A, Hamzadayi A, Köse SY (2014) Testing the performance of teaching–learning-based optimization (TLBO) algorithm on combinatorial problems: flow shop and job shop scheduling cases. Inf Sci 276:204–218

    Article  MathSciNet  Google Scholar 

  7. Wang G-G, Deb S, Cui Z (2015) Monarch butterfly optimization. Neural Comput. Appl. 31(7):1995–2014. https://doi.org/10.1007/s00521-015-1923-y

    Article  Google Scholar 

  8. Ibrahim AM, Tawhid MAA (2019) Hybridization of differential evolution and monarch butterfly optimization for solving systems of nonlinear equations. J Comput Des Eng 6(3):354–367

    Google Scholar 

  9. Das D, Tripathy CR, Tripathy PK, Kabat MR (2018) A genetic algorithm based approach for designing multi-state computational Grid with cost and bandwidth constraints. J King Saud Univ Comput Inf Sci. https://doi.org/10.1016/j.jksuci.2018.10.006

    Article  Google Scholar 

  10. Tripathy PK, Dash RK, Tripathy CR (2013) A new genetic algorithm-based method for topological optimization of interconnection networks. Int J Comput Appl 63(3):7–13

    Google Scholar 

  11. Tripathy PK, Dash RK, Tripathy CR (2012) A genetic algorithm-based approach for topological optimization of interconnection networks. Procedia Technol 6:196–205

    Article  Google Scholar 

  12. Mirjalili S (2015) The ant lion optimizer. Adv Eng Softw 83:80–98

    Article  Google Scholar 

  13. Kumar M, Kulkarni AJ, Satapathy SC (2018) Socio evolution & learning optimization algorithm: a socio-inspired optimization methodology. Future Gener Comput Syst 81:252–272

    Article  Google Scholar 

  14. Casavant TL, Kuhl GJ (1988) A taxonomy of scheduling in general-purpose distributed computing systems. IEEE Trans Softw Eng 14(2):141–154

    Article  Google Scholar 

  15. Casanova H et al (2000) Heuristics for scheduling parameter sweep applications in grid environments. In: 9th IEEE proceedings in workshop on heterogeneous computing, pp 349–363

  16. Gao Y, Rong H, Huang JZ (2005) Adaptive grid job scheduling with genetic algorithms. Future Gener Comput Syst 21(1):151–161

    Article  Google Scholar 

  17. Park BJ, Choi HR, Kim HS (2003) A hybrid genetic algorithm for the job shop scheduling problems. Comput Ind Eng 45(4):597–613

    Article  Google Scholar 

  18. Hiroyasu T, Miki M, Hamasaki M, Tanimura Y (2000) A new model of distributed genetic algorithm for cluster systems: dual individual DGA. In: Proceedings of the international conference on parallel and distributed processing techniques and applications, vol 1, pp 477–483

  19. Zareh S, Seyedjavadi HH, Erfani H (2012) Grid scheduling using a cooperative BFO algorithm. Am J Sci Res 62:78–87

    Google Scholar 

  20. Shivakumar BL, Amudha T (2012) A hybrid bacterial swarming methodology for job shop scheduling environment. Glob J Comput Sci Technol Hardw Comput 12(10):1–11

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Debashreet Das.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Das, D., Tripathy, C.R. & Tripathy, P.K. An insect inspired approach for optimization of tasks scheduling in computational grids. Evol. Intel. 14, 999–1013 (2021). https://doi.org/10.1007/s12065-020-00508-3

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12065-020-00508-3

Keywords

Navigation