Bidirectional grade gridding resource scheduling method based on QoS restriction

Abstract

The invention relates to a bidirectional stepped grid resource scheduling method based on QoS constraints, which includes: 1. QoS service is offered to all available machines for testing according to QoS request provided by the task and the testing results are recorded in a matrix form, if the request is executable, the execution time is recorded and if the request is non-executable corresponding signs are made; 2. the matrix of the testing results is deformed according to the designated principle and the deformed matrix is accumulated according to the horizontal and vertical directions, thus calculating two vectors; 3. the tasks and the resources are grouped in a non-descending order according to the two vectors; 4. the priority scheduling is conducted according to the task grouping results, wherein, the group with small value has high priority and is firstly scheduled and the interior of the grouping is scheduled according to Min-min algorithm principle; 5. if the task has the same minimum completion time with different resources in the scheduling, the scheduling is conducted according to the resource grouping results and the group with small value has high priority and is firstly scheduled; 6. the fourth step and the fifth step are repeatedly executed until the scheduling of all tasks is completed.

Description

Technical field [0001] The invention belongs to a grid resource scheduling method, in particular to a two-way hierarchical grid resource scheduling method based on QoS constraints. Background technique [0002] Grid computing is to connect geographically distributed and heterogeneous resources to form a high-performance supercomputer, providing users with reliable computing power that is available everywhere. The grid provides a platform for sharing network resources and collaborative problem-solving. Because the grid is built in a heterogeneous environment, the resources on the network are owned by different organizations and have different management methods. Therefore, cross-domain resources in the grid environment Management is extremely challenging. How to map a set of tasks to a set of resources in a grid environment has proven to be an NP-complete problem. The research of grid resource scheduling algorithm is an important subject of grid resource management. At present, ma...

AI Technical Summary

Problems solved by technology

In the grid computing environment, due to the different processing speeds of each processor, it is difficult to design a static scheduling algorithm that is difficult to balance the load, making the static scheduling method difficult to design and implement.

Static scheduling strategies on heterogeneous platforms have encountered many problems: designing the optimal scheduling method has been proven to be an NP-complete problem; it is difficult to accurately evaluate task execution time and communication delay; it cannot cope with the diversity of processor speeds

[0005] Existing grid scheduling methods are all evolved from distributed computing classical algorithms. Although they have good performance in distributed environments, they have limitations for non-centralized managed grid heterogeneous environments: First, There is no good solution to the task completion time minimization problem; secondly, the load balance of heterogeneous machines in the grid environment cannot be guaranteed; moreover, for the grid resource scheduling problem with QoS constraints, the above methods are not very good solution, resulting in unreasonable scheduling

These methods have good performance in solving a specific grid scheduling problem, but the comprehensive performance is not strong, and they are not suitable for the real grid environment.

Images