Market-Driven Based Resource Scheduling Algorithm in Computational Grid

Improving the grid resource matching performance under large-scale users and computing resources environment is an important and challenging problem. Many existing grid resource matching and scheduling algorithms need search and compare every grid computing resource node without considering characteristics of grid resource and users' behavior. At the same time, with service oriented grid development, grid system should provide personalized service in scheduling process. Therefore, this paper proposes a novel grid resource matching algorithm based improved collaborative filtering algorithm that can give user recommendation resource set by computing the best approximate resource based on user's behavior.

The emerging computational grid infrastructure consists of heterogeneous resource in widely distributed autonomous domains, which makes resource scheduling even more challenging. In this paper, we propose an adaptive resource scheduling algorithm for computational grid called BLBD (based on load balancing and demand). According to the computational grid job's personal resource requirements, the system load of computational grid nodes and the load balancing of computational grid system, the algorithm choose an appropriate node self adaptively for computational grid job from the candidates. It has been successfully tested in NPU campus computational grid environment. The experimental result shows that the new task scheduling algorithm can lead to significant performance gain for a variety of applications

Grid Computing provides sharing of geographically distributed resources among large scale complex applications. Due to dynamic nature of resources in grid, there is a need of highly efficient job scheduling and resource management policies in grid. In this paper, a novel Grid Resource Scheduler (GRS) is proposed to effectively utilize the available resources in Grid. Proposed GRS contributes, an optimal job scheduling algorithm on Job Rank-Backfilling policy and a resource matching algorithm based on ranking of resources with best fit allocation model. Performance of GRS is measured by considering a web based BLAST algorithm -- a bioinformatics application -- . GRS aims in reducing; Make span of the job workflow and execution time of varied size jobs. The experimental results prove that proposed job scheduling and resource matching algorithms performs better when evaluated against widely used FCFS job scheduling and biggest free resource matching strategies.

\n\t\t\t\t\tThis paper addresses the problem of resource scheduling in a grid computing environment. One of the main goals of grid computing is to share system resources among geographically dispersed users, and schedule resource requests in an efficient manner. Grid computing resources are distributed, heterogeneous, dynamic, and autonomous, which makes resource scheduling a complex problem. This paper proposes a new approach to resource scheduling in grid computing environments, the hierarchical stochastic Petri net (HSPN). The HSPN optimizes grid resource sharing, by categorizing resource requests in three layers, where each layer has special functions for receiving subtasks from, and delivering data to, the layer above or below. We compare the HSPN performance with the Min-min and Max-min resource scheduling algorithms. Our results show that the HSPN performs better than Max-min, but slightly underperforms Min-min.\n\t\t\t\t

The aim of this thesis is to design and implement a new Grid Resource Management methodology, where non-massive resources owners would be able to share their resources and integrate human collaboration across multiple domains regardless of network technology, operative platform or administrative domain.<br/>This thesis proposes a distributed and heuristic policy-based resource management architecture for large-scale Grids. The resource management architecture proposed herein is composed of four main building blocs: services management, resource discovery and monitoring, resource scheduling and jobs allocation and activation. The Grid Services Management (GSM) and Jobs Allocation and Activation (JAA) are supported by means of a Policy-based Grid Resource Management Architecture (PbGRMA). This architecture is able to identify service needs arising from diverse sources during the deployment and management of Grid Services, such as requirements demanded by customers, applications and network conditions. Afterwards, the PbGRMA merges these requirements into deployment policies for the corresponding Grid Services. The Grid Resource Discovery and Monitoring (GRDM) is supported by the introduction of the SNMP-based Balanced Load Monitoring Agents for Resource Scheduling (SBLOMARS), in which network and computational resources are monitored by distributed agents. This allows for a flexible, heterogeneous and scalable monitoring system. The Grid Resource Scheduling (GRS) is based on the Balanced Load Multi-Constrained Resource Scheduler (BLOMERS). This heuristic scheduler represents an alternate way of solving the inherent NP-hard problem for resource scheduling in large-scale distributed networks by means of the implementation of a Genetic Algorithm.<br/>Finally, based on the outcome of both the GRDM and GRS, the PbGRMA allocates the corresponding Grid Services by means of its interfaces with Globus ToolKit Middleware and Unix-based CLI commands along of any large-scale Grid Infrastructure. <br/>The synergy obtained by these components allows Grid administrators to exploit the available resources with predetermined levels of Quality of Service (QoS), reducing computational costs and makespan in resource scheduling while ensuring that the resource load is balanced throughout the Grid. The makespan of a schedule is the time required for all jobs to be processed when no one job could be interrupted during its execution and each node can perform at most one operation at any time.<br/>This new approach has been successfully tested in a real large-scale scenario such as Grid5000. The results presented along this Thesis show that our general solution is a reliable, flexible and scalable architecture to deploy and manage Grid Services in large-scale Grid Infrastructures. Moreover, the substitution of the heuristic algorithm approach used into the Grid Resource Scheduling (GRS) phase by other non-heuristics selection algorithms could make our solution useful in smaller Grid Infrastructures.

A distributed multiple dimensional QoS constrained resource scheduling optimization policy in computational grid

