A Computational Grid Scheduling Model to Maximize Reliability Using Modified GA

被引:3
|
作者
Raza, Zahid [1 ,2 ]
Vidyarthi, Deo Prakash [1 ,3 ]
机构
[1] Jawaharlal Nehru Univ, Sch Comp & Syst Sci, New Delhi, India
[2] Banasthali Vidyapith Univ, Vanasthali, Rajasthan, India
[3] Banaras Hindu Univ, Dept Comp Sci, Varanasi, Uttar Pradesh, India
关键词
Computational Grid; Elitist Method; Genetic Algorithm; NP Hard Problems; Reliability; Scheduling;
D O I
10.4018/jghpc.2011010101
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
This paper presents a grid scheduling model to schedule a job on the grid with the objective of ensuring maximum reliability to the job under the current grid state. The model schedules a modular job to those resources that suit the job requirements in terms of resources while offering the most reliable environment. The reliability estimates depict true grid picture and considers the contribution of the computational resources, network links and the application awaiting allocation. The scheduling executes the interactive jobs while considering the looping structure. As scheduling on the grid is an NP hard problem, soft computing tools are often applied. This paper applies Modified Genetic Algorithm (MGA), which is an elitist selection method based on the two threshold values, to improve the solution. The MGA works on the basis of partitioning the current population in three categories: the fittest chromosomes, average fit chromosomes and the ones with worst fitness. The worst are dropped, while the fittest chromosomes of the current generation are mated with the average fit chromosomes of the previous generation to produce off-spring. The simulation results are compared with other similar grid scheduling models to study the performance of the proposed model under various grid conditions.
引用
收藏
页码:1 / 20
页数:20
相关论文
共 50 条
  • [31] Maximizing availability for task scheduling in computational grid using genetic algorithm
    Prakash, Shiv
    Vidyarthi, Deo Prakash
    [J]. CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE, 2015, 27 (01): : 193 - 210
  • [32] Provide a Method of Scheduling In Computational Grid Using Imperialist Competitive Algorithm
    Pahlevanzadeh, Mostafa
    HarounAbadi, Ali
    [J]. INTERNATIONAL JOURNAL OF COMPUTER SCIENCE AND NETWORK SECURITY, 2016, 16 (06): : 75 - 80
  • [33] Computational Grid System Load Balancing Using an Efficient Scheduling Technique
    Kumar, Prakash
    Kumar, Pradeep
    Kumar, Vikas
    [J]. INTERNATIONAL JOURNAL OF COMPUTER SCIENCE AND NETWORK SECURITY, 2015, 15 (08): : 72 - 76
  • [34] Using moldability to improve scheduling performance of parallel jobs on computational grid
    Huang, Kuo-Chan
    Shih, Po-Chi
    Chung, Yeh-Ching
    [J]. ADVANCES IN GRID AND PERVASIVE COMPUTING, PROCEEDINGS, 2008, 5036 : 116 - +
  • [35] MDP based link scheduling in wireless networks to maximize the reliability
    Xu, Jun
    Yang, Jianfeng
    Xie, Yinbo
    Guo, Chengcheng
    Yu, Yinbo
    [J]. WIRELESS NETWORKS, 2016, 22 (05) : 1659 - 1671
  • [36] Predicting the reliability of resources in computational grid
    Li, CJ
    Xiao, N
    Yang, XJ
    [J]. GRID AND COOPERATIVE COMPUTING GCC 2004, PROCEEDINGS, 2004, 3251 : 233 - 240
  • [37] A general model for the generation and scheduling of parameter sweep experiments in Computational Grid Environments
    Diaz, Javier
    Reyes, Sebastian
    Badia, Rosa M.
    Nino, Alfonso
    Munoz-Caro, Camelia
    [J]. ICCS 2010 - INTERNATIONAL CONFERENCE ON COMPUTATIONAL SCIENCE, PROCEEDINGS, 2010, 1 (01): : 565 - 572
  • [38] A stochastic model for scheduling programs to maximize outcome
    Shieh, YY
    Roberson, GH
    [J]. 11TH IEEE SYMPOSIUM ON COMPUTER-BASED MEDICAL SYSTEMS, PROCEEDINGS, 1998, : 113 - 116
  • [39] Fast simulation model for grid scheduling using HyperSim
    Phatanapherom, S
    Uthayopas, P
    Kachitvichyanukul, V
    [J]. PROCEEDINGS OF THE 2003 WINTER SIMULATION CONFERENCE, VOLS 1 AND 2, 2003, : 1494 - 1500
  • [40] QoS based resource scheduling by computational economy in computational grid
    Li, CL
    Li, LY
    [J]. INFORMATION PROCESSING LETTERS, 2006, 98 (03) : 119 - 126