A large-scale heterogeneous computing resource scheduling system

Abstract

The present invention provides a large-model heterogeneous computing resource scheduling system, which relates to the field of electronic digital data processing, and includes a task decomposition adaptation module, a heterogeneous resource management module, a task scheduling optimization module and a data communication coordination module. The task decomposition adaptation module is used to decompose the tasks of the large model and adapt the corresponding computing resources, the heterogeneous resource management module is used to manage and monitor heterogeneous computing resources, the task scheduling optimization module is used to provide an efficient task scheduling strategy, and the data communication coordination module is used to perform data communication between different resource nodes. The system can adjust the scheduling strategy when a specific type of resource is insufficient, thereby improving the fluency of task operation in the large model.

Description

Technical Field

[0001] The present invention relates to the field of electronic digital data processing, and in particular to a large-model heterogeneous computing resource scheduling system. Background Art

[0002] With the development of artificial intelligence, big data, and high-performance computing, more and more large-scale computing tasks are placing increasing demands on computing resources. This is especially true in scenarios such as deep learning model training, scientific computing, and video rendering. These tasks typically have high computational complexity and diverse resource requirements, requiring full utilization of heterogeneous computing resources for efficient processing. However, traditional resource scheduling systems primarily optimize for a single type of resource and are unable to flexibly allocate resources across multiple types, resulting in low resource utilization and difficulty in fully utilizing computing performance.

[0003] Numerous resource scheduling systems have been developed. After extensive research and reference, we discovered existing resource scheduling systems, such as the one disclosed in Publication No. CN118193175B. These systems generally involve layering heterogeneous tasks with temporal dependencies and calculating deadlines for each layer. They also perform fine-grained calculations of deadlines for each heterogeneous task, estimating the cost and reliability of each resource type used by the task, and then allocating diverse resources to heterogeneous tasks, balancing performance, cost, and reliability. However, these systems allocate resources based on the resource type that the task is suited to. This system fails to optimize resource allocation when resources are insufficient, thus improving the smoothness of task execution. Summary of the Invention

[0004] The purpose of the present invention is to address the existing deficiencies and propose a large-scale heterogeneous computing resource scheduling system.

[0005] The present invention adopts the following technical solutions:

[0006] A large-scale heterogeneous computing resource scheduling system includes a task decomposition and adaptation module, a heterogeneous resource management module, a task scheduling optimization module, and a data communication coordination module;

[0007] The task decomposition and adaptation module is used to decompose the tasks of the large model and adapt the corresponding computing resources. The heterogeneous resource management module is used to manage and monitor heterogeneous computing resources. The task scheduling optimization module is used to provide an efficient task scheduling strategy. The data communication coordination module is used to perform data communication between different resource nodes.

[0008] The task decomposition and allocation module includes a task analysis unit, a task disassembly unit, and a resource adaptation unit. The task analysis unit is used to analyze the demand characteristics of the large model task, the task disassembly unit is used to disassemble the task into subtasks, and the resource adaptation unit is used to match the subtasks with appropriate computing resource types.

[0009] The heterogeneous resource management module includes a resource monitoring unit, a resource registration unit, and a resource scheduling unit. The resource monitoring unit is used to obtain the usage status of computing resources in real time. The resource registration unit is used to register the registration information of resources. The resource scheduling unit is used to send subtasks to corresponding computing resources.

[0010] The task scheduling optimization module includes a basic strategy generation unit, a type optimization adjustment unit, and a historical data analysis unit. The basic strategy generation unit generates a scheduling plan based on the adaptation information of the task. The type optimization adjustment unit is used to convert the adaptation resource type of the subtask to generate a scheduling plan. The historical data analysis unit is used to collect optimization effect information for analysis and processing.

[0011] The data communication coordination module includes a task association management unit, a data identification processing unit and a directional transmission processing unit. The task association management unit is used to register and manage the association between the data generated by the tasks, the data identification processing unit is used to identify the data to be transmitted, and the directional transmission processing unit transmits the data to the corresponding resource node based on the identification information and the association information.

[0012] Furthermore, the basic strategy generation unit includes a policy judgment processor, a node selection processor and a solution output processor. The policy judgment processor is used to judge and select the basic strategy or optimization strategy to process the subtask. The node selection processor selects the resource node that executes the subtask based on the basic strategy. The solution output processor is used to output the scheduling solution to the resource scheduling unit.

[0013] Furthermore, the node selection processor calculates the matching index P of the resource node according to the following formula:

[0014] ;

