Resource scheduling system, method and device thereof, electronic equipment and storage medium

Abstract

The invention discloses a resource scheduling system, method and device, electronic equipment and a storage medium, and relates to the technical field of data processing, and the method comprises the steps that a processing module obtains a first scheduling position of a first resource and a second scheduling position of a second resource having a hierarchical relationship with the first resource, establishing a corresponding relation between the first scheduling position and the second scheduling position; the analysis module obtains a preset resource scheduling rule and carries out scheduling analysis on the preset resource scheduling rule based on the corresponding relation to obtain a scheduling analysis result; the preset resource scheduling rule is used for defining a resource scheduling mode; the scheduling module schedules the first resource based on the scheduling analysis result to obtain a scheduling execution result; the corresponding relationship is beneficial to distinguishing the scheduling logic of the resources with different hierarchical relationships and reducing the misrecognition rate of the scheduling position, so that the scheduling accuracy is improved. Therefore, the technical problem of low accuracy of resource scheduling can be solved, and the technical effect of improving the accuracy of resource scheduling is achieved.

Description

Technical Field

[0001] The present application relates to the field of data processing technology, and in particular to a resource scheduling system and its method, device, electronic device and storage medium. Background Art

[0002] In the relevant technologies of resource scheduling, resource scheduling is usually performed by using a resource scheduling system based on the correspondence between pre-set resources and scheduling positions. Due to the complex hierarchical relationship between resources, the resource scheduling system may determine the scheduling position corresponding to the resource that has a hierarchical relationship with the resource to be scheduled as the scheduling position of the resource to be scheduled, resulting in low accuracy of resource scheduling. Summary of the Invention

[0003] The present application provides a resource scheduling system and method, apparatus, electronic device, and storage medium thereof, to at least solve the problem of low accuracy of resource scheduling in related technologies.

[0004] The present application provides a resource scheduling system, comprising: a processing module, a parsing module, and a scheduling module;

[0005] The processing module is connected to the parsing module, and the parsing module is connected to the scheduling module;

[0006] The processing module obtains a first scheduling position of a first resource, obtains a second scheduling position of a second resource that has a hierarchical relationship with the first resource, and establishes a corresponding relationship between the first scheduling position and the second scheduling position;

[0007] The parsing module obtains the preset resource scheduling rules and performs scheduling parsing on the preset resource scheduling rules based on the corresponding relationship to obtain a scheduling parsing result; the preset resource scheduling rules are used to define the resource scheduling method;

[0008] The scheduling module performs scheduling on the first resource based on the scheduling analysis result to obtain a scheduling execution result.

[0009] This application also provides a resource scheduling method, including:

[0010] Obtaining a first scheduling position of a first resource, and obtaining a second scheduling position of a second resource that has a hierarchical relationship with the first resource, and establishing a corresponding relationship between the first scheduling position and the second scheduling position;

[0011] Obtaining preset resource scheduling rules, and performing scheduling analysis on the preset resource scheduling rules based on the corresponding relationship to obtain a scheduling analysis result; the preset resource scheduling rules are used to define the resource scheduling method;

[0012] Based on the scheduling analysis result, scheduling is performed on the first resource to obtain a scheduling execution result.

[0013] The present application also provides a resource scheduling device, comprising:

[0014] an establishing unit, configured to obtain a first scheduling position of a first resource, obtain a second scheduling position of a second resource that has a hierarchical relationship with the first resource, and establish a corresponding relationship between the first scheduling position and the second scheduling position;

[0015] The parsing unit is used to obtain a preset resource scheduling rule and perform scheduling parsing on the preset resource scheduling rule based on the corresponding relationship to obtain a scheduling parsing result; the preset resource scheduling rule is used to define a resource scheduling method;

[0016] The scheduling unit is used to perform scheduling on the first resource based on the scheduling analysis result to obtain a scheduling execution result.

[0017] The present application also provides an electronic device, comprising: a memory for storing a computer program; and a processor for implementing the steps of any of the above-mentioned resource scheduling methods when executing the computer program.

[0018] The present application also provides a computer-readable storage medium, in which a computer program is stored. When the computer program is executed by a processor, the steps of any of the above-mentioned resource scheduling methods are implemented.

[0019] The present application also provides a computer program product, including a computer program, which implements the steps of any of the above-mentioned resource scheduling methods when executed by a processor.

[0020] Through this application, the processing module obtains the first scheduling position of the first resource and the second scheduling position of the second resource that has a hierarchical relationship with the first resource, and establishes a corresponding relationship between the first scheduling position and the second scheduling position; the parsing module obtains the preset resource scheduling rule and, based on the corresponding relationship, performs scheduling parsing on the preset resource scheduling rule to obtain a scheduling parsing result; the preset resource scheduling rule is used to define the resource scheduling method; the scheduling module executes scheduling on the first resource based on the scheduling parsing result to obtain a scheduling execution result; the corresponding relationship helps to distinguish the scheduling logic of resources with different hierarchical relationships, reduce the misidentification rate of the scheduling position, and thus improve the scheduling accuracy. Therefore, the technical problem of low resource scheduling accuracy can be solved, and the technical effect of improving resource scheduling accuracy can be achieved. BRIEF DESCRIPTION OF THE DRAWINGS

[0021] In order to more clearly illustrate the embodiments of the present application, the following is a brief introduction to the drawings required for use in the embodiments. Obviously, the drawings described below are only some embodiments of the present application. For ordinary technicians in this field, other drawings can be obtained based on these drawings without any creative work.

[0022] Figure 1 A schematic diagram of the structure of a resource scheduling system provided in an embodiment of the present application;

[0023] Figure 2 A schematic diagram of a resource scheduling method provided in an embodiment of the present application;

[0024] Figure 3 A diagram showing a bill of materials provided in an embodiment of the present application;

[0025] Figure 4 A diagram showing a feeding rule provided in an embodiment of the present application;

[0026] Figure 5 A diagram showing the feeding results provided in an embodiment of the present application;

[0027] Figure 6 This is another display diagram of the feeding results provided in the embodiment of the present application;

[0028] Figure 7 A schematic flow chart of the entire feeding process provided in an embodiment of the present application;

[0029] Figure 8 A schematic diagram of the structure of a resource scheduling device provided in an embodiment of the present application. DETAILED DESCRIPTION

