Solving Grid Scheduling Problems Using Selective Breeding Algorithm

  • P. Sriramya
  • R. A. KarthikaEmail author
Conference paper
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 1045)


Grid scheduling is characterized as the way toward settling on planning choices including resources over multiple administrative domains. This procedure can search through different administrative areas to utilize a particular machine or scheduling one job for exhausting various resources at a particular node or multiple nodes. From a grid point of view, a job is anything that needs a resource. The primary objective of grid is to give service with high dependability and minimal effort for substantial volumes of clients and support teamwork. In this paper, we consider a directed acyclic graph (DAG) with nodes and edges where the nodes are considered the task and the edges specify the order of execution of the tasks as a grid. This kind of problem is called the precedence-constrained problem. The selective breeding algorithm is an efficient algorithm to solve NP-hard problems. One such example of NP-hard problem is the precedence-constrained problem. So we consider SBA algorithm to solve precedence-constrained problems and found optimal solution of 13 units when compared with the traditional methods of 23 units. And it is also proved that the amount of waiting time is reduced greatly when compared to the traditional methods. So by implementing SBA for the grid scheduling problem more time is saved and is proved to be efficient.


Selective breeding algorithm Precedence-constrained problem Grid scheduling Directed acyclic graph 


  1. 1.
    Foster, I., Kesselman, C.: Computational Grids Blueprint for a New Computing Infrastructure, pp. 15–52. Morgan Kaufmann, San Francisco, CA (1999)Google Scholar
  2. 2.
    Foster, I., Kesselman, C., Salisbury, C., Tuecke, S.: The data grid: towards an architecture for the distributed management and analysis of large scientific data sets. J. Netw. Comput. Appl. 23(3), 187–200 (2001)Google Scholar
  3. 3.
    Jin, H., Zheng, R., Zhang, Q., Li, Y.: Components and workflow based grid programming environment for integrated image-processing applications. In: Concurrency and Computation: Practice and Experience, vol. 18, no. 14. Wiley Ltd., pp. 1857–1869 (2006)Google Scholar
  4. 4.
    Yagoubi, B., Meddeber, M.: A load balancing model for grid environment. In: Proceeding of 22nd international symposium on computer and information sciences (ISCISC 2007), pp. 1–7 (2007)Google Scholar
  5. 5.
    Ni, L., Zhang, J., Yan, C., Jiang. C.: Heuristic algorithm for task scheduling based on mean load. In: First international conference on semantics, knowledge and grid (SKG’05), Beijing, China 27–29 Nov 2009Google Scholar
  6. 6.
    Shah, H: A low-complexity task scheduling algorithm for heterogeneous computing systems. In: Asia Modeling Symposium (AMS’09), Indonesia (2009)Google Scholar
  7. 7.
    Ramya, R., Thomas, S.: An optimal job scheduling algorithm in computational grids. In: The international conference on communication, computing and information technology (ICCCMIT), pp. 12–16 (2012)Google Scholar
  8. 8.
    Keerthika, P., Kasthuri, N.: An efficient grid scheduling algorithm with fault tolerance and user satisfaction. Math. Prob. Eng. 2013(Article ID 340294), 1–9 (2013)Google Scholar
  9. 9.
    Chauhan, P., Nitin: Decentralized scheduling algorithm for DAG based tasks on P2P grid. J. Eng. 2014(Article ID 202843), 14 pages (2014)Google Scholar
  10. 10.
    Zhu, L., Su, Z., Guo, W., Jina, Y., Suna, W., Hua, W.: Dynamic multi DAG scheduling algorithm for optical grid environment. In: Network Architectures, Management, and Applications V, Proc. of SPIE, vol. 6784, 67841F (2007)Google Scholar
  11. 11.
    Sriramya, P., Parvathavarthini, B., Balamurugan, T.: A novel evolutionary selective breeding algorithm and its application. Asian J. Sci. Res. 6, 107–114 (2013)CrossRefGoogle Scholar
  12. 12.
    Sriramya, P., Parvathavarthini, B.: Performance analysis of selective breeding algorithm on one dimensional bin packing problems. J. Inst. Eng. 93, 255–258 (2013)Google Scholar
  13. 13.
    Galinier, P., Hao, J.-K.: Hybrid evolutionary algorithms for graph coloring. J. Comb. Optim. 3, 379–397 (1999)MathSciNetCrossRefGoogle Scholar
  14. 14.
    Bidgoli, A.M., Nezad, Z.M.: A new scheduling algorithm design for grid computing tasks. In: 5 Symposium on Advances in science and Technology, Iran, pp. 21–30 (2011)Google Scholar

Copyright information

© Springer Nature Singapore Pte Ltd. 2020

Authors and Affiliations

  1. 1.Saveetha School of EngineeringSaveetha Institute of Medical and Technical SciencesChennaiIndia
  2. 2.Vels Institute of Science Technology & Advanced StudiesChennaiIndia

Personalised recommendations