[0015] in, is the utilization rate of the corresponding type of resources of the resource node, Ve is the number of idle resources of the corresponding type of resources of the resource node, and Vd is the number of resources required by the subtask for the corresponding type;

[0016] The node selection processor selects the resource node with the largest matching index as the execution node of the subtask.

[0017] Furthermore, the type optimization and adjustment unit includes a type conversion evaluation processor, a waiting comparison processor and an adjustment output processor. The type conversion evaluation processor is used to evaluate the execution performance of the subtask after the resource type conversion, the waiting comparison processor is used to compare the efficiency of waiting for the original resource type to be executed and the efficiency after the resource type is converted, and the adjustment output processor is used to output the scheduling plan after the type conversion to the resource scheduling unit.

[0018] Furthermore, the evaluation process of the type conversion evaluation processor includes the following steps:

[0019] S1. Select the resource type after conversion, called the target type;

[0020] S2. Select the resource node with the largest amount of target type resources, called the target node;

[0021] S3. Calculate the performance index Q of the target node according to the following formula:

[0022] ;

[0023] in, To preserve the proportions, is the adaptation coefficient of the subtask to the target type resource, is the idle amount of target type resources in the target node, V0 is the resource base, and e is a natural constant;

[0024] S4. Repeat steps S1 to S3 until the performance index of the target node under all resource types is obtained;

[0025] The waiting comparison processor calculates the comparison judgment value according to the following formula: :

[0026] ;

[0027] Among them, Tw is the time the subtask waits for the adaptation resource node, and Tr is the running time of the subtask under the adaptation resource processing;

[0028] When the comparison judgment value is greater than 0, the target node with the largest performance index is used as the node to execute the subtask, and the corresponding target type resource is used as the resource to process the subtask;

[0029] When the comparison judgment value is not greater than 0, the subtask is returned to the basic strategy generation unit and waits for the emergence of a node that can meet the subtask adaptation resource requirements.

[0030] The beneficial effects achieved by the present invention are:

[0031] This system adapts resources to subtasks. Under normal circumstances, it selects appropriate nodes to execute subtasks based on adapted resources. When adapted resources are insufficient, it analyzes the real-time resource status of each node, adjusts resource types, and makes full use of idle resources to run subtasks, reducing the occurrence of subtask blocking and improving the running smoothness of the entire model task.

[0032] To further understand the features and technical contents of the present invention, please refer to the following detailed description and drawings of the present invention. However, the drawings provided are only for reference and illustration and are not intended to limit the present invention. BRIEF DESCRIPTION OF THE DRAWINGS

[0033] Figure 1 It is a schematic diagram of the overall structural framework of the present invention;

[0034] Figure 2 This is a schematic diagram of the task decomposition and allocation module of the present invention;

[0035] Figure 3 This is a schematic diagram of the heterogeneous resource management module of the present invention;

[0036] Figure 4 This is a schematic diagram of the task scheduling optimization module of the present invention;

[0037] Figure 5 This is a schematic diagram of the data communication coordination module of the present invention;

[0038] Figure 6 This is a comparison chart of the actual test results of the present invention. DETAILED DESCRIPTION

[0039] The following is an explanation of the embodiments of the present invention through specific embodiments. Those skilled in the art can understand the advantages and effects of the present invention from the contents disclosed in this specification. The present invention can be implemented or applied through other different specific embodiments, and the details in this specification can also be modified and changed in various ways based on different viewpoints and applications without departing from the spirit of the present invention. In addition, the drawings of the present invention are only simple schematic illustrations and are not depicted in actual size. It is stated in advance. The following embodiments will further explain the relevant technical content of the present invention in detail, but the disclosed content is not intended to limit the scope of protection of the present invention.

[0040] Example 1: This example provides a large-scale heterogeneous computing resource scheduling system, combined with Figure 1 , including task decomposition and adaptation module, heterogeneous resource management module, task scheduling optimization module and data communication coordination module;

[0041] The task decomposition and adaptation module is used to decompose the tasks of the large model and adapt the corresponding computing resources. The heterogeneous resource management module is used to manage and monitor heterogeneous computing resources. The task scheduling optimization module is used to provide an efficient task scheduling strategy. The data communication coordination module is used to perform data communication between different resource nodes.

[0042] The task decomposition and allocation module includes a task analysis unit, a task disassembly unit, and a resource adaptation unit. The task analysis unit is used to analyze the demand characteristics of the large model task, the task disassembly unit is used to disassemble the task into subtasks, and the resource adaptation unit is used to match the subtasks with appropriate computing resource types.