[0030] The following will be combined with the accompanying drawings in the embodiments of this application to clearly and completely describe the technical solutions in the embodiments of this application. Obviously, the embodiments described are only part of the embodiments of this application, not all of them. Based on the embodiments in this application, all other embodiments obtained by ordinary technicians in this field without making creative efforts are within the scope of protection of this application.

[0031] It should be noted that, in the description of this application, the terms "comprises," "includes," or any other variations thereof are intended to cover non-exclusive inclusion, such that a process, method, article, or device comprising a series of elements includes not only those elements, but also other elements not explicitly listed, or elements inherent to such process, method, article, or device. The terms "first," "second," etc., in this application are used to distinguish similar objects, and are not used to describe a particular order or sequence.

[0032] In order to enable those skilled in the art to better understand the present application, the present application is further described in detail below with reference to the accompanying drawings and specific implementation methods.

[0033] In conjunction with the specific application environment architecture or specific hardware architecture on which the execution of the resource scheduling system depends, the specific application environment architecture or specific hardware architecture is described here.

[0034] The embodiments of the present application provide a resource scheduling system, and a method is described in detail in conjunction with the execution process of the resource scheduling system.

[0035] Figure 1 A schematic diagram of the structure of a resource scheduling system provided in an embodiment of the present application is shown in FIG. Figure 1 As shown, the resource scheduling system includes: a processing module, a parsing module, and a scheduling module;

[0036] The processing module is connected to the parsing module, and the parsing module is connected to the scheduling module.

[0037] The processing module obtains a first scheduling position of a first resource, obtains a second scheduling position of a second resource that has a hierarchical relationship with the first resource, and establishes a corresponding relationship between the first scheduling position and the second scheduling position.

[0038] The processing module, a key component in the resource scheduling system responsible for data collection and relationship building, serves as the system's brain. The processing module possesses powerful data processing capabilities, capable of receiving and processing scheduling location information related to various resources. A primary resource refers to the target resource to be scheduled. Resources refer to hardware devices, computing resources, or other types of schedulable resources, including but not limited to materials, goods, pharmaceuticals, and medical devices. Hierarchical relationships reflect the hierarchical or interdependent relationships between different resources. For example, in the resource scheduling scenario of an enterprise organizational structure, a hierarchical management relationship exists between the department manager account (primary resource) and ordinary employee accounts (secondary resource). The department manager account exercises hierarchical control over employee accounts' access to certain resources. A primary scheduling location refers to the initial or predetermined starting scheduling location of a primary resource within the resource scheduling system. The primary scheduling location identifies the geographical or logical location to which the primary resource can currently be scheduled. For example, in a data center computer room layout, the specific cabinet number and rack location of the primary resource might be used.

[0039] Secondary resources refer to other resource objects that have a hierarchical relationship with primary resources. During resource scheduling, secondary resources may be affected by the scheduling of primary resources, or may constrain and influence the scheduling of primary resources. For example, in software project development resource scheduling, the core development team (primary resource) and the test toolset (secondary resource) required by the core development team (primary resource) have a close hierarchical relationship as the project progresses, and the core development progress may affect the scheduling of the test toolset. The secondary scheduling location corresponds to the location information of the secondary resource in the resource scheduling system, including both physical and logical locations. For example, in a distributed storage system, the backup storage node (secondary resource) that has a hierarchical relationship with the primary storage node (primary resource) for data redundancy backup has its computer room location and address location in the storage network as the secondary scheduling location. A corresponding relationship is the mapping established between the primary and secondary scheduling locations, allowing the system to clearly identify and understand the connections between different resource scheduling locations, providing a basis for subsequent comprehensive resource scheduling decisions based on these connections. This corresponding relationship can be stored and managed using data structures such as dictionaries and lists, where the key can be the primary scheduling location identifier and the corresponding value is the associated secondary scheduling location identifier and related information.

[0040] The processing module of the resource scheduling system first obtains the first scheduling location of a first resource. This can typically be accomplished by reading data stored in the scheduling management system. For example, the first resource may have been assigned to a specific scheduling location, with information about this location stored in a database or memory. The processing module extracts the scheduling location of the first resource from this data and uses it in subsequent scheduling processes. The processing module then needs to obtain a second resource that has a hierarchical relationship with the first resource and its second scheduling location. Specifically, the processing module first identifies the hierarchical level of the first resource. This hierarchical level can be determined by a predefined hierarchical structure. For example, in a resource scheduling system, resources may be divided into multiple levels, such as master resources and slave resources, and the first resource may belong to a specific level. Based on this hierarchical level, the processing module further searches for and identifies a second resource that matches the hierarchical relationship of the first resource. Specifically, the processing module searches for other resources related to the first resource's hierarchy. These resources typically belong to a higher or lower level than the first resource (e.g., system administrator resources or sub-resources). The scheduling location of these resources is the second scheduling location. After obtaining the second scheduling location of the second resource, the processing module records the correspondence between the first scheduling location and the second scheduling location in a storage area. To ensure the accuracy of subsequent scheduling operations, the system stores these location-related data in a storage area, which may be a database table or a memory buffer dedicated to storing resource scheduling information.

[0041] By establishing a scheduling location correspondence between resources based on hierarchical relationships, scheduling errors caused by complex resource hierarchies can be avoided. The scheduling process becomes more precise and conflicts between resources are reduced.

[0042] The parsing module obtains the preset resource scheduling rules, and performs scheduling parsing on the preset resource scheduling rules based on the corresponding relationship to obtain a scheduling parsing result; the preset resource scheduling rules are used to define the resource scheduling method.

[0043] As a key component in the resource scheduling system, the parsing module is primarily responsible for interpreting and analyzing pre-set resource scheduling rules. The parsing module receives pre-set resource scheduling rules and the corresponding relationships established by the processing module. It then applies specific parsing logic to translate the rules into specific scheduling instructions, acting as a "translator" in the system, converting abstract rules into executable scheduling instructions, providing the basis for the scheduling module's precise scheduling.

