Skip to main content

Advertisement

SpringerLink
Log in

A novel scheduling model for computational grid using quantum genetic algorithm

  • Published:
The Journal of Supercomputing Aims and scope Submit manuscript

Abstract

The Computational Grid (CG) provides a wide distributed platform for high end computing intensive applications. Scheduling on Computational grid is known to be NP-Hard problem and requires an efficient solution. Recently, quantum inspired computing has been introduced in the literature to solve such a complex combinatorial optimization problem efficiently. Combination of Genetic Algorithm (GA) and quantum concept evolves a new meta-heuristic technique known as Quantum Genetic Algorithms (QGA). QGA is a search procedure based on evolutionary computation and Quantum Computing (QC). This paper proposes a novel technique of scheduling in computational grid using QGA. The work simulates the model to study its performance. It also makes a comparative study with a GA-based scheduling model. Simulation results reveal the effectiveness of the model.

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
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15
Fig. 16
Fig. 17
Fig. 18
Fig. 19
Fig. 20
Fig. 21
Fig. 22
Fig. 23
Fig. 24
Fig. 25
Fig. 26
Fig. 27
Fig. 28
Fig. 29
Fig. 30
Fig. 31
Fig. 32
Fig. 33
Fig. 34
Fig. 35
Fig. 36
Fig. 37
Fig. 38

Similar content being viewed by others