[0043] The heterogeneous resource management module includes a resource monitoring unit, a resource registration unit, and a resource scheduling unit. The resource monitoring unit is used to obtain the usage status of computing resources in real time. The resource registration unit is used to register the registration information of resources. The resource scheduling unit is used to send subtasks to corresponding computing resources.

[0044] The task scheduling optimization module includes a basic strategy generation unit, a type optimization adjustment unit, and a historical data analysis unit. The basic strategy generation unit generates a scheduling plan based on the adaptation information of the task. The type optimization adjustment unit is used to convert the adaptation resource type of the subtask to generate a scheduling plan. The historical data analysis unit is used to collect optimization effect information for analysis and processing.

[0045] The data communication coordination module includes a task association management unit, a data identification processing unit and a directional transmission processing unit. The task association management unit is used to register and manage the association between the data generated by the tasks, the data identification processing unit is used to identify the data to be transmitted, and the directional transmission processing unit transmits the data to the corresponding resource node based on the identification information and the association information.

[0046] The basic strategy generation unit includes a strategy judgment processor, a node selection processor and a solution output processor. The strategy judgment processor is used to judge and select the basic strategy or the optimization strategy to process the subtask. The node selection processor selects the resource node that executes the subtask based on the basic strategy. The solution output processor is used to output the scheduling solution to the resource scheduling unit.

[0047] The node selection processor calculates the matching index P of the resource node according to the following formula:

[0048] ;

[0049] in, is the utilization rate of the corresponding type of resources of the resource node, Ve is the number of idle resources of the corresponding type of resources of the resource node, and Vd is the number of resources required by the subtask for the corresponding type;

[0050] The node selection processor selects the resource node with the largest matching index as the execution node of the subtask.

[0051] The type optimization and adjustment unit includes a type conversion evaluation processor, a waiting comparison processor and an adjustment output processor. The type conversion evaluation processor is used to evaluate the execution performance of the subtask after the resource type conversion. The waiting comparison processor is used to compare the efficiency of waiting for the original resource type to be executed and the efficiency after the resource type is converted. The adjustment output processor is used to output the scheduling plan after the type conversion to the resource scheduling unit.

[0052] The evaluation process of the type conversion evaluation processor includes the following steps:

[0053] S1. Select the resource type after conversion, called the target type;

[0054] S2. Select the resource node with the largest amount of target type resources, called the target node;

[0055] S3. Calculate the performance index Q of the target node according to the following formula:

[0056] ;

[0057] in, To preserve the proportions, is the adaptation coefficient of the subtask to the target type resource, is the idle amount of target type resources in the target node, V0 is the resource base, and e is a natural constant;

[0058] S4. Repeat steps S1 to S3 until the performance index of the target node under all resource types is obtained;

[0059] The waiting comparison processor calculates the comparison judgment value according to the following formula: :

[0060] ;

[0061] Among them, Tw is the time the subtask waits for the adaptation resource node, and Tr is the running time of the subtask under the adaptation resource processing;

[0062] When the comparison judgment value is greater than 0, the target node with the largest performance index is used as the node to execute the subtask, and the corresponding target type resource is used as the resource to process the subtask;

[0063] When the comparison judgment value is not greater than 0, the subtask is returned to the basic strategy generation unit and waits for the emergence of a node that can meet the subtask adaptation resource requirements.

[0064] Example 2: This example includes all the contents of Example 1 and provides a large-scale heterogeneous computing resource scheduling system, including a task decomposition and adaptation module, a heterogeneous resource management module, a task scheduling optimization module, and a data communication coordination module;

[0065] The task decomposition and adaptation module is used to decompose the tasks of the large model and adapt the corresponding computing resources. The heterogeneous resource management module is used to manage and monitor heterogeneous computing resources. The task scheduling optimization module is used to provide an efficient task scheduling strategy. The data communication coordination module is used to perform data communication between different resource nodes.

[0066] Combine Figure 2 The task decomposition and allocation module includes a task analysis unit, a task disassembly unit and a resource adaptation unit. The task analysis unit is used to analyze the demand characteristics of the large model task, the task disassembly unit is used to disassemble the task into subtasks, and the resource adaptation unit is used to match the subtask with the appropriate computing resource type;

[0067] Combine Figure 3 The heterogeneous resource management module includes a resource monitoring unit, a resource registration unit and a resource scheduling unit. The resource monitoring unit is used to obtain the usage status of computing resources in real time, the resource registration unit is used to register the registration information of resources, and the resource scheduling unit is used to send subtasks to corresponding computing resources;