[0044] Preset resource scheduling rules are a set of specifications and guidelines for resource scheduling, established by system administrators or relevant business personnel based on various factors, such as business needs, resource characteristics, and business priorities. These rules define in detail how resources are scheduled in different scenarios. For example, in cloud computing, when server load is too high, they specify how some virtual machine resources are scheduled from one physical server (the primary resource) to other physical servers in a hierarchical relationship (the secondary resource), along with the order and conditions for scheduling. Alternatively, when power is scarce in a data center, core business servers are prioritized for power supply, with other related servers then being scheduled accordingly.

[0045] Scheduling parsing refers to the process by which the parsing module deeply interprets and analyzes the pre-set resource scheduling rules based on the corresponding relationships established by the processing module. During this process, the parsing module transforms the abstract, general scheduling descriptions in the rules into detailed, actionable scheduling instructions and steps tailored to the current resource situation, combining them with the scheduling location relationships of specific resources. This allows the scheduling rules to be precisely applied to specific resource scheduling scenarios.

[0046] The scheduling analysis result refers to the specific output obtained after the parsing module performs scheduling analysis on the preset resource scheduling rules. It contains detailed scheduling plans and operation steps for the current resources and their corresponding relationships. For example, in a data center resource scheduling scenario, the scheduling analysis result may list in detail the specific information such as the first resource (source server) to which second resource (target server) a specific virtual machine should be migrated, the order of migration, the network bandwidth requirements that need to be met during the migration process, the storage resource allocation requirements, etc., as well as the corresponding scheduling execution conditions and the expected scheduling result description, providing clear guidance and basis for the scheduling module's next actual scheduling operation.

[0047] The parsing module first needs to obtain the preset resource scheduling rules. These rules are typically set by the system administrator or the scheduling algorithm and include a series of rule parameters, such as resource priority, availability period, and inter-resource dependencies. The parsing module retrieves these rule data by querying the system's rule base. Next, the parsing module uses the obtained preset resource scheduling rules and predefined mappings to perform resource scheduling analysis. Specifically, the parsing module determines the priorities and dependencies between different resources and schedules them based on these rules. For example, if a resource has a higher priority, it will be allocated first. If there are dependencies between resources, the parsing module will perform resource scheduling analysis based on the order of dependencies. During this process, the parsing module obtains real-time resource status information, such as whether the resource is idle or available, to determine the scheduling method. Ultimately, the parsing module outputs the scheduling analysis results, including the resource allocation plan, scheduling order, and scheduling strategy. For example, suppose there are two resources A and B in the system. A has a higher priority and must be scheduled before B. When processing the scheduling rules, the parsing module will allocate a scheduling time to resource A first based on this priority, ensuring that B is scheduled only after A is scheduled. If resource A cannot be scheduled within the specified time, the parsing module may automatically adjust the time according to the scheduling rules.

[0048] By pre-establishing preset resource scheduling rules and having the parsing module quickly parse and obtain the scheduling analysis results, the system can quickly start the scheduling process when the scheduling conditions are met, reducing the time cost of manual intervention and temporary decision-making.

[0049] The scheduling module performs scheduling on the first resource based on the scheduling analysis result to obtain a scheduling execution result.

[0050] The scheduling module refers to the core component in the resource scheduling system that is responsible for actually executing scheduling operations. It receives the scheduling analysis results from the parsing module and performs specific scheduling operations on the first resource based on these results. It is equivalent to the "executor" in the system, ensuring that the resource can be moved or adjusted from the current scheduling position to the new target position according to the predetermined scheduling plan to meet business needs and system optimization goals. The scheduling execution result refers to the actual result information generated after the scheduling module completes the scheduling operation on the first resource. It reflects whether the scheduling operation is completed successfully, as well as details such as the new status and new location of the resource after the scheduling is completed. For example, the scheduling execution result may include confirmation information that the virtual machine has been successfully migrated to the target server and is operating normally, as well as comparative data on resource usage before and after migration, etc., providing a basis for subsequent system monitoring, optimization and management.

[0051] In this embodiment, the system's scheduling module first needs to obtain the scheduling analysis results from the scheduling analysis module. The scheduling analysis results include the scheduling policies calculated by the system based on preset scheduling rules and resource requirements. These scheduling policies include information such as the order, priority, and scheduling time of resource scheduling.

[0052] After receiving the scheduling analysis results, the scheduling module first checks the first resource to ensure its availability. Assuming the first resource is a server, the scheduling module needs to confirm whether the server is idle and meets the scheduling conditions, such as whether it meets the priority requirements or has sufficient available time. Once the availability of the first resource is confirmed, the scheduling module will execute the specific scheduling task based on the scheduling analysis results. If the analysis results indicate that the resource needs to be scheduled immediately, the scheduling module will allocate the resource and complete the scheduling task within the specified time. For example, if the scheduling analysis results show that resource A needs to be executed before resource B, the scheduling module will first allocate scheduling time to resource A to ensure priority execution. The scheduling module also monitors the status of the scheduling process. If a resource encounters a problem during the scheduling process (such as failure to allocate on time), the scheduling module will automatically adjust the scheduling strategy, recalculate and output a new scheduling execution result to ensure the effective scheduling of the first resource. For example, suppose the first resource is a high-performance computer, and the scheduling analysis results require the computer to perform certain computing tasks within a specific time period. If the originally scheduled time cannot be executed due to excessive system load, the scheduling module will reallocate the computer's scheduled time based on the current resource status of the system to ensure that the task is not missed due to scheduling conflicts. Finally, the scheduling module generates the scheduling execution results and feeds them back to the system or user, indicating whether the scheduling task is successfully executed, the status of the scheduled resources, whether there are conflicts, etc.

[0053] The scheduling module performs resource scheduling based on the scheduling analysis results, allowing the system to respond to resource needs quickly and efficiently. The scheduling module automates scheduling tasks, reducing manual intervention and improving scheduling efficiency.

[0054] Through this application, the processing module obtains the first scheduling position of the first resource and the second scheduling position of the second resource that has a hierarchical relationship with the first resource, and establishes a corresponding relationship between the first scheduling position and the second scheduling position; the parsing module obtains the preset resource scheduling rule and, based on the corresponding relationship, performs scheduling parsing on the preset resource scheduling rule to obtain a scheduling parsing result; the preset resource scheduling rule is used to define the resource scheduling method; the scheduling module executes scheduling on the first resource based on the scheduling parsing result to obtain a scheduling execution result; the corresponding relationship helps to distinguish the scheduling logic of resources with different hierarchical relationships, reduce the misidentification rate of the scheduling position, and thus improve the scheduling accuracy. Therefore, the technical problem of low resource scheduling accuracy can be solved, and the technical effect of improving resource scheduling accuracy can be achieved.

