A hybrid heuristic resource allocation model for computational grid for optimal energy usage

  title={A hybrid heuristic resource allocation model for computational grid for optimal energy usage},
  author={Achal Kaushik and Deo Prakash Vidyarthi},
  journal={Int. J. Grid Util. Comput.},
Computational grid helps in faster execution of compute intensive jobs. The resource allocation for the job execution in computational grid demands a lot of characteristic parameters to be optimised but in the process the green aspect is ignored. Reducing the energy consumption in computational grid is a major recent issue among researchers. The conventional systems, which offer energy efficient scheduling strategies, ignore other quality of service parameters while scheduling the jobs. The… 

Energy consumption laxity-based quorum selection for distributed object-based systems

The energy consumption laxity-based quorum selection (ECLBQS) algorithm is proposed to construct a quorum for each method issued by a transaction so that the total electric energy consumption of servers to perform methods can be reduced in the quorum based locking protocol.

Performance improvement options of scientific applications on XeonPhi KNL architectures

  • S. Benedict
  • Computer Science
    Int. J. Knowl. Eng. Data Min.
  • 2018
Intel's recent manycore processor KNights Landing (KNL) promises high performance for scientific applications. Careful tuning for the complex chip architecture is required to efficiently exploit the



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

Green Energy Model for Grid Resource Allocation: A Graph Theoretic Approach

The proposed work explores how effectively the jobs submitted to the grid can be executed for optimal energy uses making no compromise on other desired related characteristic parameters, and develops a graph theoretic model for this purpose.

A Computational Grid Scheduling Model To Minimize Turnaround Using Modified GA

A multi entry point scheduling model for the computational grid which schedules the job to the grid resources based on the suitability of the resource and the turnaround offered to the job and the effectiveness of the proposed MGA based grid scheduling model is revealed.

Energy efficient genetic‐based schedulers in computational grids

Three genetic algorithms as energy‐aware grid schedulers are developed and empirically evaluated in three grid size scenarios in static and dynamic modes to address the independent batch scheduling in computational grid as a bi‐objective global minimization problem with Makespan and energy consumption as the main criteria.

Load Balancing in Computational Grid Using Genetic Algorithm

A model based on genetic algorithm, a search procedure based on evolutionary computation, is proposed, to achieve better load balancing in computational grid, and results reveal the effectiveness of the proposed model.

Genetic algorithm based schedulers for grid computing systems

The extensive experimental study showed that the GA-based schedulers outperform existing GA implementations in the literature for the problem and also revealed their efficiency when makespan and flowtime are minimized either in a hierarchical or a simultaneous optimization mode.

Survey on Grid Resource Allocation Mechanisms

The comprehensive analysis of cutting-edge research in the Grid domain presented in this work provides readers with an understanding of essential concepts of resource allocation mechanisms in Grid systems and helps them identify important and outstanding issues for further investigation and helps readers to choose the most appropriate mechanism for a given system/application.

A comparative study on resource allocation and energy efficient job scheduling strategies in large-scale parallel computing systems

This study highlights the strengths and weakness of various job scheduling polices and helps to choose an appropriate job scheduling policy in a given scenario and presents a comprehensive workload characterization for optimizing system’s performance and for scheduler design.

Genetic algorithm based scheduler for computational grids

  • M. AggarwalR. KentA. Ngom
  • Computer Science
    19th International Symposium on High Performance Computing Systems and Applications (HPCS'05)
  • 2005
This work presents a genetic algorithm based scheduler that can be used in both the intra-grid of a large organization and in a research grid consisting of large clusters, connected through a high bandwidth dedicated network.

Energy Efficient Resource Allocation in Distributed Computing Systems

The problem of mapping tasks onto a computational grid with the aim to minimize the power consumption and the makespan subject to the constraints of deadlines and architectural requirements is considered and a solution from cooperative game theory based on the concept of Nash Bargaining Solution is proposed.