[0068] Combine Figure 4 The task scheduling optimization module includes a basic strategy generation unit, a type optimization adjustment unit and a historical data analysis unit. The basic strategy generation unit generates a scheduling plan based on the adaptation information of the task. The type optimization adjustment unit is used to convert the adaptation resource type of the subtask to generate a scheduling plan. The historical data analysis unit is used to collect optimization effect information for analysis and processing.

[0069] Combine Figure 5 The data communication coordination module includes a task association management unit, a data identification processing unit and a directional transmission processing unit. The task association management unit is used to register and manage the association between the data generated by the tasks, the data identification processing unit is used to identify the data to be transmitted, and the directional transmission processing unit transmits the data to the corresponding resource node based on the identification information and the association information.

[0070] The task analysis unit includes a description parsing processor, a feature analysis processor, and a condition parsing processor. The description parsing processor is used to parse the description information of the task, the feature analysis processor is used to parse the internal features of the task, and the condition parsing processor is used to parse the dependency conditions of the task.

[0071] The task disassembly unit includes a subtask generation processor, a task encoding processor and a task packaging processor. The subtask generation processor disassembles the task based on the parsing information to obtain the execution data of the subtask. The task encoding processor encodes the subtask based on the dependency relationship. The task packaging processor is used to package the execution data and requirement characteristics of the subtask to obtain a subtask data packet.

[0072] The subtask data packet uses the subtask code as an identification mark. The subtask data packet includes execution data and annotation data. The execution data is used to execute the subtask, and the annotation data is used to describe the relevant information of the subtask.

[0073] The resource adaptation unit includes a data packet management processor, a type matching processor, and a demand assessment processor. The data packet management processor is used to receive and manage subtask data packets. The type matching processor obtains the resource type of the subtask based on annotation information matching. The demand assessment processor is used to assess the demand of the subtask for the corresponding resource type.

[0074] The resource monitoring unit includes a status acquisition processor, a data aggregation processor, and a query interface processor. The status acquisition processor is used to collect the usage status of all types of computing resources in the resource node. The data aggregation processor is used to summarize and store the collected data. The query interface processor is used to provide an interface for querying the computing resource status.

[0075] The resource registration unit includes a resource registration processor, a resource attribute manager and a resource topology manager. The resource registration processor is used to receive and register new nodes and record communication addresses. The resource attribute manager is used to manage the resource type and quantity contained in each resource node. The resource topology manager is used to manage network communication parameters between nodes.

[0076] The resource scheduling unit includes a scheme receiving processor, a data acquisition processor and a directional scheduling processor, wherein the scheme receiving processor is used to receive the scheduling scheme of the subtask, the data acquisition processor is used to obtain the execution data of the subtask, and the directional scheduling processor is used to obtain the communication address of the resource node in the scheduling scheme and send the execution data to the resource node;

[0077] The basic strategy generation unit includes a strategy judgment processor, a node selection processor, and a solution output processor. The strategy judgment processor is used to judge and select the basic strategy or the optimization strategy to process the subtask. The node selection processor selects the resource node for processing the subtask based on the basic strategy. The solution output processor is used to output the scheduling solution to the resource scheduling unit.

[0078] When the type and quantity of idle resources of the resource node meet the requirements of the subtask, the policy judgment processor selects the basic policy, otherwise selects the optimization policy;

[0079] The node selection processor calculates the matching index P of the resource node according to the following formula:

[0080] ;

[0081] in, is the utilization rate of the corresponding type of resources of the resource node, Ve is the number of idle resources of the corresponding type of resources of the resource node, and Vd is the number of resources required by the subtask for the corresponding type;

[0082] The node selection processor selects the resource node with the largest matching index as the execution node of the subtask;

[0083] The type optimization and adjustment unit includes a type conversion evaluation processor, a waiting comparison processor, and an adjustment output processor. The type conversion evaluation processor is used to evaluate the execution performance of the subtask after the resource type conversion. The waiting comparison processor is used to compare the efficiency of waiting for the original resource type to be executed and the efficiency after the resource type is converted. The adjustment output processor is used to output the scheduling plan after the type conversion to the resource scheduling unit.

[0084] The evaluation process of the type conversion evaluation processor includes the following steps:

[0085] S1. Select the resource type after conversion, called the target type;

[0086] S2. Select the resource node with the largest amount of target type resources, called the target node;

