Skip to main content

Advertisement

SpringerLink
Log in

Efficient allocation of independent gridlet on small, medium, and large grid

  • Original Article
  • Published:
Personal and Ubiquitous Computing Aims and scope Submit manuscript

Abstract

Gridlet allocation in a computational grid environment is a major research issue to obtain not only the efficient gridlet allocation technique but also the time needed to obtain the efficient allocation technique. Grid computing networks have various nodes to process user jobs. To achieve the high performance of computational grid, task scheduling is an important issue. The users who are using services of grid systems are more cautious about time to complete their job. Hence, this work concentrates on gridlet allocation method used for time reduction by a genetic algorithm with the MapReduce programming model for independent tasks in computational grid. In computational grid environment, multi-objective problem formulation minimization of makespan and flowtime is considered. In this proposed technique, fitness function formulation for makespan and flowtime has been formulated mathematically. The genetic algorithm with the MapReduce programming model is implemented using MapReduce written in Java and then combined with GridSim. The experimental outcome with regard to time needed, flowtime, and makespan clearly reveals that the genetic algorithm with the MapReduce model effectively optimizes time, makespan, and flowtime in computational grid environment. A comparative study of performance efficiency among genetic algorithm with the MapReduce and sequential genetic algorithm (SGA) and parallel genetic algorithm (PGA) depicts the usefulness of the model. The execution time achieved by GA with the MapReduce model in small grid is 10.48 s, medium grid is 18.76 s, and large grid is 33.73 s.

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

Access this article

Log in via an institution

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

Similar content being viewed by others