[0055] In some embodiments, the processing module obtains a first scheduling position of a first resource, obtains a second scheduling position of a second resource that has a hierarchical relationship with the first resource, and establishes a corresponding relationship between the first scheduling position and the second scheduling position, including:

[0056] The processing module obtains a first scheduling position and a first hierarchical level associated with a first resource.

[0057] The first-level grade is used to indicate the level or hierarchy of the first resource in the entire resource hierarchy. In a complex resource management system, different resources often have different hierarchical relationships. For example, in enterprise resource management, the system administrator account (first resource) may be at the highest level, while ordinary employee accounts (second resources) are at a lower level; or in a cloud computing environment, the core computing node (first resource) has a higher level, and its attached storage nodes, network nodes (second resources), etc. have a relatively lower level. The first-level grade reflects the importance, priority, and relative position of the resource with other resources in the entire hierarchical architecture. Resources at different levels can have different scheduling strategies, and first-level resources are usually critical resources that require high-priority scheduling.

[0058] In this embodiment, the processing module first needs to obtain a first scheduling location. The first scheduling location refers to the specific location or scheduling priority of the first resource during the system scheduling process. For example, in a cloud computing resource scheduling system, the first scheduling location may represent the location of a computing node or server, or a position in a resource scheduling queue. Depending on the distribution of resources and scheduling policies in the system, the processing module can obtain this location through a scheduling engine or task scheduling management system. After obtaining this location, the processing module can allocate resources at this location according to scheduling parsing rules. Next, the processing module also needs to obtain a first-level ranking associated with the first resource. The first-level ranking refers to the priority or rank of a resource in scheduling, indicating the urgency and importance of the resource. The processing module determines its scheduling priority based on the characteristics of the first resource, such as computing power, storage capacity, and task requirements. For example, if the first resource is a high-performance computing node, it may be assigned to a high-priority tier (the first tier), while lower-performance computing resources may be assigned to a lower tier. By obtaining this first-level ranking, the processing module can adjust the scheduling order of resources based on their priorities, ensuring that important resources are allocated and scheduled in a timely manner. Through these two steps, the processing module combines the system's scheduling strategy and resource status to develop an appropriate scheduling plan and further optimize resource usage. Ultimately, by obtaining and processing the first scheduling position and the first level of hierarchy, it ensures that resources are scheduled in the optimal order and manner to meet the system's performance and task requirements.

[0059] By obtaining the first scheduling position and the first hierarchical level, the processing module can accurately assign the optimal scheduling position and priority to the resource. This not only improves the efficiency of resource scheduling, but also avoids resource waste or scheduling conflicts, ensuring that tasks can be completed on time.

[0060] The processing module determines resources corresponding to all hierarchical levels that have a hierarchical relationship with the first resource and are greater than the first hierarchical level in the resource set as second resources, and obtains a second scheduling position of the second resource.

[0061] A resource set is the collection of all resources available for scheduling and management within a specific resource management system or business scenario. These resources can be physical devices, such as servers, storage devices, and network equipment, or logical resources, such as virtual machines, database instances, and software licenses. They have their own attributes and functions, and are allocated and used appropriately during resource scheduling based on business needs.

[0062] In this embodiment, the processing module first needs to identify all resources in the current system and their corresponding hierarchical levels. Specifically, the processing module analyzes the hierarchical level of each resource in the task scheduling by obtaining the metadata of the system resources. Assume that the resources in the system are organized hierarchically, the first resource has the highest hierarchical level, and other resources are allocated to different hierarchical levels according to their relative importance. Next, the processing module determines which resources belong to the second resource according to the set rules. Specifically, the processing module determines all resources in the resource set that have a hierarchical relationship with the first resource and have a hierarchical level greater than the first hierarchical level as second resources. These resources can be resources below the first level, or resources that are divided into second resources according to certain specific rules. The processing module finds out the qualified resources by comparing the hierarchical levels and identifies them as second resources. For each resource determined to be a second resource, the processing module will further obtain their second scheduling position.

[0063] By determining resources with a higher hierarchical level than the first hierarchical level as the second resource, it is possible to ensure that the hierarchical relationship and priority of resources are fully considered during the resource scheduling process, making the scheduling operation more consistent with business logic and management requirements.

[0064] The processing module adds the second scheduling position to the storage area of the first scheduling position to obtain a storage area including the first scheduling position and the second scheduling position, so as to establish a corresponding relationship based on the storage area including the first scheduling position and the second scheduling position.

[0065] The storage area for the first scheduling location is a specific data space used to store the scheduling location information of the first resource. This storage area can be a table in a database, a file in a file system, or a data structure in memory. It records the current physical or logical location of the first resource and is an important basis for determining the starting location of the first resource during resource scheduling. For example, in a data center's resource management system, this can be a database table specifically used to store location information such as the computer room, cabinet, and location of each server (first resource).

[0066] The storage area containing the first scheduling location and the second scheduling location refers to the storage area that integrates the first scheduling location and the second scheduling location information after the processing module is operated. The storage area not only contains the scheduling location information of the first resource, but also contains the scheduling location information of the second resource with which it has a hierarchical relationship, forming a comprehensive resource scheduling location information library. The storage area containing the first scheduling location and the second scheduling location provides a complete data foundation for establishing the corresponding relationship between the first resource and the second resource, allowing the system to clearly understand the location relationship between different resources, thereby providing strong support for scientific and reasonable resource scheduling.