[0087] S3. Calculate the performance index Q of the target node according to the following formula:

[0088] ;

[0089] in, To preserve the proportions, is the adaptation coefficient of the subtask to the target type resource, is the idle amount of target type resources in the target node, V0 is the resource base, and e is a natural constant;

[0090] S4. Repeat steps S1 to S3 until the performance index of the target node under all resource types is obtained;

[0091] The waiting comparison processor calculates the comparison judgment value according to the following formula: :

[0092] ;

[0093] Among them, Tw is the time the subtask waits for the adaptation resource node, and Tr is the running time of the subtask under the adaptation resource processing;

[0094] When the comparison judgment value is greater than 0, the target node with the largest performance index is used as the node to execute the subtask, and the corresponding target type resource is used as the resource to process the subtask;

[0095] When the comparison judgment value is not greater than 0, the subtask is returned to the basic strategy generation unit and waits for the emergence of a node that can meet the subtask adaptation resources;

[0096] The historical data analysis unit continuously adjusts the adaptation coefficient by obtaining the actual case data of the subtasks running the adaptation resources. Make corrections;

[0097] The task association management unit includes a running task register, an association relationship register, and an information editing processor. The running task register is used to store the codes of the subtasks being run, the association relationship register is used to store the data relationships between the subtasks being run, and the information editing processor is used to receive the status change information of the subtasks and modify and edit the stored data.

[0098] Part of the code of this system is described below:

[0099] class TaskDecompositionModule:

[0100] """Task decomposition adaptation module"""

[0101] def __init__(self):

[0102] pass

[0103] class TaskAnalyzer:

[0104] """Task Analysis Unit: Analyze the characteristics of large model task requirements"""

[0105] @staticmethod

[0106] def analyze(task):

[0107] print(f"Analyzing task: {task}")

[0108] #Simulate return task requirements

[0109] return {"type": "compute", "resources": ["CPU", "GPU"]}

[0110] class TaskSplitter:

[0111] """Task decomposition unit: decompose tasks to generate subtasks"""

[0112] @staticmethod

[0113] def split(task):

[0114] print(f"Splitting task: {task}")

[0115] #Simulate the return of subtask list

[0116] return [{"subtask_id": 1}, {"subtask_id": 2}]

[0117] class ResourceMatcher:

[0118] """Resource adaptation unit: matching appropriate computing resources"""

[0119] @staticmethod

[0120] def match(subtask):

[0121] print(f"Matching resources for subtask: {subtask}")

[0122] #Simulate returning matching resources

[0123] return {"resource": "GPU"}

[0124] class HeterogeneousResourceManager:

[0125] """Heterogeneous resource management module"""

[0126] def __init__(self):

[0127] self.resources = {}

[0128] class ResourceMonitor:

[0129] """Resource monitoring unit: obtain resource status in real time"""

[0130] @staticmethod

[0131] def monitor():

[0132] print("Monitoring resources...")

[0133] # Simulate resource status

[0134] return {"CPU": "busy", "GPU": "idle"}

[0135] class ResourceRegistrar:

[0136] """Resource registration unit: register resource registration information"""

[0137] @staticmethod

[0138] def register(resource):

[0139] print(f"Registering resource: {resource}")

[0140] class ResourceScheduler:

[0141] """Resource scheduling unit: allocates subtasks to computing resources"""

[0142] @staticmethod

[0143] def schedule(subtask, resource):

[0144] print(f"Scheduling subtask {subtask} to resource{resource}")

[0145] class TaskOptimizationModule:

[0146] """Task scheduling optimization module"""

[0147] def __init__(self):

[0148] pass

[0149] class BaseStrategyGenerator:

[0150] """Basic strategy generation unit: Generates the initial scheduling plan"""

[0151] @staticmethod

[0152] def generate(task_info):

[0153] print(f"Generating base strategy for: {task_info}")

[0154] #Simulate the return schedule

[0155] return {"strategy": "basic"}

[0156] class TypeOptimizer:

[0157] """Type optimization and adjustment unit: convert resource adaptation type"""

[0158] @staticmethod

[0159] def optimize(strategy):

[0160] print(f"Optimizing strategy: {strategy}")

[0161] # Simulation Optimization

[0162] return {"strategy": "optimized"}

[0163] class HistoricalAnalyzer:

[0164] """Historical data analysis unit: collect optimization results and analyze them"""

[0165] @staticmethod

[0166] def analyze():

[0167] print("Analyzing historical data...")

[0168] def transmit(data, resource).