References

  1. Foster I, Kesselman C (2004) Grid 2: blueprint for a new computing infrastructure. Morgan Kaufmann, An Imprint of Elsevier

    Google Scholar 

  2. Bora U, Cevdet A, Kamer K, Murat I (2006) Task assignment in heterogeneous computing systems. J Parallel Distrib Comput 66:32–46

    Article  MATH  Google Scholar 

  3. Braun TD, Siegel HJ, Beck N, Boloni LL, Maheswaran M, Reuther AI, Robertson JP, Theys MD, Yao B (2001) Comparison of eleven static heuristics for mapping a class of independent tasks onto heterogeneous distributed computing systems. J Parallel Distrib Comput 61:810–837

    Article  MATH  Google Scholar 

  4. Liu H, Abraham A, Hassanien A (2010) Scheduling jobs on computational grids using a fuzzy particle swarm optimization algorithm. Futur Gener Comput Syst 26(8):1336–1343

    Article  Google Scholar 

  5. Kashyap R, Vidyarthi DP (2013) Security driven scheduling model for computational grid using NSGA II. J Grid Comput 11(4):721–734

    Article  Google Scholar 

  6. Durillo JJ, Nebro AJ, Luna F and Alba E (2008) A study of master-slave approaches to parallelize NSGA-II, IEEE International Symposium on Parallel and Distributed Processing, Miami, FL, USA, 1–8. https://doi.org/10.1109/IPDPS.2008.4536375

  7. Rajeswari D, Jawahar Senthil Kumar V (2016) Design and implementation of non-dominated sorting genetic algorithm scheduler using Mapreduce model. Asian J Inf Technol 15:2584–2593. https://doi.org/10.36478/ajit.2016.2584.2593

  8. Miyuru D, Yonggang W, and Rui F (2016) Data center energy consumption modeling: A Survey. Commun. Surveys Tuts. 18(1):732–794. https://doi.org/10.1109/COMST.2015.2481183

  9. Rajeswari D, Prakash M, Ramamoorthy S, Sudhakar S (2021) MapReduce framework based gridlet allocation technique in computational grid. Comput Electrical Eng 92:107131

    Article  Google Scholar 

  10. Parsa S, Entezari Maleki R (2012) Task dispatching approach to reduce the number of waiting tasks in grid environments. J Supercomputing 59(1):469–484

    Article  Google Scholar 

  11. Rajeswari D, Prakash M, Suresh J (2019) Computational grid scheduling architecture using MapReduce model-based non-dominated sorting genetic algorithm. Soft Comput 23:8335–8347. https://doi.org/10.1007/s00500-019-03946-z

    Article  Google Scholar 

  12. Munir EU, LI J-Z, Shi S-F and Rasool Q (2007) Performance analysis of task scheduling heuristics in grid, In: ICMLC’07: Proceedings of the International Conference on Machine Learning and Cybernetics. 6:3093–3098

  13. Freund RF et al (1998) Scheduling resources in multi-user, heterogeneous, computing environments with SmartNet, Proceedings Seventh Heterogeneous Computing Workshop (HCW'98), Orlando, FL, USA, 184–199. https://doi.org/10.1109/HCW.1998.666558 

  14. Maheswaran M, Ali S, Siegel HJ, Hensgen D, Freund RF (1999) Dynamic mapping of a class of independent tasks onto heterogeneous computing systems. J Parallel Distrib Comput 59(2):107–131

    Article  Google Scholar 

  15. Abraham A, Buyya R, and Nath B (2000) Nature’s heuristics for scheduling jobs on computational grids. In Sinha B, & Gupta R (Eds.) Recent Advances in Computing and Communications: Proceeedings of the 8th International Conference on Advanced Computing and Communications. 45–52

  16. Hossein S, Doulabi H, Avazbeigi M, Arab S, Davoudpour H (2012) An effective hybrid simulated annealing and two mixed integer linear formulations for just-in-time open shop scheduling problem. Int. J Adv Manuf Technol 59(9-12):1143–1155

    Article  Google Scholar 

  17. Pacini E, Mateos C (2015) Carlos Garcia Garino, Balancing throughput and response time in online scientific clouds via ant colony optimization. Adv Eng Softw 84:31–47

    Article  Google Scholar 

  18. Kang Q (2011) Hong he, A novel discrete particle swarm optimization algorithm for meta-task assignment in heterogeneous computing systems. Microproc Microsyst 35(1):10–17

    Article  Google Scholar 

  19. Jung D, Suh T, Heonchang Y, Gil J (2014) A workflow scheduling technique using genetic algorithm in spot instance based cloud. KSII Transac Int Inf Sys 8(9)

  20. Izakian H, Abraham A, Snasel V (2009) Comparison of heuristics for scheduling independent tasks on heterogeneous distributed environments. IEEE Contr Syst Mag 1:8–12

    Google Scholar 

  21. Abraham A, Liu H, Grosan C, Xhafa F (2008) Nature inspired meta-heuristics for grid scheduling: single and multi-objective optimization approaches, In: Xhafa, F., Abraham, A. (eds) Metaheuristics for Scheduling in Distributed Computing Environments. Studies in Computational Intelligence, Springer, Berlin, Heidelberg. 146. https://doi.org/10.1007/978-3-540-69277-5_9

  22. Chao J, Christian V and Rajkumar B (2008) MRPGA: An extension of MapReduce for parallelizing genetic algorithms. In Proceedings of the 2008 IEEE Fourth International Conference on eScience, Indianapolis, IN, USA, 214–221

  23. Verma A, Llora X, Goldberg DE, Campbell RH (2009) Scaling genetic algorithms using MapReduce. In: Proc. 9th International Conference on Intelligent Systems Design and Applications, USA, pp 13–18

  24. Deb K, Pratap A, Agarwal S, Meyarivan T (2002) A fast elitist multiobjective genetic algorithm: NSGA-II. IEEE Transac Evol Comput 6:182–197

    Article  Google Scholar 

  25. Subhashini G, Bhuvaneswari MC (2010) A fast and elitist bi-objective evolutionary algorithm for scheduling independent tasks on heterogeneous systems, ICTACT. J. On Soft Comput 01:9–17

    Google Scholar 

  26. Carretero J, Xhafa F, Abraham A (2007) Genetic algorithm based schedulers for grid computing systems, International journal of Innovative Computing. Inf Contr 3(6)

  27. http://hadoop.apache.org/docs/r1.2.1/mapred_tutorial.html (accessed 06.05.2019)

Download references

Author information

Authors and Affiliations

  1. Department of Data Science and Business Systems, School of Computing, College of Engineering and Technology, SRM Institute of Science and Technology, Kattankulathur, Tamil Nadu, 603203, India

    D. Rajeswari

  2. Department of Computing Technologies, School of Computing, College of Engineering and Technology, SRM Institute of Science and Technology, Kattankulathur, Tamil Nadu, 603203, India

    S. Ramamoorthy & R. Srinivasan

Authors
  1. D. Rajeswari
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. S. Ramamoorthy
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. R. Srinivasan
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to D. Rajeswari.

Ethics declarations

Ethics approval

This article does not contain any studies with human participants or animals performed by any of the authors.

Conflict of interest

The authors declare no competing interests.

Additional information

Publisher’s note

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

Rights and permissions

Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Rajeswari, D., Ramamoorthy, S. & Srinivasan, R. Efficient allocation of independent gridlet on small, medium, and large grid. Pers Ubiquit Comput 27, 1029–1037 (2023). https://doi.org/10.1007/s00779-023-01717-0

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00779-023-01717-0

Keywords

Search

Navigation