Selecting appropriate resources for running a job efficiently is one of the common objectives in a computational grid. Resource scheduling should consider the specific characteristics of the application, and decide the metrics to be used accordingly. This paper presents a distributed resource scheduling framework mainly consisting of a job scheduler and a local scheduler. In order to meet the requirements of different applications, we adopt HGSA, a Heuristic-based Greedy Scheduling Algorithm, to schedule jobs in the grid, where the heuristic knowledge is the metric weights of the computing resources and the metric workload impact factors. The metric weight is used to control the effect of the metric on the application. For different applications, only metric weights and the metric workload impact factors need to be changed, while the scheduling algorithm remains the same. Experimental results are presented to demonstrate the adaptability of the HGSA.

Computational grids have recently attracted considerable attention as cost‐effective platforms for parallel processing. Generally, a parallel program carried out on such a platform can be characterized as a directed acyclic graph (DAG). To take full advantage of available resources in grids and achieve high computational performance, an effective DAG scheduling algorithm is indispensable. This study presents a novel constructive algorithm based on the Fast Ant System (FANT). The proposed algorithm, namely, the Fast Ant System for Task Matching and Scheduling (FANT‐TMS) algorithm, determines the scheduling order of all tasks in a parallel program and, then, allocates these tasks to appropriate processing elements in a computational grid, thereby minimizing total completion time of the parallel program. Performance of the FANTTMS algorithm is demonstrated by comparison with a genetic algorithm (GA)‐based scheduling technique in terms of overall schedule length of randomly generated DAGs. Experimental results demonstrate that the proposed algorithm outperforms the conventional GA‐based approach. Additionally, a novel local search strategy is devised that further enhances solution quality obtained with the FANT‐TMS algorithm.

An integrated security-aware job scheduling strategy for large-scale computational grids

In trust-based network computing environment, in order to establish a harmonious network environment, and enhance the network resources sharing utilization, resources scheduling research faces more problems than ever before. A resource scheduling algorithm, using cooperative particle optimization and putting task completion price and overall system trust benefits as optimized object, is proposed based on the trust model proposed by Internet-based Virtual Computing Environment (iVCE). Simulation results indicate that the algorithm has obvious performance advantage in the aspects of whole system credibility and resource utilization rate than other classic scheduling algorithms. The algorithm can realize rational scheduling of network resources, and optimize the system performance in trusted computing environment.

Performance evaluation of grid resource management and scheduling system is of key importance to the success of the grid. In this paper, we introduce a generalized stochastic Petri net (GSPN) model for such purpose. The model is simple with clarity and can be applied to other research issues on grid to provide them with performance evaluation capabilities.

The proliferation of the Internet of Things (IoT) and wireless sensor networks enhances data communication. The demand for data communication rapidly increases, which calls the emerging edge computing paradigm. Edge computing plays a major role in IoT networks and provides computing resources close to the users. Moving the services from the cloud to users increases the communication, storage, and network features of the users. However, massive IoT networks require a large spectrum of resources for their computations. In order to attain this, resource scheduling algorithms are employed in edge computing. Statistical and machine learning-based resource scheduling algorithms have evolved in the past decade, but the performance can be improved if resource requirements are analyzed further. A deep learning-based resource scheduling in edge computing IoT networks is presented in this research work using deep bidirectional recurrent neural network (BRNN) and convolutional neural network algorithms. Before scheduling, the IoT users are categorized into clusters using a spectral clustering algorithm. The proposed model simulation analysis verifies the performance in terms of delay, response time, execution time, and resource utilization. Existing resource scheduling algorithms like a genetic algorithm (GA), Improved Particle Swarm Optimization (IPSO), and LSTM-based models are compared with the proposed model to validate the superior performances.

A novel multi-agent reinforcement learning approach for job scheduling in Grid computing

In order to resolve resource management and scheduling problem in Manufacturing Grid (MG) – an application of Grid technology, we develop a resource management and scheduling system with the interaction of Manufacturing Grid Information Service (MGIS) and the Manufacturing Grid Resource Scheduler (MGRS). The former, MGIS, provides fundamental mechanisms for remote resource encapsulating, registration, and monitoring, and the latter, MGRS, performs scheduling roles as Global Process Planning (GPP) analyzing, resource discovery, resource selection, and resource mapping.

The accelerated development in peer‐to‐peer and Grid computing has positioned them as promising next‐generation computing platforms. They enable the creation of virtual enterprises for sharing resources distributed across the world. However, resource management, application development and usage models in these environments is a complex undertaking. This is due to the geographic distribution of resources that are owned by different organizations or peers. The resource owners of each of these resources have different usage or access policies and cost models, and varying loads and availability. In order to address complex resource management issues, we have proposed a computational economy framework for resource allocation and for regulating supply and demand in Grid computing environments. This framework provides mechanisms for optimizing resource provider and consumer objective functions through trading and brokering services. In a real world market, there exist various economic models for setting the price of services based on supply‐and‐demand and their value to the user. They include commodity market, posted price, tender and auction models. In this paper, we discuss the use of these models for interaction between Grid components to decide resource service value, and the necessary infrastructure to realize each model. In addition to usual services offered by Grid computing systems, we need an infrastructure to support interaction protocols, allocation mechanisms, currency, secure banking and enforcement services. We briefly discuss existing technologies that provide some of these services and show their usage in developing the Nimrod‐G grid resource broker. Furthermore, we demonstrate the effectiveness of some of the economic models in resource trading and scheduling using the Nimrod/G resource broker, with deadline and cost constrained scheduling for two different optimization strategies, on the World‐Wide Grid testbed that has resources distributed across five continents. Copyright © 2002 John Wiley & Sons, Ltd.