[0067] In this embodiment, the processing module first uses the system's scheduling algorithm to identify the initial scheduling location of the current task and resource in the storage area, known as the first scheduling location. This location is typically determined by the task's priority or the resource's urgency. At this point, the processing module has already allocated a specific storage unit in the storage area for the first scheduling location to store the task or resource information. Next, the processing module calculates a second scheduling location based on the current task's requirements or the scheduling policy. This second scheduling location is typically a lower-priority location or is determined based on task dependencies or resource availability. The processing module records this second scheduling location and associates it with the first scheduling location. To ensure smooth task execution, the processing module adds the second scheduling location to the area in the storage area where the first scheduling location resides. Specifically, the processing module inserts the second scheduling location information into the space reserved for the first scheduling location in the storage area. The core goal of this operation is to establish a correspondence between the first and second scheduling locations, ensuring that resources and tasks can flow and execute correctly between the different scheduling locations. For example, in the storage area, the resources in the first scheduling location may be the computing resources of the central processing unit, while the resources in the second scheduling location may be storage resources or network bandwidth. The processing module establishes a corresponding relationship between the second scheduling position and the storage area where the first scheduling position is located, thereby enabling resource scheduling to be efficiently managed according to the priority and demand of the task.

[0068] By adding the information of the second scheduling position to the storage area, the processing module can establish a closer association relationship between different resources, optimize the scheduling order of resources, and reduce resource conflicts.

[0069] In this embodiment, the parsing module obtains the preset resource scheduling rules, and based on the corresponding relationship, performs scheduling parsing on the preset resource scheduling rules, and obtains the scheduling parsing results including: the parsing module obtains the scheduling requirements of the corresponding relationship; the parsing module matches the content in the preset resource scheduling rules that is related to the scheduling requirements to obtain the scheduling parsing results.

[0070] Scheduling requirements for corresponding relationships refer to the specific requirements and expectations for resource scheduling generated based on the corresponding relationships between resources. Scheduling requirements reflect which resources need to be scheduled and the desired scheduling goals to achieve under the current business scenario and resource status. For example, in a data center, when a server (first resource) is overloaded, the resulting scheduling requirement may be to migrate some virtual machines from that server to other servers (second resources) with a hierarchical relationship to balance the load. Relevance refers to the portion of the preset resource scheduling rules that is logically associated with the scheduling requirements for the current corresponding relationship. This content is closely related to the scheduling requirements and can directly guide resource scheduling operations that meet the scheduling requirements. It is the key information that the parsing module filters and extracts from the preset rules, such as the scheduling method for a specific resource type under specific load conditions in the rules. In this embodiment, the parsing module's workflow is as follows: Obtaining Scheduling Requirements: First, the parsing module obtains the scheduling requirements for the corresponding relationship from the system. This requirement typically includes demand information for multiple tasks and resources. The scheduling requirements can be input by the user, automatically generated by the system, or transmitted from other modules. The parsing module uses this information as input for further processing and analysis. Matching scheduling rules: The parsing module will then match the obtained scheduling requirements with the preset resource scheduling rules. The preset resource scheduling rules are usually configured by the administrator when the system is initialized, and contain standards for how to allocate resources based on task requirements and resource conditions. The parsing module will use algorithms or matching models to match the specific content in the scheduling requirements with the corresponding items in the scheduling rules, such as task priority, resource availability, and dependencies between tasks. Generate scheduling parsing results: When the parsing module completes the matching of scheduling requirements and preset resource scheduling rules, it will output the scheduling parsing results. The scheduling parsing results can be a clear scheduling order, resource allocation plan, or scheduling dependencies of tasks. When generating scheduling parsing results, the parsing module will give priority to high-priority tasks according to the matching rules to ensure the reasonable scheduling of tasks and resources.

[0071] By intelligently matching scheduling requirements with preset resource scheduling rules, the parsing module can quickly identify the relationship between tasks and resources, and reasonably allocate resources based on scheduling rules, thereby improving the overall resource scheduling efficiency of the system.

[0072] In this embodiment, as shown in FIG1 , the resource scheduling system further includes: a display module; the display module is connected to the scheduling module; the scheduling module transmits the scheduling execution result to the display module; the display module receives the scheduling execution result and visually displays the scheduling execution result.

[0073] The presentation module is the component in the system responsible for receiving data and presenting it to the user in a visual format. In this embodiment, the presentation module's primary task is to receive the scheduling execution results generated by the scheduling module and convert them into visual presentation content to help users understand and analyze the scheduling results. Visual presentation refers to the process of converting abstract data or information into a form that is easy for users to understand and analyze through graphics, charts, interfaces, or other visual representations. In this embodiment, the purpose of visual presentation is to make scheduling execution results more intuitive, allowing users to quickly grasp the execution status of tasks and key points in the scheduling process.

[0074] Visualizing scheduling execution results makes the system interface more user-friendly and the operation more intuitive, improving the user experience. At the same time, the system's usability is enhanced, allowing users to obtain the required information through graphical means without having to deeply understand complex scheduling algorithms.

[0075] According to the embodiment of the present application, the present application also proposes a resource scheduling method, such as Figure 2 As shown, Figure 2 This is a flow chart of a resource scheduling method provided in an embodiment of the present application. The method is applied to a resource scheduling system, and the method includes the following steps:

[0076] Step 101: obtain a first scheduling position of a first resource, obtain a second scheduling position of a second resource that has a hierarchical relationship with the first resource, and establish a corresponding relationship between the first scheduling position and the second scheduling position.

[0077] Step 102: Obtain a preset resource scheduling rule, and perform scheduling analysis on the preset resource scheduling rule based on the corresponding relationship to obtain a scheduling analysis result; the preset resource scheduling rule is used to define a resource scheduling method.

[0078] Step 103: Based on the scheduling analysis result, schedule the first resource to obtain a scheduling execution result.

[0079] Through this application, the processing module obtains the first scheduling position of the first resource and the second scheduling position of the second resource that has a hierarchical relationship with the first resource, and establishes a corresponding relationship between the first scheduling position and the second scheduling position; the parsing module obtains the preset resource scheduling rule and, based on the corresponding relationship, performs scheduling parsing on the preset resource scheduling rule to obtain a scheduling parsing result; the preset resource scheduling rule is used to define the resource scheduling method; the scheduling module executes scheduling on the first resource based on the scheduling parsing result to obtain a scheduling execution result; the corresponding relationship helps to distinguish the scheduling logic of resources with different hierarchical relationships, reduce the misidentification rate of the scheduling position, and thus improve the scheduling accuracy. Therefore, the technical problem of low resource scheduling accuracy can be solved, and the technical effect of improving resource scheduling accuracy can be achieved.