[0169] We now test 10 large model tasks as samples, and test the processing time in this system and the ordinary system respectively, and get Figure 6 The effect comparison chart is shown.

[0170] The contents disclosed above are only preferred feasible embodiments of the present invention and do not limit the scope of protection of the present invention. Therefore, all equivalent technical changes made using the contents of the present invention description and drawings are included in the scope of protection of the present invention. In addition, the elements therein can be updated as technology develops.

Claims

1. A large-scale heterogeneous computing resource scheduling system, characterized in that: It includes task decomposition and adaptation module, heterogeneous resource management module, task scheduling optimization module and data communication coordination module; The task decomposition and adaptation module is used to decompose the tasks of the large model and adapt the corresponding computing resources, the heterogeneous resource management module is used to manage and monitor heterogeneous computing resources, the task scheduling optimization module is used to provide an efficient task scheduling strategy, and the data communication coordination module is used to perform data communication between different resource nodes; The task decomposition and adaptation module includes a task analysis unit, a task disassembly unit and a resource adaptation unit. The task analysis unit is used to analyze the demand characteristics of the large model task, the task disassembly unit is used to disassemble the task into subtasks, and the resource adaptation unit is used to match the subtask with a suitable computing resource type. The heterogeneous resource management module includes a resource monitoring unit, a resource registration unit and a resource scheduling unit, wherein the resource monitoring unit is used to obtain the usage status of computing resources in real time, the resource registration unit is used to register the registration information of resources, and the resource scheduling unit is used to send subtasks to corresponding computing resources; The task scheduling optimization module includes a basic strategy generation unit, a type optimization adjustment unit and a historical data analysis unit. The basic strategy generation unit generates a scheduling plan based on the adaptation information of the task. The type optimization adjustment unit is used to convert the adaptation resource type of the subtask to generate a scheduling plan. The historical data analysis unit is used to collect optimization effect information for analysis and processing; The data communication coordination module includes a task association management unit, a data identification processing unit and a directional transmission processing unit. The task association management unit is used to register and manage the association between the data generated by the task, the data identification processing unit is used to identify the data to be transmitted, and the directional transmission processing unit transmits the data to the corresponding resource node based on the identification information and the association information; The basic strategy generation unit includes a strategy judgment processor, a node selection processor and a solution output processor, wherein the strategy judgment processor is used to judge and select a basic strategy or an optimization strategy to process a subtask, the node selection processor selects a resource node for processing a subtask based on the basic strategy, and the solution output processor is used to output a scheduling solution to the resource scheduling unit; The node selection processor calculates the matching index P of the resource node according to the following formula: ； in, is the utilization rate of the corresponding type of resources of the resource node, Ve is the number of idle resources of the corresponding type of resources of the resource node, and Vd is the number of resources required by the subtask for the corresponding type; The node selection processor selects a resource node with a maximum matching index as an execution node of the subtask.

2. A large-model heterogeneous computing resource scheduling system as claimed in claim 1, characterized in that: The type optimization and adjustment unit includes a type conversion evaluation processor, a waiting comparison processor and an adjustment output processor. The type conversion evaluation processor is used to evaluate the execution performance of the subtask after the resource type conversion, the waiting comparison processor is used to compare the efficiency of waiting for the original resource type to be executed and the efficiency after the resource type is converted, and the adjustment output processor is used to output the scheduling plan after the type conversion to the resource scheduling unit.

3. A large-model heterogeneous computing resource scheduling system as claimed in claim 2, characterized in that: The evaluation process of the type conversion evaluation processor includes the following steps: S1, select the resource type after conversion, called the target type; S2, select the resource node with the largest amount of target type resources, called the target node; S3. Calculate the performance index Q of the target node according to the following formula: ； in, To preserve the proportion, is the adaptation coefficient of the subtask to the target type resource, is the idle amount of target type resources in the target node, V0 is the resource base, and e is a natural constant; S4, repeating steps S1 to S3 until the performance index of the target node under all resource types is obtained; The waiting comparison processor calculates the comparison judgment value according to the following formula: : ； Among them, Tw is the time that the subtask waits for the adaptation resource node, and Tr is the running time of the subtask under the adaptation resource processing; When the comparison judgment value is greater than 0, the target node with the largest performance index is used as the node for executing the subtask, and the corresponding target type resource is used as the resource for processing the subtask; When the comparison judgment value is not greater than 0, the subtask is returned to the basic strategy generation unit and waits for the emergence of a node that can meet the adaptation resources of the subtask.

Images