Survey on Grid Resource Allocation Mechanisms

Abstract

Grid is a distributed high performance computing paradigm that offers various types of resources (like computing, storage, communication) to resource-intensive user tasks. These tasks are scheduled to allocate available Grid resources efficiently to achieve high system throughput and to satisfy A. Y. Zomaya University of Sydney, Sydney, Australia user requirements. The task scheduling problem has become more complex with the ever increasing size of Grid systems. Even though selecting an efficient resource allocation strategy for a particular task helps in obtaining a desired level of service, researchers still face difficulties in choosing a suitable technique from a plethora of existing methods in literature. In this paper, we explore and discuss existing resource allocation mechanisms for resource allocation problems employed in Grid systems. The work comprehensively surveys Gird resource allocation mechanisms for different architectures (centralized, distributed, static or dynamic). The paper also compares these resource allocation mechanisms based on their common features such as time complexity, searching mechanism, allocation strategy, optimality, operational environment and objective function they adopt for solving computing-and data-intensive applications. 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. It also helps readers to choose the most appropriate mechanism for a given system/application.

The scheduler for the grid­system based on the parameters monitoring of the computer components

“…In [1,2] the schedulers construction principles and implementation approaches for Grid have been considered in detail, the operation algorithms have been offered. However, despite a large number of works devoted to the Grid system resource management mechanisms, these mechanisms still need to be improved [2].…”

Performance aware scheduling considering resource availability in grid computing

“…The total makespan of a grid computing environment is defined as the largest makespans of grid resources. The makespan of a resource is the time slot between the start and completion of a sequence of jobs assigned to that resource [6,[10][11][12][13][14][15][16][17][18][19]. Actually, grid is considered as a high throughput system, and minimizing the total makespan of the grid increases the throughput of the environment accordingly.…”

“…Since decision about the assignment of jobs to resources and finding the best match between jobs and resources is an NP-complete problem [6,[10][11][12][13][14][15][16][17][19][20][21][22], we use Simulated Annealing (SA) meta-heuristic [11,16,[19][20][21][22][23] to propose a job scheduling algorithm to solve the problem. SA is a generalization of the Monte Carlo method for statistically finding the global optimum for multivariate functions.…”

Time and Energy Performance of Parallel Systems with Hierarchical Memory

“…This results in increasing interest in energyefficient scheduling of machines at the grid level [10,31,33]. Proper planning is especially important in the distributed case because communications and computations must be coordinated to avoid wasting energy in idle machines.…”