[0080] As a refinement of step 101, when executing the steps of obtaining the first scheduling position of the first resource, obtaining the second scheduling position of the second resource that has a hierarchical relationship with the first resource, and establishing a corresponding relationship between the first scheduling position and the second scheduling position, it can be implemented in the following ways, but not limited to: obtaining the first scheduling position, and obtaining the first hierarchical level with the first resource; determining the resources corresponding to all hierarchical levels that have a hierarchical relationship with the first resource and are greater than the first hierarchical level as the second resource, and obtaining the second scheduling position of the second resource; adding the second scheduling position to the storage area of the first scheduling position to obtain a storage area containing the first scheduling position and the second scheduling position, so as to establish a corresponding relationship based on the storage area containing the first scheduling position and the second scheduling position.

[0081] As a refinement of step 102, when executing the acquisition of preset resource scheduling rules and performing scheduling analysis on the preset resource scheduling rules based on the corresponding relationship to obtain the scheduling analysis result, it can be implemented in but not limited to the following ways, including: obtaining the scheduling requirements of the corresponding relationship; matching the content in the preset resource scheduling rules that is associated with the scheduling requirements to obtain the scheduling analysis result.

[0082] Since the embodiments of the resource scheduling method and the resource scheduling system correspond to each other, the embodiments of the resource scheduling method can be found in the description of the embodiments of the resource scheduling system, and will not be repeated here. The embodiments of the resource scheduling method have the same beneficial effects as the resource scheduling system mentioned above.

[0083] In order to facilitate a better understanding of resource scheduling, the embodiment of this application takes the material feeding (scheduling) as an example, the bill of materials (BOM) processing module (i.e., processing module): This module is responsible for in-depth analysis and processing of the material BOM. Figure 3 As shown, Figure 3A display diagram of a bill of materials provided in an embodiment of the present application, when feeding (scheduling), the system uses the bottom-level BOM row of the material BOM as the operation object. For the material type materials at the bottom level, first filter out the materials that meet the preference requirements. Then, the system will check the BOM parents of these materials, trace back along the hierarchical relationship until the parent object with the material code EB is found, and obtain the value of the "installation area (mpm6_394_Spare)" of the EB material. Taking into account the complexity of the material BOM structure, a material may have multiple parents. In order to ensure the accuracy and consistency of the information obtained, the system adopts a method of obtaining it layer by layer from the material BOM. After obtaining the installation area value of the EB* material, the value is recorded on the bottom-level child material in a downward transmission manner, so that each material is associated with accurate installation area information, providing a reliable basis for subsequent feeding operations.

[0084] Feeding rule parsing module (i.e. parsing module): This module is used to parse various feeding rules. When the "feeding rule (i.e. preset resource scheduling rule)" contains "quantity ratio" and "reference indicator" information, in order to facilitate a better understanding of the feeding rule, such as Figure 4 As shown, Figure 4 A display diagram of a feeding rule provided in an embodiment of the present application, the system will ignore this information according to actual business needs, and perform material screening and feeding operations only based on the remaining information. For the fuzzy matching operation of the "#" logic, the system can accurately identify the matching conditions according to different input formats. For example, when "YZNC-02954" is entered in the "value" position, the system will recognize that the "value" is required to contain the "YZNC-02954" string, which is equivalent to the effect of entering "YZNC-02954"; when "NYZNC-02954" is entered, the system will recognize that the "value" is required to start with "N", contain the "YZNC-02954" string and is not limited to the ending content. In this way, the system can accurately parse various fuzzy matching conditions, realize the effective processing of diversified feeding rules, and improve the accuracy and flexibility of feeding.

[0085] Result inspection and display module (i.e. display module): After the feeding operation is completed, the result inspection and display module will conduct a comprehensive inspection and display of the feeding results (i.e. scheduling execution results). First, the system will check whether all main processes (scheduling methods) under the current model bill of process (BOP) have material input. The main process is identified by the "Subsidiary Process (MPM6_SecondaryP)" relationship. If there is a value under this relationship, the corresponding process is the main process. The inspection logic requires that at least one "material" under the main process has been associated with this process. If no material is put into a main process, the data of this scenario will be output to the front part of the display result. The "Material" column is empty, the "Process Quantity" column records the number of processes belonging to this situation, and the "Process" column lists the corresponding processes. Multiple processes are separated by ",", and the description content is "No material is fed under the main process."

[0086] Next, the system checks whether any materials in the material BOM (resource set) for this material feed have not been fed to the process. If so, the system outputs the material information, the process quantity (filled with 0), and the corresponding explanation ("No process meets the feeding rules") to the second part of the display results.

[0087] Then, the system will check whether there are materials with the same ID in different processes. If so, the material information, the number of processes to which it belongs, the corresponding processes, and the description ("feeding materials to multiple processes") will be output to the third part of the display result. Finally, the system will continue to output the one-to-one correspondence between materials and processes, and list the one-to-one correspondence between materials and processes in the material BOM of this feeding. In order to facilitate a better understanding of the display of feeding results, such as Figure 5 、 Figure 6 As shown, Figure 5 This is a diagram showing the feeding results provided in the embodiment of the present application. Figure 6Another display diagram of feeding results provided in the embodiment of the present application, the system will store the inspection results in the worksheet (Excel) data set under the "Feeding Result Inspection Record" folder, and the data set naming format is the project number (ItemID)-year-month-day-hour-minute-second of the top-level object of the current material BOM. In the result display interface after feeding, the system has added the "Export Feeding Results to Excel File" and "Export Removal Operation Log" buttons. The "Export Feeding Results to Excel File" button is used to export the feeding results to the local computer, and the naming format is "Export Feeding Results + Year + Month + Day + Hour + Minute + Second"; the "Export Removal Operation Log" button is used to export the removal operation log during the feeding process. The log content includes information such as process, material, parent of the material, and records the version of the corresponding object. The naming format is "Export Removal Operation Log + Year + Month + Day + Hour + Minute + Second". If no removal operation occurs, a prompt will appear after clicking the button: "No removal operation occurred during this feeding process". At the same time, the system has reasonably controlled the button functions of the [Automatic Feeding] interface. The "Minimize" and "Restore" buttons are located in the upper right corner of the interface to control the display status of the operation interface. When the interface is first opened, the [Select Material BOM] and [Close] buttons are enabled, while the [Execute Feed] button is grayed out. After selecting a material BOM, the [Execute Feed] button becomes enabled. After clicking the [Execute Feed] button, the [Select Material BOM], [Execute Feed], and [Close] buttons all become grayed out. After feeding is completed and the inspection results are output, the [Select Material BOM] and [Execute Feed] buttons remain grayed out, while the [Close] button becomes enabled. This button control logic ensures the orderly progress of feeding operations.

