A green energy model for resource allocation in computational grid using dynamic threshold and GA

被引:6
|
作者
Kaushik, Achal [1 ]
Vidyarthi, Deo Prakash [1 ]
机构
[1] Jawaharlal Nehru Univ, Sch Comp & Syst Sci, Delhi 110067, India
关键词
Computational grid; Green energy; Resource allocation; Genetic algorithm; Makespan; STRATEGIES;
D O I
10.1016/j.suscom.2016.01.001
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Computational grid helps compute intensive jobs in faster execution. By virtue of resource provisioning, very high demand of computational power can be facilitated though at the cost of high energy consumption. Many characteristic parameters are intended to be optimized, depending upon the requirements, while making resource allocation for the job execution in computational grid. Most often the green energy aspect, wherein one tries for better energy utilization, is ignored while allocating the grid resources to the jobs. Most of the grid scheduler aims to optimize the makespan, ignoring the energy aspect. Proposed work tries to optimize the energy making it a green energy model while making resource allocation in computational grid. In this, energy saving mechanism is implemented using a dynamic threshold method followed by the use of genetic algorithm which further consolidates the energy saving. It explores how effectively the jobs submitted to the grid can be executed with optimal energy uses and at the same time makes no compromise on other expected characteristic parameters. The proposed green energy model has been experimentally evaluated by its simulation. The result reveals the benefits and gives better insight for effective energy aware resource allocation. (C) 2016 Elsevier Inc. All rights reserved.
引用
收藏
页码:42 / 56
页数:15
相关论文
共 50 条
  • [1] A Green Energy Model for Resource Allocation in Computational Grid
    Kaushik, Achal
    Vidyarthi, Deo Prakash
    [J]. COMPUTER JOURNAL, 2015, 58 (07): : 1530 - 1547
  • [2] A green energy model for resource allocation in computational grid using differential evolution algorithm
    Rafie, Mahnaz
    [J]. WIRELESS NETWORKS, 2021, 27 (07) : 4773 - 4794
  • [3] A green energy model for resource allocation in computational grid using differential evolution algorithm
    Mahnaz Rafie
    [J]. Wireless Networks, 2021, 27 : 4773 - 4794
  • [4] Green Energy Model for Grid Resource Allocation: A Graph Theoretic Approach
    Kaushik, Achal
    Vidyarthi, Deo Prakash
    [J]. INTERNATIONAL JOURNAL OF GRID AND HIGH PERFORMANCE COMPUTING, 2014, 6 (02) : 52 - 73
  • [5] A fault-tolerant hybrid resource allocation model for dynamic computational grid
    Sheikh, Sophiya
    Nagaraju, A.
    Shahid, Mohammad
    [J]. JOURNAL OF COMPUTATIONAL SCIENCE, 2021, 48
  • [6] Utility driven dynamic resource allocation using competitive markets in computational grid
    Li, CL
    Li, LY
    Lu, ZD
    [J]. ADVANCES IN ENGINEERING SOFTWARE, 2005, 36 (06) : 425 - 434
  • [7] A hybrid heuristic resource allocation model for computational grid for optimal energy usage
    Kaushik, Achal
    Vidyarthi, Deo Prakash
    [J]. INTERNATIONAL JOURNAL OF GRID AND UTILITY COMPUTING, 2018, 9 (01) : 51 - 74
  • [8] Dynamic resource allocation for joint grid user and provider optimisation in computational grid
    Li Chunlin
    Li Layuan
    [J]. INTERNATIONAL JOURNAL OF COMPUTER APPLICATIONS IN TECHNOLOGY, 2006, 26 (04) : 242 - 250
  • [9] A formal model of dynamic resource allocation in grid computing environment
    Ismail, Leila
    Mills, Bruce
    Hennebelle, Alain
    [J]. PROCEEDINGS OF NINTH ACIS INTERNATIONAL CONFERENCE ON SOFTWARE ENGINEERING, ARTIFICIAL INTELLIGENCE, NETWORKING AND PARALLEL/DISTRIBUTED COMPUTING, 2008, : 685 - +
  • [10] Effective reformulation for resource allocation in computational grid
    Dong, Xiaoshe
    Mei, Yiduo
    Ma, Siyuan
    Gong, Guannan
    Zhu, Zhengdong
    [J]. INTERNATIONAL SYMPOSIUM ON ADVANCES IN COMPUTER AND SENSOR NETWORKS AND SYSTEMS, PROCEEDINGS: IN CELEBRATION OF 60TH BIRTHDAY OF PROF. S. SITHARAMA IYENGAR FOR HIS CONTRIBUTIONS TO THE SCIENCE OF COMPUTING, 2008, : 242 - 249