References

  1. Abawajy JH (2005) Automatic job scheduling policy for grid computing. In: LNCS, vol 3516. Springer, Verlag, pp 101–104

    Google Scholar 

  2. Aggarwal M, Kent RD, Ngom A (2005) Genetic algorithm based schedulers for the computational grids. In: Proceedings of the 19th international symposium on high performance computing systems and applications (HPCS’05). IEEE Computer Society, Washington, pp 209–215

    Chapter  Google Scholar 

  3. Berman F, Hey AJG, Fox GC (2003) Grid computing: making the global infrastructure a reality. Wiley, New York

    Google Scholar 

  4. Buyya R, Abramson D, Giddy J (2000) Nimrod/G: an architecture for resource management and scheduling system in a global computational grid. In: Proceedings of the high performance computing Asia, China, vol 1. IEEE CS Press, Washington, pp 283–289

    Google Scholar 

  5. Abraham A, Buyya R, Nath B (2000) Nature’s heuristics for scheduling jobs on computational grids. In: Proceedings of the 8th IEEE international conference on advanced computing and communications (ADCOM’00), India, pp 1–8

    Google Scholar 

  6. Chang RS, Chang JS, Lin PS (2009) An ant algorithm for balanced job scheduling in grids. Future Gener Comput Syst 25:20–27

    Article  Google Scholar 

  7. Chen CK, Yu KM (2008) An evaluation based dynamic scheduling algorithm in grid computing environment. In: Proceedings of the 8th international conference on intelligent systems design and applications (ISDA’08). IEEE Computer Society, Washington, pp 450–455

    Google Scholar 

  8. Chen WN, Zhang J (2009) An ant colony optimization approach to grid work flow scheduling problem with various QoS requirements. IEEE Trans Syst Man Cybern, Part C, Appl Rev 39(1):29–43

    Article  Google Scholar 

  9. Cooper RB (1977) Introduction to queuing theory. Macmillan, New York

    Google Scholar 

  10. Foster I, Kesselman C (2004) Grid 2: blueprint for a new computing infrastructure. Morgan Kaufmann, San Francisco

    Google Scholar 

  11. 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 

  12. Grama A, Gupta A, Karypis G, Kumar V (2003) Introduction to parallel computing. Addison Wesley, Boston

    Google Scholar 

  13. Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. Freeman, New York

    MATH  Google Scholar 

  14. Goldenberg DE (2005) Genetic algorithms in search optimization and machine learning. Pearson Education, New Delhi, pp 215–290

    Google Scholar 

  15. Gu J, Gu X, Gu M (2009) A novel parallel quantum genetic algorithm for stochastic job shop scheduling. J Math Anal Appl 355:63–81

    Article  MathSciNet  MATH  Google Scholar 

  16. Han KH, Kim JH (2002) Quantum-inspired evolutionary algorithm for a class of combinatorial optimization. IEEE Trans Evol Comput 6(6):580–593

    Article  Google Scholar 

  17. Han KH, Kim JH (2004) A quantum inspired evolutionary algorithm with a new termination criterion, H ε gate and two phase scheme. IEEE Trans Evol Comput 8(2):156–169

    Article  Google Scholar 

  18. Li CP, Song PK, Shang HF (2011) Double chains quantum genetic algorithm with application to neuro-fuzzy controller design. Adv Eng Softw 42(10):875–886

    Article  MATH  Google Scholar 

  19. Martino VD, Mililotti M (2004) Sub optimal scheduling in a grid using genetic algorithms. Parallel Comput 30:553–565

    Article  Google Scholar 

  20. Mitchell M (2005) An introduction to genetic algorithms. Pearson Education, New Delhi

    Google Scholar 

  21. Niu Q, Zhou F, Zhou T (2010) Quantum genetic algorithm for hybrid flow shop scheduling problem to minimize total completion time. In: LNCS, vol 6329. Springer, Berlin, pp 21–29. Part (II)

    Google Scholar 

  22. Mingscheng Y (2010) In: Quantum computation, quantum theory and AI, Artificial intelligence, vol 174, pp 162–176

    Google Scholar 

  23. Parhami B (2002) Introduction to parallel processing: algorithms and architectures. Plenum, New York

    Google Scholar 

  24. Prakash S, Vidyarthi DP (2012) Observations on effect of IPC in GA based scheduling on computational grid. Int J Grid High Perform Comput 4(1):66–79

    Article  Google Scholar 

  25. Quinn MJ (2005) Parallel computing: theory and practices. PHI Learning, New Delhi

    Google Scholar 

  26. Raza Z, Vidyarthi DP (2009) A computational grid scheduling model to minimize turnaround time using modified GA. Int J Artif Intell 3(A49):86–106

    MATH  Google Scholar 

  27. Raza Z, Vidyarthi DP (2009) GA based scheduling model for computational grid to minimize turnaround time. Int J Grid High Perform Comput 1(4):70–90

    Article  Google Scholar 

  28. Silberschatz A, Galvin PB, Gagne G (2004) Operating systems concepts. Wiley, New Delhi

    Google Scholar 

  29. Sinnen O, Sousa LA (2005) Communication contention in task scheduling. IEEE Trans Parallel Distrib Syst 16(6):503–515

    Article  Google Scholar 

  30. Tanenbaum AS (2002) Modern operating systems. PHI Learning, New Delhi

    Google Scholar 

  31. Tanenbaum AS (2002) Distributed operating system. Pearson Education, New Delhi

    Google Scholar 

  32. Tiwari PK, Vidyarthi DP (2011) A variant of quantum genetic algorithm and its possible applications. In: Proceedings of the Springer, Advances in intelligent and soft computing, vol 130, pp 797–811

    Google Scholar 

  33. Tripathi AK, Sarker BK, Kumar N, Vidyarthi DP (2000) A GA based multiple task considering load. Int J High Speed Comput 11(4):203–214

    Article  MATH  Google Scholar 

  34. Vidyarthi DP, Sarker BK, Tripathi AK, Yang LT (2009) Scheduling in distributed computing systems: analysis, design, and models. Springer, Berlin

    Book  MATH  Google Scholar 

  35. Xhafa F, Carretero J, Abraham A (2007) Genetic algorithm based schedulers for grid computing systems. Int J Innov Comput Inf Control 3(6):1–19

    Google Scholar 

  36. Xhafa F, Abraham A (2008) Meta-heuristics for grid scheduling problems. In: Studies in computational intelligence series, vol 146. Springer, Berlin, pp 1–37

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Jawaharlal Nehru University, New Delhi, India

    Shiv Prakash & Deo Prakash Vidyarthi

Authors
  1. Shiv Prakash
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Deo Prakash Vidyarthi
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Deo Prakash Vidyarthi.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Prakash, S., Vidyarthi, D.P. A novel scheduling model for computational grid using quantum genetic algorithm. J Supercomput 65, 742–770 (2013). https://doi.org/10.1007/s11227-012-0864-9

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11227-012-0864-9

Keywords

Search

Navigation