[0088] In order to better understand the whole process of feeding, Figure 7 As shown, Figure 7The present invention provides a flow chart of the entire feeding process. The unique material BOM processing algorithm can efficiently and accurately process complex material BOM structures, enabling rapid acquisition and transmission of key information. The innovative feeding rule parsing engine supports a variety of feeding rules, especially accurate processing of fuzzy matching operations. The complete feeding execution management mechanism can effectively handle complex business scenarios such as feeding multiple product BOMs to the same product BOP and material version changes. The comprehensive result inspection and display system provides detailed inspection results and records to facilitate production traceability and management. The reasonable operation interface button control logic ensures the orderly progress of feeding operations. The technical key of the present invention lies in the construction of a complete rule operation system, including the precise operation of each rule table under the BOP, the collaborative work between rule tables, and the flexible application of hard disk solution rule tables. At the same time, during the solution process, the accuracy of the hard disk installation position is ensured through multi-dimensional matching of hard disk properties and backplane disk slot specifications. In terms of customized order processing, customized instruction matching and rule adaptation mechanisms are the core of achieving personalized solution. This application provides an intelligent feeding system and method based on the above-mentioned key technical points, including the specific implementation methods and collaborative workflow of the material BOM processing module, feeding rule parsing module, feeding execution module, and result inspection and display module; technical solutions for processing complex material BOM structures, parsing diverse feeding rules, and managing complex business scenarios; methods for inspecting, displaying, and recording feeding results, as well as the related data formats and storage methods; and the user interface design and button function control logic of the intelligent feeding system. The embodiments of this application are not only applicable to current production feeding scenarios but also to other fields. For example, in the field of logistics and warehousing management, the storage and distribution of goods are similar to the feeding process of materials. Goods can be regarded as materials, the different storage areas of the warehouse as production processes, and the classification and distribution rules of goods as analogous to feeding rules. Through the technical solutions of the present invention, goods can be automatically allocated to appropriate storage areas based on their attributes and storage rules, improving storage space utilization and cargo access efficiency. In the field of medical supplies management, the principles of this invention can also be used for the allocation of drugs and medical devices. Medicines and equipment are considered as materials, and different departments or usage scenarios are considered as processes. They are automatically allocated according to medical needs and allocation rules to ensure the timely supply of medical supplies.

[0089] Through the description of the above implementation methods, those skilled in the art can clearly understand that the method according to the above embodiment can be implemented by means of software plus the necessary general hardware platform, and of course it can also be implemented by hardware, but in many cases the former is a better implementation method.

[0090] The embodiment of the present application also provides a resource scheduling device, Figure 8A schematic diagram of the structure of a resource scheduling device provided in an embodiment of the present application is shown in FIG. Figure 8 As shown, including:

[0091] An establishing unit 21 is configured to obtain a first scheduling position of a first resource, obtain a second scheduling position of a second resource that has a hierarchical relationship with the first resource, and establish a corresponding relationship between the first scheduling position and the second scheduling position;

[0092] The parsing unit 22 is used to obtain a preset resource scheduling rule and perform scheduling parsing on the preset resource scheduling rule based on the corresponding relationship to obtain a scheduling parsing result; the preset resource scheduling rule is used to define a resource scheduling method;

[0093] The scheduling unit 23 is configured to perform scheduling on the first resource based on the scheduling analysis result to obtain a scheduling execution result.

[0094] Through this application, the processing module obtains the first scheduling position of the first resource and the second scheduling position of the second resource that has a hierarchical relationship with the first resource, and establishes a corresponding relationship between the first scheduling position and the second scheduling position; the parsing module obtains the preset resource scheduling rule and, based on the corresponding relationship, performs scheduling parsing on the preset resource scheduling rule to obtain a scheduling parsing result; the preset resource scheduling rule is used to define the resource scheduling method; the scheduling module executes scheduling on the first resource based on the scheduling parsing result to obtain a scheduling execution result; the corresponding relationship helps to distinguish the scheduling logic of resources with different hierarchical relationships, reduce the misidentification rate of the scheduling position, and thus improve the scheduling accuracy. Therefore, the technical problem of low resource scheduling accuracy can be solved, and the technical effect of improving resource scheduling accuracy can be achieved.

[0095] Furthermore, in a possible implementation of this embodiment, the establishing unit 21 is further configured to:

[0096] Obtaining a first scheduling position, and obtaining a first hierarchical level with a first resource;

[0097] Determine resources corresponding to all hierarchical levels that have a hierarchical relationship with the first resource and are greater than the first hierarchical level in the resource set as second resources, and obtain a second scheduling position of the second resource;

[0098] The second scheduling position is added to the storage area of the first scheduling position to obtain a storage area including the first scheduling position and the second scheduling position, so as to establish a corresponding relationship based on the storage area including the first scheduling position and the second scheduling position.

[0099] Furthermore, in a possible implementation of this embodiment, the parsing unit is further configured to:

[0100] Obtain the scheduling requirements of the corresponding relationship;

[0101] Match the content in the preset resource scheduling rules that is related to the scheduling requirements to obtain the scheduling analysis result.

[0102] For the description of the features in the embodiment corresponding to the resource scheduling device, please refer to the relevant description of the embodiment corresponding to the resource scheduling method, and no further details will be given here.

[0103] An embodiment of the present application further provides an electronic device, comprising a memory and a processor, wherein the memory stores a computer program, and the processor is configured to run the computer program to execute the steps in any of the above resource scheduling method embodiments.

[0104] An embodiment of the present application further provides a computer-readable storage medium, in which a computer program is stored. The computer program is configured to execute the steps of any of the above-mentioned resource scheduling method embodiments when running.

[0105] In an exemplary embodiment, the computer-readable storage medium may include, but is not limited to, various media that can store computer programs, such as a USB flash drive, a read-only memory (ROM), a random access memory (RAM), a mobile hard disk, a magnetic disk, or an optical disk.

[0106] An embodiment of the present application further provides a computer program product, which includes a computer program. When the computer program is executed by a processor, the steps in any one of the above-mentioned resource scheduling method embodiments are implemented.

[0107] An embodiment of the present application further provides another computer program product, including a non-volatile computer-readable storage medium, wherein the non-volatile computer-readable storage medium stores a computer program, and when the computer program is executed by a processor, the steps in any of the above-mentioned resource scheduling method embodiments are implemented.

[0108] Professionals may further appreciate that the units and algorithm steps of each example described in conjunction with the embodiments disclosed herein can be implemented in electronic hardware, computer software, or a combination of the two. In order to clearly illustrate the interchangeability of hardware and software, the above description has generally described the components and steps of each example according to their functions. Whether these functions are performed in hardware or software depends on the specific application and design constraints of the technical solution. Professionals and technicians may use different methods to implement the described functions for each specific application, but such implementation should not be considered beyond the scope of this application.

[0109] The above is a detailed introduction to a resource scheduling system and its method, device, electronic device and storage medium provided by the present application. This article uses specific examples to illustrate the principles and implementation methods of the present application. The description of the above embodiments is only used to help understand the method of the present application and its core idea. It should be pointed out that for ordinary technicians in this technical field, without departing from the principles of the present application, several improvements and modifications can be made to the present application, and these improvements and modifications also fall within the scope of protection of the claims of the present application.

Claims

1. A resource scheduling system, characterized in that: include: Processing module, parsing module, scheduling module; The processing module is connected to the parsing module, and the parsing module is connected to the scheduling module; The processing module obtains a first scheduling position of a first resource, obtains a second scheduling position of a second resource that has a hierarchical relationship with the first resource, and establishes a corresponding relationship between the first scheduling position and the second scheduling position; The parsing module obtains a preset resource scheduling rule, and performs scheduling parsing on the preset resource scheduling rule based on the corresponding relationship to obtain a scheduling parsing result; The preset resource scheduling rule is used to define the resource scheduling method; The scheduling module performs scheduling on the first resource based on the scheduling analysis result to obtain a scheduling execution result.

2. The resource scheduling system according to claim 1, characterized in that: The processing module obtains a first scheduling position of a first resource, obtains a second scheduling position of a second resource that has a hierarchical relationship with the first resource, and establishes a corresponding relationship between the first scheduling position and the second scheduling position, including: The processing module obtains the first scheduling position and obtains a first hierarchical level associated with the first resource; The processing module determines, in the resource set, resources corresponding to all hierarchical levels that have a hierarchical relationship with the first resource and are greater than the first hierarchical level as second resources, and obtains the second scheduling position of the second resource; The processing module adds the second scheduling position to the storage area of the first scheduling position to obtain a storage area including the first scheduling position and the second scheduling position, so as to establish the corresponding relationship based on the storage area including the first scheduling position and the second scheduling position.

3. The resource scheduling system according to claim 1, characterized in that: The parsing module obtains the preset resource scheduling rule and performs scheduling parsing on the preset resource scheduling rule based on the corresponding relationship, and obtains a scheduling parsing result including: The parsing module obtains the scheduling requirements of the corresponding relationship; The parsing module matches the content in the preset resource scheduling rules that is associated with the scheduling requirement to obtain the scheduling parsing result.

4. The resource scheduling system according to claim 1, characterized in that: The resource scheduling system further includes: a display module; The display module is connected to the scheduling module; The scheduling module transmits the scheduling execution result to the display module; The display module receives the scheduling execution result and visually displays the scheduling execution result.

5. A resource scheduling method, characterized in that: include: Obtaining a first scheduling position of a first resource, and obtaining a second scheduling position of a second resource that has a hierarchical relationship with the first resource, and establishing a corresponding relationship between the first scheduling position and the second scheduling position; Obtaining a preset resource scheduling rule, and performing scheduling analysis on the preset resource scheduling rule based on the corresponding relationship to obtain a scheduling analysis result; The preset resource scheduling rule is used to define the resource scheduling method; Based on the scheduling analysis result, scheduling is performed on the first resource to obtain a scheduling execution result.

6. The resource scheduling method according to claim 5, characterized in that: The acquiring of a first scheduling position of a first resource, acquiring a second scheduling position of a second resource having a hierarchical relationship with the first resource, and establishing a corresponding relationship between the first scheduling position and the second scheduling position includes: Obtaining the first scheduling position, and obtaining a first hierarchical level with the first resource; Determine resources corresponding to all hierarchical levels that have a hierarchical relationship with the first resource and are greater than the first hierarchical level in the resource set as second resources, and obtain the second scheduling position of the second resource; The second scheduling position is added to the storage area of the first scheduling position to obtain a storage area including the first scheduling position and the second scheduling position, so as to establish the corresponding relationship based on the storage area including the first scheduling position and the second scheduling position.

7. The resource scheduling method according to claim 5, characterized in that: The obtaining of the preset resource scheduling rule and performing scheduling analysis on the preset resource scheduling rule based on the corresponding relationship to obtain a scheduling analysis result includes: Obtaining a scheduling requirement for the corresponding relationship; The content in the preset resource scheduling rule that is associated with the scheduling requirement is matched to obtain the scheduling analysis result.

8. A resource scheduling device, characterized in that: include: an establishing unit, configured to obtain a first scheduling position of a first resource, obtain a second scheduling position of a second resource that has a hierarchical relationship with the first resource, and establish a corresponding relationship between the first scheduling position and the second scheduling position; A parsing unit, configured to obtain a preset resource scheduling rule, and perform scheduling parsing on the preset resource scheduling rule based on the corresponding relationship to obtain a scheduling parsing result; The preset resource scheduling rule is used to define the resource scheduling method; A scheduling unit is used to perform scheduling on the first resource based on the scheduling analysis result to obtain a scheduling execution result.

9. An electronic device, characterized in that: include: memory for storing computer programs; A processor, configured to implement the steps of the resource scheduling method according to any one of claims 5 to 7 when executing the computer program.

10. A computer-readable storage medium, characterized in that The computer-readable storage medium stores a computer program, wherein the computer program, when executed by a processor, implements the steps of the resource scheduling method according to any one of claims 5 to 7.

Images