CN111694649B - Resource scheduling method, device, computer equipment and storage medium - Google Patents

Resource scheduling method, device, computer equipment and storage medium Download PDF

Info

Publication number
CN111694649B
CN111694649B CN202010538340.5A CN202010538340A CN111694649B CN 111694649 B CN111694649 B CN 111694649B CN 202010538340 A CN202010538340 A CN 202010538340A CN 111694649 B CN111694649 B CN 111694649B
Authority
CN
China
Prior art keywords
resource
type
node
range
target
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN202010538340.5A
Other languages
Chinese (zh)
Other versions
CN111694649A (en
Inventor
钱瀚
辛朝晖
姜亦朋
郑建磊
李亚坤
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Beijing Volcano Engine Technology Co Ltd
Original Assignee
Beijing Volcano Engine Technology Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Beijing Volcano Engine Technology Co Ltd filed Critical Beijing Volcano Engine Technology Co Ltd
Priority to CN202010538340.5A priority Critical patent/CN111694649B/en
Publication of CN111694649A publication Critical patent/CN111694649A/en
Application granted granted Critical
Publication of CN111694649B publication Critical patent/CN111694649B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00Arrangements for program control, e.g. control units
    • G06F9/06Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/46Multiprogramming arrangements
    • G06F9/48Program initiating; Program switching, e.g. by interrupt
    • G06F9/4806Task transfer initiation or dispatching
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00Arrangements for program control, e.g. control units
    • G06F9/06Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/46Multiprogramming arrangements
    • G06F9/50Allocation of resources, e.g. of the central processing unit [CPU]
    • G06F9/5005Allocation of resources, e.g. of the central processing unit [CPU] to service a request
    • G06F9/5011Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resources being hardware resources other than CPUs, Servers and Terminals
    • G06F9/5022Mechanisms to release resources
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00Arrangements for program control, e.g. control units
    • G06F9/06Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/46Multiprogramming arrangements
    • G06F9/50Allocation of resources, e.g. of the central processing unit [CPU]
    • G06F9/5061Partitioning or combining of resources
    • YGENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02DCLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
    • Y02D10/00Energy efficient computing, e.g. low power processors, power management or thermal management

Landscapes

  • Engineering & Computer Science (AREA)
  • Software Systems (AREA)
  • Theoretical Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

The present disclosure provides a resource scheduling method, apparatus, computer device, and storage medium, the method comprising: receiving a resource scheduling request sent by a client; the resource scheduling request comprises at least one resource type and corresponding resource quantity required by executing a target task; receiving the allocable resource information reported by each resource node in a plurality of resource nodes in a resource management system; determining at least one target resource node from a plurality of the resource nodes based on the resource type and the resource amount in the resource scheduling request and the allocable resource information of the plurality of the resource nodes; and sending the node identification of the searched target resource node, the matched resource type and the resource amount to an application manager corresponding to the client.

Description

Resource scheduling method, device, computer equipment and storage medium
Technical Field
The disclosure relates to the technical field of communication processing, and in particular relates to a resource scheduling method, a resource scheduling device, computer equipment and a storage medium.
Background
The introduction of resource management and task scheduling frameworks for scheduling resources and tasks is often required in a distributed system infrastructure (Hadoop), wherein another resource coordinator (Yet Another Resource Negotiator, yacn) is a common resource management system on the Hadoop system, and is used for implementing unified management and scheduling of cluster resources. In an application scenario, there are resource types described in scope in addition to the resource types described in number. In the prior art, a resource scheduling scheme based on YARN has not been provided for a scheduling scheme of resource types described in scope, namely when a user needs a resource of a scope type, a resource manager cannot allocate a certain scope of the resource for the user, and only a certain amount of the resource can be allocated for the user.
Disclosure of Invention
The embodiment of the disclosure at least provides a resource scheduling method, a device, computer equipment and a storage medium, so as to solve the problem that resources of a range type cannot be allocated to an application.
In a first aspect, an embodiment of the present application provides a resource scheduling method, where the method includes:
receiving a resource scheduling request sent by a client; the resource scheduling request comprises at least one resource type and corresponding resource quantity required by executing a target task; the resource type comprises at least one range type resource, and the resource quantity corresponding to the range type resource is a range type resource quantity; the range type resource quantity comprises an identification number range corresponding to the range type resource;
receiving the allocable resource information reported by each resource node in a plurality of resource nodes in a resource management system;
determining at least one target resource node from a plurality of the resource nodes based on the resource type and the amount of resources in the resource scheduling request and the allocable resource information of the plurality of the resource nodes; each target resource node has an allocable resource matched with the resource type and the resource quantity in the resource scheduling request;
And sending the node identification of the searched target resource node, the matched resource type and the resource amount to an application manager corresponding to the client.
In one embodiment, determining at least one target resource node from a plurality of the resource nodes based on the resource type and the amount of resources in the resource scheduling request and the allocable resource information of the plurality of the resource nodes, comprises:
determining a current resource node;
judging whether the allocable resources of the current resource node comprise allocable range type resources matched with the range type resources in the resource scheduling request;
if so, judging whether the identification number range of the indication of the resource quantity of the allocable range type corresponding to the allocable range type resource in the allocable resource is larger than or equal to the identification number range of the indication of the resource quantity of the range type resource in the resource scheduling request;
and if the current resource node is greater than or equal to the target resource node, taking the current resource node as a target resource node for providing the resource of the resource type.
In one embodiment, the method further comprises:
if the identification number range indicated by the resource quantity of the allocable range type corresponding to the allocable range type resource in the allocable resource is smaller than the identification number range indicated by the resource quantity of the range type resource in the resource scheduling request, determining the next resource node as the current resource node;
And returning to the step of judging whether the allocable resources of the current resource node comprise allocable range type resources matched with the range type resources in the resource scheduling request until the target resource node meeting the condition is determined or until all the resource nodes are determined not to meet the condition, and determining that the resources of the resource type cannot be allocated.
In one embodiment, after sending the node identifier of the searched target resource node, the matched resource type and the resource amount to the application manager corresponding to the client, the method further includes:
and after determining that the scope type resource matched with the resource type and the resource quantity in the resource scheduling request is released, changing the use state of the scope type resource matched with the resource type and the resource quantity in the resource scheduling request into an idle state.
In a second aspect, an embodiment of the present application provides a resource scheduling method, including:
generating a task execution request for a target task, wherein the task execution request comprises at least one resource type and corresponding resource quantity required for executing the target task; the resource type comprises at least one range type resource, and the resource quantity corresponding to the range type resource is a range type resource quantity; the range type resource quantity comprises an identification number range corresponding to the range type resource;
And sending the task execution request to a resource management system so that the resource management system determines at least one target resource node from a plurality of resource nodes managed by the resource management system based on the task execution request, and executing the target task based on the allocable resources which are managed by each target resource node and are matched with the resource types and the corresponding resource amounts.
In a third aspect, an embodiment of the present application provides a resource scheduling method, where the method includes:
the application manager sends a resource scheduling request for a target task to a resource manager; the resource scheduling request carries at least one resource type and corresponding resource quantity required by executing the target task; the resource type comprises at least one range type resource, and the resource quantity corresponding to the range type resource is a range type resource quantity; the range type resource quantity comprises an identification number range corresponding to the range type resource;
receiving node identification of at least one target resource node sent by the resource manager, and matched resource types and resource amounts; wherein, in the resources managed by each target resource node, there are allocable resources matching the resource type and the resource amount in the resource scheduling request;
Sending a resource use request to the target resource node; the resource use request carries a task processing instruction associated with a target task, and a resource type and a corresponding resource amount required by responding to the task processing instruction.
In a fourth aspect, an embodiment of the present application provides a resource scheduling method, where the method includes:
the resource node receives a resource use request aiming at a target task, which is sent by an application manager; the resource use request carries a task processing instruction associated with a target task, and a resource type and a corresponding resource amount required by responding to the task processing instruction; the resource type comprises at least one range type resource, and the resource quantity corresponding to the range type resource is a range type resource quantity; the range type resource quantity comprises an identification number range corresponding to the range type resource;
searching the unoccupied allocable resources which are matched with the resource types and the resource amounts in the resource scheduling request from the self-managed resources based on the resource types and the resource amounts in the resource scheduling request;
responding to the task processing instruction based on the searched allocable resources.
In one embodiment, after responding to the task processing instruction based on the found allocable resource, the method further comprises:
receiving a resource release request sent by the application manager; the resource release request carries the resource type of the resource to be released and the corresponding resource quantity; wherein the resource amount of the resource to be released comprises a resource amount of a range type to be released;
and changing the use state of the corresponding resources to be released from the occupied state to the idle state based on the resource type and the corresponding resource amount carried in the resource release request.
In a fifth aspect, an embodiment of the present application provides a resource scheduling apparatus, where the apparatus includes:
the first receiving module is used for receiving a resource scheduling request sent by the client; the resource scheduling request comprises at least one resource type and corresponding resource quantity required by executing a target task; the resource type comprises at least one range type resource, and the resource quantity corresponding to the range type resource is a range type resource quantity; the range type resource quantity comprises an identification number range corresponding to the range type resource;
the second receiving module is used for receiving the allocable resource information reported by each resource node in a plurality of resource nodes in the resource management system;
A processing module configured to determine at least one target resource node from a plurality of the resource nodes based on the resource type and the resource amount in the resource scheduling request and the allocable resource information of the plurality of the resource nodes; each target resource node has an allocable resource matched with the resource type and the resource quantity in the resource scheduling request;
and the sending module is used for sending the node identification, the matched resource type and the resource quantity of the searched target resource node to an application manager corresponding to the client.
In a sixth aspect, an embodiment of the present application provides a resource scheduling apparatus, including:
the system comprises a generation module, a processing module and a processing module, wherein the generation module is used for generating a task execution request aiming at a target task, and the task execution request comprises at least one resource type and corresponding resource quantity required by executing the target task; the resource type comprises at least one range type resource, and the resource quantity corresponding to the range type resource is a range type resource quantity; the range type resource quantity comprises an identification number range corresponding to the range type resource;
and the sending module is used for sending the task execution request to a resource management system so that the resource management system can determine at least one target resource node from a plurality of resource nodes managed by the resource management system based on the task execution request, and execute the target task based on the allocable resource which is managed by each target resource node and is matched with the resource type and the corresponding resource quantity.
In a seventh aspect, an embodiment of the present application provides a resource scheduling apparatus, including:
the sending module is used for sending a resource scheduling request aiming at a target task to the resource manager; the resource scheduling request carries at least one resource type and corresponding resource quantity required by executing the target task; the resource type comprises at least one range type resource, and the resource quantity corresponding to the range type resource is a range type resource quantity; the range type resource quantity comprises an identification number range corresponding to the range type resource; and sending a resource usage request to the target resource node; the resource use request carries a task processing instruction associated with a target task, and a resource type and a corresponding resource amount required by responding to the task processing instruction;
a receiving module, configured to receive a node identifier of at least one target resource node sent by the resource manager, and the matched resource type and resource amount; wherein, in the resources managed by each target resource node, there are allocable resources matching the resource type and the resource amount in the resource scheduling request.
In an eighth aspect, an embodiment of the present application provides a resource scheduling apparatus, where the apparatus is applied to a resource node, and the apparatus includes:
The receiving module is used for receiving a resource use request aiming at a target task and sent by the application manager; the resource use request carries a task processing instruction associated with a target task, and a resource type and a corresponding resource amount required by responding to the task processing instruction; the resource type comprises at least one range type resource, and the resource quantity corresponding to the range type resource is a range type resource quantity; the range type resource quantity comprises an identification number range corresponding to the range type resource;
the searching module is used for searching the unoccupied allocable resources which are matched with the resource types and the resource amounts in the resource scheduling request from the self-managed resources based on the resource types and the resource amounts in the resource scheduling request;
and the processing module is used for responding to the task processing instruction based on the searched allocable resources.
In a ninth aspect, embodiments of the present disclosure provide a computer device comprising: a processor, a storage medium and a bus, the storage medium storing machine-readable instructions executable by the processor, the processor and the storage medium communicating over the bus when the computer device is running, the processor executing the machine-readable instructions to perform the steps of any of the methods of the first aspect, or to perform the steps of the method of the second aspect, or to perform the steps of the method of any of the third aspect, or to perform the steps of the method of any of the fourth aspect.
In a tenth aspect, embodiments of the present disclosure provide a computer readable storage medium, wherein the computer readable storage medium has stored thereon a computer program which, when executed by a processor, performs the steps of the method according to any of the first aspect, or performs the steps of the method according to the second aspect, or performs the steps of the method according to any of the third aspect, or performs the steps of the method according to any of the fourth aspect.
The embodiment of the disclosure provides a resource scheduling method, the related resource type comprises at least one scope type resource, the resource quantity corresponding to the scope type resource is scope type resource quantity, the scope type resource quantity comprises an identification number scope corresponding to the scope type resource, a resource scheduling request sent by a client is received, the resource scheduling request comprises at least one resource type and corresponding resource quantity required by executing a target task, the resource information reported by each resource node in a plurality of resource nodes in a resource management system is received, based on the resource type and resource quantity in the resource scheduling request and the resource information of the plurality of resource nodes, at least one target resource node is determined from the plurality of resource nodes, the node identification of the searched target resource node, the matched resource type and resource quantity are sent to an application manager corresponding to the client, so that the scope type resource with the identification number scope meeting the scheduling requirement is allocated for the target task, and the complex scheduling requirement for the scope type resource in the task execution process can be met.
The foregoing objects, features and advantages of the disclosure will be more readily apparent from the following detailed description of the preferred embodiments taken in conjunction with the accompanying drawings.
Drawings
In order to more clearly illustrate the technical solutions of the embodiments of the present disclosure, the drawings required for the embodiments are briefly described below, which are incorporated in and constitute a part of the specification, these drawings showing embodiments consistent with the present disclosure and together with the description serve to illustrate the technical solutions of the present disclosure. It is to be understood that the following drawings illustrate only certain embodiments of the present disclosure and are therefore not to be considered limiting of its scope, for the person of ordinary skill in the art may admit to other equally relevant drawings without inventive effort.
Fig. 1 is a schematic flow chart of a first method for scheduling resources according to an embodiment of the disclosure;
FIG. 2 is a second flow chart of a resource scheduling method according to an embodiment of the disclosure;
fig. 3 is a schematic diagram of a third flow chart of a resource scheduling method according to an embodiment of the disclosure;
Fig. 4 is a schematic flow chart of a fourth method for scheduling resources according to an embodiment of the disclosure;
fig. 5 is a schematic diagram of a fifth flow chart of a resource scheduling method according to an embodiment of the disclosure;
fig. 6 is a schematic diagram of a first structure of a resource scheduling device according to an embodiment of the disclosure;
fig. 7 is a schematic diagram of a second structure of a resource scheduling device according to an embodiment of the disclosure;
fig. 8 is a schematic diagram illustrating a third configuration of a resource scheduling apparatus according to an embodiment of the present disclosure;
fig. 9 is a schematic diagram of a fourth configuration of a resource scheduling device according to an embodiment of the disclosure;
FIG. 10 illustrates a first schematic diagram of a computer device provided by an embodiment of the present disclosure;
FIG. 11 illustrates a second schematic diagram of a computer device provided by an embodiment of the present disclosure;
FIG. 12 illustrates a third schematic diagram of a computer device provided by an embodiment of the present disclosure;
fig. 13 shows a fourth schematic diagram of a computer device provided by an embodiment of the disclosure.
Detailed Description
For the purposes of making the objects, technical solutions and advantages of the embodiments of the present disclosure more apparent, the technical solutions in the embodiments of the present disclosure will be clearly and completely described below with reference to the drawings in the embodiments of the present disclosure, and it is apparent that the described embodiments are only some embodiments of the present disclosure, but not all embodiments. The components of the embodiments of the present disclosure, which are generally described and illustrated in the figures herein, may be arranged and designed in a wide variety of different configurations. Thus, the following detailed description of the embodiments of the present disclosure provided in the accompanying drawings is not intended to limit the scope of the disclosure, as claimed, but is merely representative of selected embodiments of the disclosure. All other embodiments, which can be made by those skilled in the art based on the embodiments of this disclosure without making any inventive effort, are intended to be within the scope of this disclosure.
The user side submits a job task of the application program, such as a distributed computing (Map reduce) program, to the resource manager, and the resource manager creates an application manager (Application Master, AM) for the application, where the application manager is configured to manage the application program, including applying for resources, releasing resources, scheduling resources, and the like for the application in the cluster.
The application manager sends a resource scheduling request for the application to the resource manager, wherein the resource scheduling request generally comprises a resource amount (such as 100G memory) for the job task, and after the resource manager allocates the resource applied in the resource scheduling request to the application manager, the application manager communicates with a corresponding resource node to start the corresponding task. In the above process, when a range type resource is needed in the task execution process, for example, a port, a display card or a network card, etc., the resource manager can only allocate a certain number of ports, display cards or network cards for the application manager, and the ports, display cards or network cards allocated for the application manager may not be able to be used by the task, and after the ports, display cards or network cards are allocated to the task, other task tasks or applications cannot use the display cards, ports or network cards, so that the utilization rate of resources is also reduced.
Based on the above-mentioned research, the embodiments of the present disclosure provide a resource scheduling method, where a related resource type includes at least one scope type resource, a resource amount corresponding to the scope type resource is a scope type resource amount, the scope type resource amount includes an identification number scope corresponding to the scope type resource, a resource scheduling request sent by a client is received, the resource scheduling request includes at least one resource type and a corresponding resource amount required for executing a target task, allocable resource information reported by each of a plurality of resource nodes in a resource management system is received, and at least one target resource node is determined from a plurality of the resource nodes based on the resource type and the resource amount in the resource scheduling request and the allocable resource information of the plurality of the resource nodes; and sending the node identification of the searched target resource node, the matched resource type and the resource amount to an application manager corresponding to the client. Therefore, the scope type resources with the identification number scope meeting the scheduling requirement are allocated to the target task, and the complex scheduling requirement aiming at the scope type resources in the task execution process can be met.
It should be noted that the discovery process of the above-mentioned problems and the solutions proposed by the present disclosure below for the above-mentioned problems should be all contributions to the present disclosure by the inventors.
It should be noted that: like reference numerals and letters denote like items in the following figures, and thus once an item is defined in one figure, no further definition or explanation thereof is necessary in the following figures.
For the sake of understanding the present embodiment, first, a detailed description will be given of a resource scheduling method disclosed in an embodiment of the present disclosure, where an execution body of the resource scheduling method provided in the embodiment of the present disclosure is generally a computer device with a certain computing capability, where the computer device includes, for example: the terminal device, or server or other processing device, may be a User Equipment (UE), mobile device, cellular phone, cordless phone, personal digital assistant (Personal Digital Assistant, PDA), handheld device, computing device, vehicle mounted device, wearable device, etc. In some possible implementations, the resource scheduling method may be implemented by way of a processor invoking computer readable instructions stored in a memory.
The following describes a method for monitoring a resource scheduling method according to an embodiment of the present disclosure, taking an execution body as a resource manager as an example.
Referring to fig. 1, a flowchart of a resource scheduling method according to an embodiment of the present disclosure is shown, where the resource scheduling method is applied to a resource manager, where the resource manager manages a plurality of resource nodes, and each resource node manages at least one range type resource and a corresponding resource amount; the method can comprise the following steps:
s101, a resource manager receives a resource scheduling request sent by a client; the resource scheduling request comprises at least one resource type and corresponding resource quantity required by executing a target task; the resource type comprises at least one range type resource, and the resource quantity corresponding to the range type resource is a range type resource quantity; the scope type resource amount includes a scope of identification numbers for the corresponding scope type resource.
Here, the target task may be a computing task, a processing task, or the like in the distributed computing application; the format of the resource scheduling request can be determined according to the actual application scene; the scope type resource may include resources such as a port, a display card, and a network card, and the resource amount corresponding to the scope type resource may be represented by an identification number scope represented by a closed region, for example, when the scope type resource is a port, the corresponding resource amount may be represented as [1,50].
In a specific implementation process, after an application manager in the YARN cluster is started, the application manager sends a resource scheduling request for a target task in the application to the resource manager, the resource scheduling request can request resources of at least one resource type, when the application manager requests to schedule the resources, the application manager can send a plurality of containers for the target task to the resource manager, each container is assigned with different resource types, and a plurality of types of resources can be applied for the target task in one resource scheduling request.
S102, receiving the allocable resource information reported by each of a plurality of resource nodes in a resource management system, wherein the allocable resource information comprises the resource type of the allocable resource and the allocable resource quantity, and the allocable resource quantity comprises the allocable range type resource quantity.
The resource node in the resource management system may periodically communicate with the resource manager, that is, the resource node reports the resource type of the allocatable resource (i.e. the resource type of the unoccupied resource) managed by itself, and the allocatable scope type resource amount (i.e. the available scope type resource amount) corresponding to the allocatable resource to the resource manager, where the allocatable scope type resource amount may also be represented by the scope of the identification number represented by the closed zone, and examples may be referred to above, which are not illustrated herein.
After the resource manager receives the heartbeat of each resource node, the resource type of the allocable resource of the resource node and the resource quantity of the allocable range type are correspondingly stored so as to carry out subsequent inquiry. It should be noted here that the resource manager also stores all resource types and corresponding total resource amounts of the resource nodes, and occupied resource types and corresponding resource amounts, which are not described in detail herein.
S103, determining at least one target resource node from a plurality of resource nodes based on the resource types and the resource amounts in the resource scheduling request and the allocable resource information of the plurality of resource nodes; wherein each target resource node has an allocable resource matching a resource type and an amount of resources in the resource scheduling request.
Here, the allocable resources represent resources not performing tasks, that is, resources not occupied by the application program, and the allocable resources may be memories, processors, display cards, ports, network cards, and the like, and the allocable range type resources include ports, network cards, and display cards, and the like.
In executing S103, first, a current resource node is determined from a plurality of resource nodes, and it is determined whether an allocable resource of the current resource node includes an allocable scope type resource that matches the scope type resource in the resource scheduling request.
And if so, judging whether the identification number range of the indication of the resource quantity of the allocable range type corresponding to the allocable range type resource in the allocable resource is larger than or equal to the identification number range of the indication of the resource quantity of the range type resource in the resource scheduling request.
If yes, that is, if the range of the identification number indicated by the range type resource quantity of the allocable range type resource corresponding to the allocable range type resource in the allocable resource is greater than or equal to the range of the identification number indicated by the range type resource quantity of the range type resource in the resource scheduling request, the current resource node is used as the target resource node for providing the resource of the resource type.
If the identification number range indicated by the resource quantity of the allocable range type corresponding to the allocable range type resource in the allocable resource is smaller than the identification number range indicated by the resource quantity of the range type resource in the resource scheduling request, determining the next resource node from a plurality of resource nodes, taking the next resource node as the current resource node, and returning to execute the step of judging whether the allocable resource of the current resource node comprises the allocable range type resource matched with the range type resource in the resource scheduling request until the target resource node meeting the condition is determined or until all the resource nodes are determined to not meet the condition, and determining that the resource of the resource type cannot be allocated.
Here, the target resource node satisfying the condition is a resource node whose resource type of the allocatable resource includes a resource type of a scope type resource in the resource scheduling request, and an identification number scope of an allocatable scope type resource quantity indication corresponding to the allocatable scope type resource in the allocatable resource is greater than or equal to an identification number scope of a scope type resource quantity indication of the scope type resource in the resource scheduling request.
In the implementation process, after the resource manager receives the resource scheduling request of the application manager for the target application, one resource node identifier can be arbitrarily selected from a plurality of resource node identifiers stored in the resource manager, or one resource node identifier can be selected according to the storage sequence of the plurality of resource node identifiers in the resource manager, and the resource node corresponding to the selected resource node identifier is used as the current resource node.
The resource manager compares, for each container in the resource scheduling request, the scope type resource of the resource type specified by the container with the allocatable scope type resource of the current resource node, i.e., the resource type of the allocatable scope type resource of the resource type specified by the container with the allocatable scope type resource of the current resource node.
The allocatable scope type resource of the current resource node comprises scope type resource in the container, namely, the resource type existing in the resource type of the allocatable resource of the current resource node is the same as the resource type in the container, and further, the identification number scope indicated by the allocatable scope type resource quantity corresponding to the allocatable scope type resource of the allocatable resource is compared with the identification number scope indicated by the scope type resource quantity in the resource scheduling request.
When the identification number range of the allocatable scope type resource quantity indication corresponding to the allocatable scope type resource of the allocatable resource is larger than or equal to the identification number range of the scope type resource quantity indication in the resource scheduling request, that is, the identification number range of the allocatable scope type resource quantity indication corresponding to the allocatable scope type resource of the allocatable resource comprises the identification number range of the scope type resource quantity indication in the resource scheduling request, the current resource node can be used as the target resource node.
If the resource type of the allocatable scope type resource of the current resource node does not comprise the resource type in the container, that is, if the resource type does not exist in the resource type of the allocatable scope type resource of the current resource node and the resource type in the container are the same, determining one resource node from a plurality of resource nodes as the current resource node, and returning to execute the step of judging whether the allocatable resource of the current resource node comprises the allocatable scope type resource matched with the scope type resource in the resource scheduling request or not until a target resource node meeting the condition is determined, and if all the resource nodes do not meet the condition, determining that the resource of the resource type cannot be allocated, and ending the target task.
When the identification number range indicated by the resource quantity of the allocatable scope type corresponding to the resource quantity of the allocatable scope type is smaller than the identification number range indicated by the resource quantity of the scope type in the resource scheduling request, that is, the identification number range indicated by the resource quantity of the allocatable scope type corresponding to the resource quantity of the allocatable scope type does not comprise the identification number range indicated by the resource quantity of the scope type in the resource scheduling request, that is, in the identification number range indicated by the resource quantity of the allocatable scope type corresponding to the resource quantity of the allocatable scope type, a part of identification numbers exist or the identification numbers do not exist in the identification number range indicated by the resource quantity of the allocatable scope type corresponding to the resource quantity of the allocatable scope type are the same as the identification number range indicated by the resource quantity of the scope type in the resource scheduling request, the next resource node is determined from a plurality of resource nodes, the next resource node is taken as the current resource node, and the step of judging whether the allocatable resource of the current resource node comprises the allocatable scope type resource matched with the resource of the scope type in the resource scheduling request is carried out until the target resource node meeting the condition is determined.
For example, taking a resource manager to find a matching resource in a resource node as an example, the allocable resource managed in the resource node 1 is a 1-2000 number port and a 1-10 number display card, a resource scheduling request received by the resource manager includes 2 containers, a resource type specified in the container 1 is a port and a display card, a range type resource amount of the port is [1000,2000], a range type resource amount of the display card is [1,2], a resource type specified in the container 2 is a port and a display card, a range type resource amount of the port is [8000,9000], a 1-2000 number port and a 1-10 number display card in the resource node 1 can meet the requirements of the container 1 (a 1000 number-2000 number port and a 1 number-2 number display card), that is free in the resource node 1 is the same as the port number applied in the container 1, and a display card number free in the resource node 1 is the same as the display card number applied in the container 1, then the resource node 1 is determined as a target resource node, but the resource node 1 does not exist in the resource node 1 and the range type resource type and the container 2 and the resource type is not required to be matched in the resource node 2, and the resource can be queried in the other places where the detailed resource allocation is required.
When the target task is finished, all the determined resource nodes do not meet the conditions, namely, no resource node exists and can meet the resource scheduling request, so that the resources of the resource type cannot be allocated to the target task, and the target task is finished.
And S104, the resource manager transmits the node identification, the matched resource type and the resource quantity of the searched target resource node to an application manager corresponding to the client.
Here, the node identifier may be a node code, a node name, or the like, and may be determined according to actual situations.
In a specific implementation process, since one resource scheduling request received by the resource manager includes a plurality of containers, the resource manager allocates resources for each container in turn, and when the resource manager queries an allocable resource matched with the container from any resource node, the node identifier of the target resource node where the searched allocable resource is located, and the resource type and the resource amount matched with the container are sent to the application manager.
For example, continuing with the example in step S103, if the allocatable resource of the resource in the resource node 1 matches the resource type (port No. 1000-2000) of the container 1, the range type resource amount (display card No. 1-2), the node is identified as the resource node 1, the identification number range [1000,2000] of the port, and the identification number range [1,2] of the display card are sent to the application manager.
The resource manager performs resource scheduling on the target task and maintains the use state of the range type resource in each resource node, wherein the use state comprises an idle state and an occupied state, the idle state represents that the resource does not execute the task, and the occupied state represents that the resource is executing the task.
When the resource manager allocates the matched allocable resource for the target task, the use state of the matched allocable resource stored by the resource manager is changed from the idle state to the occupied state, so that the resource manager can conveniently allocate range type resources for other containers in the resource scheduling request or allocate range type resources for other applications, and resource conflict is avoided.
For example, continuing the previous example, taking node identification as NM1, port scope type resource amount [1000,2000] and video card scope type resource amount [1,2] as an illustration, the resource manager maintains a resource status table as shown in Table 1 before allocating resources:
list one
After the resource manager sends the node identifier NM1, the port range type resource amount [1000,2000] and the display card range type resource amount [1,2] to the application manager, the resource manager updates the usage state of the corresponding resource in the maintained resource state table, as shown in table two:
Watch II
When the resource manager determines that the resources allocated for the application manager that match the type and amount of resources in the resource scheduling request are released (release process is described in detail below), the resource manager further changes the usage state of the released resources from an occupied state to an idle state.
For example, continuing the previous example, after the port with port number [1000,2000] in NM1 and the graphics card with graphics card number [1,2] are released, the resource manager updates the state table, and the updated table references Table 1.
After the resource manager allocates resources (such as ports with range type resource amount of [8000,9000 ]) in the resource node for the application manager, the number of occupied resources of the queue where the target task is located and the number of occupied resources corresponding to the target task are increased. For example, the queue where the target task is located currently occupies 1000 ports and 500 ports, and then, after the target task is allocated with 1000 ports, the number of resources of the ports occupied by the queue is: 1000+1000=2000, the number of resources of the port occupied by the target task is 1000+500=1500.
The application manager further communicates with the resource node after receiving the node identifier of the resource node and the matched resource type and resource amount sent by the resource manager, and a method for the application manager to communicate with the resource node is described in detail below.
The embodiment of the disclosure provides a resource scheduling method, referring to fig. 2, which is applied to an application manager and may include the following steps:
s201, an application manager sends a resource scheduling request for a target task to a resource manager; the resource scheduling request carries at least one resource type and corresponding resource quantity required by executing the target task; the resource type comprises at least one range type resource, and the resource quantity corresponding to the range type resource is a range type resource quantity; the scope type resource amount includes a scope of identification numbers for the corresponding scope type resource.
Reference may be made to the description of the resource scheduling request in step S101, which is not described here.
S202, an application manager receives node identification of at least one target resource node sent by the resource manager, and matched resource types and resource amounts; wherein, in the resources managed by each target resource node, there are allocable resources matching the resource type and the resource amount in the resource scheduling request.
Reference may be made to the description of the resource scheduling request in step S104, which is not described here.
S203, the application manager sends a resource use request to the target resource node; the resource use request carries a task processing instruction associated with a target task, and a resource type and a corresponding resource amount required by responding to the task processing instruction.
The format of the resource use request can be determined according to the actual situation, and the task processing instruction is used for processing the data in the running process of the target task; the resource types and corresponding amounts of resources may be referred to above.
In the specific implementation process, after receiving the node identification of the target resource node and the matched resource type and resource quantity, the application manager sends a task processing instruction associated with the target task and a resource type and a corresponding resource required by responding to the task processing instruction to the target resource node.
For example, after receiving the node identifier NM1, the range type resource amount of the port is [1000,2000] and the range type resource amount of the display card is [1,2], the application manager sends a task processing instruction associated with the target task to NM1, and the resource type is the port, the range type resource amount of the port is [1000,2000], and the range type resource amounts of the resource type is the display card and the display card are [1,2].
After receiving the resource use request sent by the application manager, the resource node responds to the task processing instruction carried in the resource use request, and can refer to the following.
The present disclosure provides a resource scheduling method, as shown in fig. 3, where the method is applied to a resource node, and may include the following steps:
S301, a resource node receives a resource use request aiming at a target task, which is sent by an application manager; the resource use request carries a task processing instruction associated with a target task, and a resource type and a corresponding resource amount required by responding to the task processing instruction; the resource type comprises at least one range type resource, and the resource quantity corresponding to the range type resource is a range type resource quantity; the scope type resource amount includes a scope of identification numbers for the corresponding scope type resource.
Here, the task processing instruction and the resource type and the resource amount of the resource required for responding to the task processing instruction may refer to the above, and will not be described herein.
S302, the resource node searches the unoccupied allocable resource which is matched with the resource type and the resource quantity in the resource scheduling request from the self-managed resource based on the resource type and the resource quantity in the resource scheduling request;
in a specific implementation process, after receiving a resource use request of an application manager for a target application, a resource node compares a resource type carried in the resource use request with a self-managed allocable resource, and if the self-managed allocable resource is matched with the resource type carried in the resource use request, that is, if the resource type of the self-managed allocable resource is the same as the resource type carried in the resource use request, the resource node compares an identification number range indicated by a range type resource quantity of the resource type carried in the resource use request with an identification number range indicated by a allocable range type resource quantity of the self-managed allocable resource.
If the range of the identification number indicated by the range type resource quantity of the resource type carried in the resource use request is matched with the range of the identification number indicated by the allocatable range type resource quantity of the allocatable resource managed by the user, that is, if the range of the identification number indicated by the allocatable range type resource quantity of the allocatable resource managed by the user comprises the range of the identification number indicated by the range type resource quantity of the resource type carried in the resource use request, judging whether the use state of the corresponding resource is in an idle state or not.
S303, the resource node responds to the task processing instruction based on the searched allocable resources.
In the implementation process, after the resource node inquires the allocable resource which is matched with the resource type and the resource quantity in the resource scheduling request and is in an idle state in use state, the task processing instruction is responded based on the inquired allocable resource.
After finding the allocable resource which is matched with the resource type and the resource quantity in the resource scheduling request and has the idle state in the use state, the resource node can update the state of the resource in the resource state table maintained by the resource node, namely, the searched use state of the allocable resource is changed from the idle state to the occupied state.
For example, the application manager sends a resource usage request to the resource node 1, where the carried resource type is a port, the range type resource amount of the port is [1000,2000], the resource type is a graphics card, the range type resource amount of the graphics card is [1,2], and the state change of the port number 1000-2000 and the graphics card number 1 and 2 maintained in the resource node 1 is described as an example, where the information included in the resource state table is not illustrated, and before searching for the resource, the maintained resource state table is as shown in table three:
watch III
Resource type Range type resource amount Use state
Port (port) [1000,2000] Idle state
Display card [1,2] Idle state
After the resource node 1 finds the allocable resource, the resource node 1 updates the usage state of the corresponding resource in the maintained resource state table, as shown in a table four:
table four
Resource(s) type(s) Range type resource amount Use state
Port (port) [1000,2000] Occupancy state
Display card [1,2] Occupancy state
The resource node maintains the resource types and the range type resource amounts, and simultaneously records the resource types and the corresponding total resource amounts of all the resources managed by the resource node, the resource types and the corresponding resource amounts of the used resources, and the resource types and the corresponding resource amounts of the allocatable resources (i.e. idle resources), and correspondingly changes the use states of the used resources and the unused resources after the resources in the resource node are allocated to the target task. For example, taking a port and a graphics card as an example for illustration, 1000 ports and 2 graphics cards are maintained in a resource node, the range type resource amount of the port is [1000,2000], the range type resource amount of the graphics card is [1,2], the range type resource amount of the used port is [1500,1700], the use state is an occupied state, the range type resource amount of the used graphics card is 1, and the use state is an occupied state, the range type resource amount of the idle port is [1000,1499] and [1701,2000], the use state corresponding to the idle ports [1000,1499] and [1701,2000] is an idle state, the range type resource amount of the idle graphics card is 2, and the use state is an idle state.
In the process of executing the target task based on the allocatable resource, the application manager can actively request to release the resource of the operation target task, the resource node correspondingly changes the use state of the released resource, if the application manager does not actively request to release the resource, the resource node can change the use state of the corresponding resource after the use of the resource is finished, and update the range type resource quantity of the idle range type resource, so that the resource node informs the resource manager of the resource type and the range type resource quantity of the allocatable resource when sending the node heartbeat to the resource manager, and the resource manager can allocate the resource for other applications or containers conveniently.
The following describes the process of actively releasing resources by the application manager:
the resource node may further include the following steps after responding to the task processing instruction based on the found allocable resource:
the resource node receives a resource release request sent by the application manager; the resource release request carries the resource type of the resource to be released and the corresponding resource quantity; wherein the resource amount of the resource to be released comprises a resource amount of a range type to be released; and changing the use state of the corresponding resources to be released from the occupied state to the idle state based on the resource type and the corresponding resource amount carried in the resource release request.
Here, the format of the resource release request may be determined according to an actual scenario; the amount of the scope type resource to be released may be the identification number scope indicated by the closed section, and the above may be referred to.
In a specific implementation process, after receiving a resource release request carrying a resource to be released and a corresponding resource amount sent by an application manager, a resource node compares the resource type carried in the resource release request with a self-managed resource type, if the self-managed resource type is searched for a resource type matched with the resource type carried in the resource release request, further compares the range type resource amount of the searched resource type with the resource amount carried in the resource release request, and if the range type resource amount of the searched resource type is greater than or equal to the resource amount carried in the resource release request, changes the use state of the searched resource from an occupied state to an idle state.
For example, the application manager sends a resource release request to the resource node 1, the resource type carried in the resource release request is a port, the range type resource amount of the port is [1000,2000], the usage state of port number 1000-2000 maintained by the resource node is changed from the occupied state to the idle state, and the updated resource state table refers to table three.
After releasing the data processing resource, the resource node updates the use state of the released resource in the resource manager through the node heartbeat sent to the resource manager by the resource node.
In order to more clearly understand the present disclosure, further details are provided below by way of another example.
As shown in fig. 4, a flowchart of a resource scheduling method according to an embodiment of the disclosure includes the following steps:
s401, an application manager sends a resource scheduling request for a target task to a resource manager; the resource scheduling request carries at least one resource type and corresponding resource quantity required by running the target application; the resource type comprises at least one range type resource, the resource quantity corresponding to the range type resource is a range type resource quantity, and the range type resource quantity comprises an identification number range corresponding to the range type resource.
And S402, the resource manager periodically receives heartbeat reported by the resource node, namely, the resource-assignable information of the resource node is received, and the resource-assignable information comprises the resource type of the assignable resource and the corresponding assignable resource quantity.
S403, the resource manager determines the current resource node from the plurality of resource nodes, and queries the allocable resource matched with the resource type and the corresponding resource amount from the resources managed by the current resource node based on the resource type and the corresponding resource amount in S401 and the allocable resource information of the current resource node.
If the matched allocable resource is found, the resource node to which the matched allocable resource belongs is taken as the target resource node, and S404 is executed.
If no matching allocable resource is found, determining a next resource node from the plurality of resource nodes, taking the next node as the current resource node, and returning to step S403.
S404, the resource manager sends the node identification of at least one target resource node determined in S403 and the matched resource type and resource quantity in each target resource node to the application manager.
S405, after receiving the node identification of at least one target resource node and the matched resource type and resource quantity sent by the resource manager, the application manager sends a resource use request aiming at the target task to the target resource node, wherein the resource use request carries a task processing instruction associated with the target task, and the resource type and the resource quantity required by responding to the task processing instruction.
S406, the target resource node searches the unoccupied allocable resources which are matched with the resource types and the resource amounts and are not occupied from the self-managed resources based on the resource types and the resource amounts in the step S405, and responds to the task processing instruction based on the searched allocable resources.
S407, after finding the unoccupied allocable resource which is matched with the resource type and the resource quantity, the resource node changes the use state of the found allocable resource from an idle state to an occupied state.
S408, the application manager sends a resource release request to the target resource node; the resource release request carries the resource type of the resource to be released and the corresponding resource quantity.
S409, the target resource node changes the corresponding resources to be released from the occupied state to the idle state based on the resource type and the corresponding resource amount in S408.
It should be noted here that S402 may be performed after S401, or may be performed after any of the above steps, and the above examples are merely illustrative, and the present application does not limit the order of execution of S402.
The embodiment of the application provides a resource scheduling method, as shown in fig. 5, which is applied to terminal equipment, and the method can include the following steps:
s501, generating a task execution request for a target task, wherein the task execution request comprises at least one resource type and corresponding resource quantity required for executing the target task; the resource type comprises at least one range type resource, and the resource quantity corresponding to the range type resource is a range type resource quantity; the range type resource quantity comprises an identification number range corresponding to the range type resource;
S502, the task execution request is sent to a resource management system, so that the resource management system determines at least one target resource node from a plurality of resource nodes managed by the resource management system based on the task execution request, and the target task is executed based on the allocatable resources which are managed by each target resource node and are matched with the resource types and the corresponding resource amounts.
Here, the format of the task execution request may be determined according to the actual scenario, and the relevant details in S501-S502 may be referred to above, which will not be described here too much.
It will be appreciated by those skilled in the art that in the above-described method of the specific embodiments, the written order of steps is not meant to imply a strict order of execution but rather should be construed according to the function and possibly inherent logic of the steps.
Based on the same inventive concept, the embodiments of the present disclosure further provide a resource scheduling device corresponding to the resource scheduling method, and since the principle of solving the problem by the device in the embodiments of the present disclosure is similar to that of the foregoing resource scheduling method in the embodiments of the present disclosure, implementation of the device may refer to implementation of the method, and repeated descriptions are omitted.
Referring to fig. 6, an embodiment of the present disclosure provides a schematic diagram of a resource scheduling apparatus, where the apparatus is applied to a resource manager, the apparatus includes:
a first receiving module 61, configured to receive a resource scheduling request sent by a client; the resource scheduling request comprises at least one resource type and corresponding resource quantity required by executing a target task; the resource type comprises at least one range type resource, and the resource quantity corresponding to the range type resource is a range type resource quantity; the range type resource quantity comprises an identification number range corresponding to the range type resource;
a second receiving module 62, configured to receive allocable resource information reported by each of a plurality of resource nodes in a resource management system;
a processing module 63, configured to determine at least one target resource node from a plurality of the resource nodes based on the resource types and the resource amounts in the resource scheduling request and the allocable resource information of the plurality of the resource nodes; each target resource node has an allocable resource matched with the resource type and the resource quantity in the resource scheduling request;
a sending module 64, configured to send the node identifier of the searched target resource node, the matched resource type and the resource amount to an application manager corresponding to the client;
In one embodiment, the processing module 63 is specifically configured to:
determining a current resource node;
judging whether the allocable resources of the current resource node comprise allocable range type resources matched with the range type resources in the resource scheduling request;
if so, judging whether the identification number range of the indication of the resource quantity of the allocable range type corresponding to the allocable range type resource in the allocable resource is larger than or equal to the identification number range of the indication of the resource quantity of the range type resource in the resource scheduling request;
and if the current resource node is greater than or equal to the target resource node, taking the current resource node as a target resource node for providing the resource of the resource type.
In one embodiment, the processing module 63 is further configured to:
if the identification number range indicated by the resource quantity of the allocable range type corresponding to the allocable range type resource in the allocable resource is smaller than the identification number range indicated by the resource quantity of the range type resource in the resource scheduling request, determining the next resource node as the current resource node;
and returning to the step of judging whether the allocable resources of the current resource node comprise allocable range type resources matched with the range type resources in the resource scheduling request until the target resource node meeting the condition is determined or until all the resource nodes are determined not to meet the condition, and determining that the resources of the resource type cannot be allocated.
In one embodiment, the apparatus further comprises: a release module for:
and after determining that the scope type resource matched with the resource type and the resource quantity in the resource scheduling request is released, changing the use state of the scope type resource matched with the resource type and the resource quantity in the resource scheduling request into an idle state.
Referring to fig. 7, an embodiment of the present disclosure provides a schematic diagram of a resource scheduling apparatus, where the apparatus is applied to an application manager, the apparatus includes:
a sending module 71, configured to send a resource scheduling request for a target task to a resource manager; the resource scheduling request carries at least one resource type and corresponding resource quantity required by executing the target task; the resource type comprises at least one range type resource, and the resource quantity corresponding to the range type resource is a range type resource quantity; the range type resource quantity comprises an identification number range corresponding to the range type resource; the method comprises the steps of,
sending a resource use request to the target resource node; the resource use request carries a task processing instruction associated with a target task, and a resource type and a corresponding resource amount required by responding to the task processing instruction;
A receiving module 72, configured to receive a node identifier of at least one target resource node sent by the resource manager, and a matched resource type and resource amount; wherein, in the resources managed by each target resource node, there are allocable resources matching the resource type and the resource amount in the resource scheduling request.
Referring to fig. 8, an embodiment of the present disclosure provides a schematic diagram of a resource scheduling apparatus, where the apparatus is applied to a resource node, the apparatus includes:
a receiving module 81, configured to receive a resource usage request for a target task sent by an application manager; the resource use request carries a task processing instruction associated with a target task, and a resource type and a corresponding resource amount required by responding to the task processing instruction; the resource type comprises at least one range type resource, and the resource quantity corresponding to the range type resource is a range type resource quantity; the range type resource quantity comprises an identification number range corresponding to the range type resource;
a searching module 82, configured to search, from the self-managed resources, for unoccupied allocable resources that match the resource type and the resource amount in the resource scheduling request, based on the resource type and the resource amount in the resource scheduling request;
And the processing module 83 is used for responding to the task processing instruction based on the searched allocable resources.
In one embodiment, the apparatus further comprises: a change module, the receiving module 81 is further configured to:
receiving a resource release request sent by the application manager; the resource release request carries the resource type of the resource to be released and the corresponding resource quantity; wherein the resource amount of the resource to be released comprises a resource amount of a range type to be released;
the change module is further configured to:
and changing the use state of the corresponding resources to be released from the occupied state to the idle state based on the resource type and the corresponding resource amount carried in the resource release request.
Referring to fig. 9, an embodiment of the present disclosure provides a schematic diagram of a resource scheduling apparatus, where the apparatus is applied to a terminal device, and the apparatus includes:
a generating module 91, configured to generate a task execution request for a target task, where the task execution request includes at least one resource type and a corresponding resource amount required for executing the target task; the resource type comprises at least one range type resource, and the resource quantity corresponding to the range type resource is a range type resource quantity; the range type resource quantity comprises an identification number range corresponding to the range type resource;
And a sending module 92, configured to send the task execution request to a resource management system, so that the resource management system determines at least one target resource node from a plurality of resource nodes managed by the resource management system based on the task execution request, and execute the target task based on an allocable resource managed by each target resource node and matching the resource type and the corresponding resource amount.
Corresponding to the resource scheduling method in fig. 1, the embodiment of the present disclosure further provides a computer device 100, as shown in fig. 10, which is a schematic structural diagram of the computer device 100 provided in the embodiment of the present disclosure, including:
a processor 101, a memory 102, and a bus 103; the memory 102 is used for storing execution instructions, including a memory 1021 and an external memory 1022; the memory 1021 is also referred to as an internal memory, and is used for temporarily storing operation data in the processor 101 and data exchanged with the external memory 1022 such as a hard disk, and the processor 101 exchanges data with the external memory 1022 through the memory 1021, and when the computer device 100 operates, the processor 101 and the memory 102 communicate through the bus 103, so that the processor 101 executes the following instructions in a user mode:
Receiving a resource scheduling request sent by a client; the resource scheduling request comprises at least one resource type and corresponding resource quantity required by executing a target task; the resource type comprises at least one range type resource, and the resource quantity corresponding to the range type resource is a range type resource quantity; the range type resource quantity comprises an identification number range corresponding to the range type resource;
receiving the allocable resource information reported by each resource node in a plurality of resource nodes in a resource management system;
determining at least one target resource node from a plurality of the resource nodes based on the resource type and the resource amount in the resource scheduling request and the allocable resource information of the plurality of the resource nodes; each target resource node has an allocable resource matched with the resource type and the resource quantity in the resource scheduling request;
and sending the node identification of the searched target resource node, the matched resource type and the resource amount to an application manager corresponding to the client.
In a possible implementation manner, in an instruction executed by the processor 101, determining at least one target resource node from a plurality of the resource nodes based on the resource types and the resource amounts in a resource scheduling request, and the resource types and the corresponding allocable resource amounts of the allocable resources of the plurality of the resource nodes, includes:
Determining a current resource node;
judging whether the allocable resources of the current resource node comprise allocable range type resources matched with the range type resources in the resource scheduling request;
if so, judging whether the identification number range of the indication of the resource quantity of the allocable range type corresponding to the allocable range type resource in the allocable resource is larger than or equal to the identification number range of the indication of the resource quantity of the range type resource in the resource scheduling request;
and if the current resource node is greater than or equal to the target resource node, taking the current resource node as a target resource node for providing the resource of the resource type.
In a possible implementation manner, the instructions executed by the processor 101 further include:
if the identification number range indicated by the resource quantity of the allocable range type corresponding to the allocable range type resource in the allocable resource is smaller than the identification number range indicated by the resource quantity of the range type resource in the resource scheduling request, determining the next resource node as the current resource node;
and returning to the step of judging whether the allocable resources of the current resource node comprise allocable range type resources matched with the range type resources in the resource scheduling request until the target resource node meeting the condition is determined or until all the resource nodes are determined not to meet the condition, and determining that the resources of the resource type cannot be allocated.
In a possible implementation manner, after the instructions executed by the processor 101 send the node identifier of the searched target resource node, the matched resource type and the resource amount to the application manager corresponding to the client, the method further includes:
and after determining that the scope type resource matched with the resource type and the resource quantity in the resource scheduling request is released, changing the use state of the scope type resource matched with the resource type and the resource quantity in the resource scheduling request into an idle state.
Corresponding to the resource scheduling method in fig. 2, the embodiment of the present disclosure further provides a computer device 110, as shown in fig. 11, which is a schematic structural diagram of the computer device 110 provided in the embodiment of the present disclosure, including:
a processor 111, a memory 112, and a bus 113; the memory 112 is used for storing execution instructions, and includes a memory 1121 and an external memory 1122; the memory 1121 is also referred to as an internal memory, and is used for temporarily storing operation data in the processor 111 and data exchanged with the external memory 1122 such as a hard disk, the processor 111 exchanges data with the external memory 1122 through the memory 1121, and when the computer device 110 operates, the processor 111 and the memory 112 communicate with each other through the bus 113, so that the processor 111 performs the following instructions in a user mode:
Sending a resource scheduling request for a target task to a resource manager; the resource scheduling request carries at least one resource type and corresponding resource quantity required by executing the target task; the resource type comprises at least one range type resource, and the resource quantity corresponding to the range type resource is a range type resource quantity; the range type resource quantity comprises an identification number range corresponding to the range type resource;
receiving node identification of at least one target resource node sent by the resource manager, and matched resource types and resource amounts; wherein, in the resources managed by each target resource node, there are allocable resources matching the resource type and the resource amount in the resource scheduling request;
sending a resource use request to the target resource node; the resource use request carries a task processing instruction associated with a target task, and a resource type and a corresponding resource amount required by responding to the task processing instruction.
Corresponding to the resource scheduling method in fig. 3, the embodiment of the present disclosure further provides a computer device 120, as shown in fig. 12, which is a schematic structural diagram of the computer device 120 provided in the embodiment of the present disclosure, including:
A processor 121, a memory 122, and a bus 123; memory 122 is used to store execution instructions, including memory 1221 and external memory 1222; the memory 1221 is also referred to as an internal memory, and is used for temporarily storing operation data in the processor 121 and data exchanged with the external memory 1222 such as a hard disk, and the processor 121 exchanges data with the external memory 1222 through the memory 1221, and when the computer device 120 operates, the processor 121 and the memory 122 communicate with each other through the bus 123, so that the processor 121 executes the following instructions in a user mode:
receiving a resource use request aiming at a target task, which is sent by an application manager; the resource use request carries a task processing instruction associated with a target task, and a resource type and a corresponding resource amount required by responding to the task processing instruction; the resource type comprises at least one range type resource, and the resource quantity corresponding to the range type resource is a range type resource quantity; the range type resource quantity comprises an identification number range corresponding to the range type resource;
searching the unoccupied allocable resources which are matched with the resource types and the resource amounts in the resource scheduling request from the self-managed resources based on the resource types and the resource amounts in the resource scheduling request;
Responding to the task processing instruction based on the searched allocable resources.
In a possible implementation manner, after responding to the task processing instruction based on the found allocable resource, the instructions executed by the processor 121 further include:
receiving a resource release request sent by the application manager; the resource release request carries the resource type of the resource to be released and the corresponding resource quantity; wherein the resource amount of the resource to be released comprises a resource amount of a range type to be released;
corresponding to the resource scheduling method in fig. 5, the embodiment of the present disclosure further provides a computer device 130, as shown in fig. 13, which is a schematic structural diagram of the computer device 130 provided in the embodiment of the present disclosure, including:
a processor 131, a memory 132, and a bus 133; the memory 132 is used for storing execution instructions, including a memory 1321 and an external memory 1322; the memory 1321 is also referred to as an internal memory, and is used for temporarily storing operation data in the processor 131 and data exchanged with the external memory 1322 such as a hard disk, where the processor 131 exchanges data with the external memory 1322 through the memory 1321, and when the computer device 130 is running, the processor 131 and the memory 132 communicate with each other through the bus 133, so that the processor 131 executes the following instructions in a user mode:
Generating a task execution request for a target task, wherein the task execution request comprises at least one resource type and corresponding resource quantity required for executing the target task; the resource type comprises at least one range type resource, and the resource quantity corresponding to the range type resource is a range type resource quantity; the range type resource quantity comprises an identification number range corresponding to the range type resource;
and sending the task execution request to a resource management system so that the resource management system determines at least one target resource node from a plurality of resource nodes managed by the resource management system based on the task execution request, and executing the target task based on the allocable resources which are managed by each target resource node and are matched with the resource types and the corresponding resource amounts.
The disclosed embodiments also provide a computer readable storage medium having stored thereon a computer program which, when executed by a processor, performs the steps of resource scheduling described in the method embodiments above. Wherein the storage medium may be a volatile or nonvolatile computer readable storage medium.
The computer program product of the comment information obtaining method provided by the embodiment of the disclosure includes a computer readable storage medium storing a program code, where the program code includes instructions for executing the steps of the resource scheduling method described in the above method embodiment, and specifically, reference may be made to the above method embodiment, which is not repeated herein.
The disclosed embodiments also provide a computer program which, when executed by a processor, implements any of the methods of the previous embodiments. The computer program product may be realized in particular by means of hardware, software or a combination thereof. In an alternative embodiment, the computer program product is embodied as a computer storage medium, and in another alternative embodiment, the computer program product is embodied as a software product, such as a software development kit (Software Development Kit, SDK), or the like.
It will be clear to those skilled in the art that, for convenience and brevity of description, specific working procedures of the above-described system and apparatus may refer to corresponding procedures in the foregoing method embodiments, which are not described herein again. In the several embodiments provided in the present disclosure, it should be understood that the disclosed systems, devices, and methods may be implemented in other manners. The above-described apparatus embodiments are merely illustrative, for example, the division of the units is merely a logical function division, and there may be other manners of division in actual implementation, and for example, multiple units or components may be combined or integrated into another system, or some features may be omitted, or not performed. Alternatively, the coupling or direct coupling or communication connection shown or discussed with each other may be through some communication interface, device or unit indirect coupling or communication connection, which may be in electrical, mechanical or other form.
The units described as separate units may or may not be physically separate, and units shown as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the units may be selected according to actual needs to achieve the purpose of the solution of this embodiment.
In addition, each functional unit in each embodiment of the present disclosure may be integrated in one processing unit, or each unit may exist alone physically, or two or more units may be integrated in one unit.
The functions, if implemented in the form of software functional units and sold or used as a stand-alone product, may be stored in a non-volatile computer readable storage medium executable by a processor. Based on such understanding, the technical solution of the present disclosure may be embodied in essence or a part contributing to the prior art or a part of the technical solution, or in the form of a software product stored in a storage medium, including several instructions to cause a computer device (which may be a personal computer, a server, or a network device, etc.) to perform all or part of the steps of the method described in the embodiments of the present disclosure. And the aforementioned storage medium includes: a U-disk, a removable hard disk, a Read-Only Memory (ROM), a random access Memory (Random Access Memory, RAM), a magnetic disk, or an optical disk, or other various media capable of storing program codes.
Finally, it should be noted that: the foregoing examples are merely specific embodiments of the present disclosure, and are not intended to limit the scope of the disclosure, but the present disclosure is not limited thereto, and those skilled in the art will appreciate that while the foregoing examples are described in detail, it is not limited to the disclosure: any person skilled in the art, within the technical scope of the disclosure of the present disclosure, may modify or easily conceive changes to the technical solutions described in the foregoing embodiments, or make equivalent substitutions for some of the technical features thereof; such modifications, changes or substitutions do not depart from the spirit and scope of the technical solutions of the embodiments of the disclosure, and are intended to be included within the scope of the present disclosure. Therefore, the protection scope of the present disclosure shall be subject to the protection scope of the claims.

Claims (14)

1. A method for scheduling resources, the method comprising:
receiving a resource scheduling request sent by a client; the resource scheduling request comprises at least one resource type and corresponding resource quantity required by executing a target task; the resource type comprises at least one range type resource, and the resource quantity corresponding to the range type resource is a range type resource quantity; the range type resource quantity comprises an identification number range corresponding to the range type resource; the range type resource comprises at least one of a port, a network card and a display card;
Receiving the allocable resource information reported by each resource node in a plurality of resource nodes in a resource management system;
determining at least one target resource node from a plurality of the resource nodes based on the resource type and the amount of resources in the resource scheduling request and the allocable resource information of the plurality of the resource nodes; each target resource node has an allocable resource matched with the resource type and the resource quantity in the resource scheduling request;
and sending the node identification of the searched target resource node, the matched resource type and the resource amount to an application manager corresponding to the client.
2. The method of claim 1, wherein determining at least one target resource node from a plurality of the resource nodes based on the resource type and the amount of resources in the resource scheduling request and the allocable resource information for a plurality of the resource nodes, comprises:
determining a current resource node;
judging whether the allocable resources of the current resource node comprise allocable range type resources matched with the range type resources in the resource scheduling request;
If so, judging whether the identification number range of the indication of the resource quantity of the allocable range type corresponding to the allocable range type resource in the allocable resource is larger than or equal to the identification number range of the indication of the resource quantity of the range type resource in the resource scheduling request;
and if the current resource node is greater than or equal to the target resource node, taking the current resource node as a target resource node for providing the resource of the resource type.
3. The method as recited in claim 2, further comprising:
if the identification number range indicated by the resource quantity of the allocable range type corresponding to the allocable range type resource in the allocable resource is smaller than the identification number range indicated by the resource quantity of the range type resource in the resource scheduling request, determining the next resource node as the current resource node;
and returning to the step of judging whether the allocable resources of the current resource node comprise allocable range type resources matched with the range type resources in the resource scheduling request until the target resource node meeting the condition is determined or until all the resource nodes are determined not to meet the condition, and determining that the resources of the resource type cannot be allocated.
4. The method of claim 1, further comprising, after sending the node identification of the found target resource node, the matched resource type and the resource amount to an application manager corresponding to the client:
and after determining that the scope type resource matched with the resource type and the resource quantity in the resource scheduling request is released, changing the use state of the scope type resource matched with the resource type and the resource quantity in the resource scheduling request into an idle state.
5. A method for scheduling resources, comprising:
generating a task execution request for a target task, wherein the task execution request comprises at least one resource type and corresponding resource quantity required for executing the target task; the resource type comprises at least one range type resource, and the resource quantity corresponding to the range type resource is a range type resource quantity; the range type resource quantity comprises an identification number range corresponding to the range type resource; the range type resource comprises at least one of a port, a network card and a display card;
and sending the task execution request to a resource management system so that the resource management system determines at least one target resource node from a plurality of resource nodes managed by the resource management system based on the task execution request, and executing the target task based on the allocable resources which are managed by each target resource node and are matched with the resource types and the corresponding resource amounts.
6. A method for scheduling resources, the method comprising:
the application manager sends a resource scheduling request for a target task to a resource manager; the resource scheduling request carries at least one resource type and corresponding resource quantity required by executing the target task; the resource type comprises at least one range type resource, and the resource quantity corresponding to the range type resource is a range type resource quantity; the range type resource quantity comprises an identification number range corresponding to the range type resource; the range type resource comprises at least one of a port, a network card and a display card;
receiving node identification of at least one target resource node sent by the resource manager, and matched resource types and resource amounts; wherein, in the resources managed by each target resource node, there are allocable resources matching the resource type and the resource amount in the resource scheduling request;
sending a resource use request to the target resource node; the resource use request carries a task processing instruction associated with a target task, and a resource type and a corresponding resource amount required by responding to the task processing instruction.
7. A method for scheduling resources, the method comprising:
the resource node receives a resource use request aiming at a target task, which is sent by an application manager; the resource use request carries a task processing instruction associated with a target task, and a resource type and a corresponding resource amount required by responding to the task processing instruction; the resource type comprises at least one range type resource, and the resource quantity corresponding to the range type resource is a range type resource quantity; the range type resource quantity comprises an identification number range corresponding to the range type resource; the range type resource comprises at least one of a port, a network card and a display card;
searching an unoccupied allocable resource which is matched with the resource type and the resource amount in the resource use request from the self-managed resource based on the resource type and the resource amount in the resource use request;
responding to the task processing instruction based on the searched allocable resources.
8. The method of claim 7, further comprising, after responding to the task processing instruction based on the found allocable resources:
receiving a resource release request sent by the application manager; the resource release request carries the resource type of the resource to be released and the corresponding resource quantity; wherein the resource amount of the resource to be released comprises a resource amount of a range type to be released;
And changing the use state of the corresponding resources to be released from the occupied state to the idle state based on the resource type and the corresponding resource amount carried in the resource release request.
9. A resource scheduling apparatus, the apparatus comprising:
the first receiving module is used for receiving a resource scheduling request sent by the client; the resource scheduling request comprises at least one resource type and corresponding resource quantity required by executing a target task; the resource type comprises at least one range type resource, and the resource quantity corresponding to the range type resource is a range type resource quantity; the range type resource quantity comprises an identification number range corresponding to the range type resource; the range type resource comprises at least one of a port, a network card and a display card;
the second receiving module is used for receiving the allocable resource information reported by each resource node in a plurality of resource nodes in the resource management system;
a processing module configured to determine at least one target resource node from a plurality of the resource nodes based on the resource type and the resource amount in the resource scheduling request and the allocable resource information of the plurality of the resource nodes; each target resource node has an allocable resource matched with the resource type and the resource quantity in the resource scheduling request;
And the sending module is used for sending the node identification, the matched resource type and the resource quantity of the searched target resource node to an application manager corresponding to the client.
10. A resource scheduling apparatus, the apparatus comprising:
the system comprises a generation module, a processing module and a processing module, wherein the generation module is used for generating a task execution request aiming at a target task, and the task execution request comprises at least one resource type and corresponding resource quantity required by executing the target task; the resource type comprises at least one range type resource, and the resource quantity corresponding to the range type resource is a range type resource quantity; the range type resource quantity comprises an identification number range corresponding to the range type resource; the range type resource comprises at least one of a port, a network card and a display card;
and the sending module is used for sending the task execution request to a resource management system so that the resource management system can determine at least one target resource node from a plurality of resource nodes managed by the resource management system based on the task execution request, and execute the target task based on the allocable resource which is managed by each target resource node and is matched with the resource type and the corresponding resource quantity.
11. A resource scheduling apparatus, the apparatus being for use in an application manager, the apparatus comprising:
the sending module is used for sending a resource scheduling request aiming at a target task to the resource manager; the resource scheduling request carries at least one resource type and corresponding resource quantity required by executing the target task; the resource type comprises at least one range type resource, and the resource quantity corresponding to the range type resource is a range type resource quantity; the range type resource quantity comprises an identification number range corresponding to the range type resource; and sending a resource use request to the target resource node; the resource use request carries a task processing instruction associated with a target task, and a resource type and a corresponding resource amount required by responding to the task processing instruction; the range type resource comprises at least one of a port, a network card and a display card;
the receiving module is used for receiving the node identification of at least one target resource node sent by the resource manager, and the matched resource type and resource quantity; wherein, in the resources managed by each target resource node, there are allocable resources matching the resource type and the resource amount in the resource scheduling request.
12. A resource scheduling apparatus, the apparatus being for use in a resource node, the apparatus comprising:
the receiving module is used for receiving a resource use request aiming at a target task and sent by the application manager; the resource use request carries a task processing instruction associated with a target task, and a resource type and a corresponding resource amount required by responding to the task processing instruction; the resource type comprises at least one range type resource, and the resource quantity corresponding to the range type resource is a range type resource quantity; the range type resource quantity comprises an identification number range corresponding to the range type resource; the range type resource comprises at least one of a port, a network card and a display card;
the searching module is used for searching the unoccupied allocable resources which are matched with the resource types and the resource amounts in the resource use requests from the self-managed resources based on the resource types and the resource amounts in the resource use requests;
and the processing module is used for responding to the task processing instruction based on the searched allocable resources.
13. A computer device, comprising: a processor, a storage medium, and a bus, the storage medium storing machine-readable instructions executable by the processor, the processor and the storage medium communicating over the bus when the computer device is running, the processor executing the machine-readable instructions to perform the steps of the method of any one of claims 1 to 4, or to perform the steps of the method of claim 5, or to perform the steps of the method of claim 6, or to perform the steps of the method of claim 7 or 8.
14. A computer-readable storage medium, on which a computer program is stored which, when being executed by a processor, performs the steps of the method according to any one of claims 1 to 4, or performs the steps of the method according to claim 5, or performs the steps of the method according to claim 6, or performs the steps of the method according to claim 7 or 8.
CN202010538340.5A 2020-06-12 2020-06-12 Resource scheduling method, device, computer equipment and storage medium Active CN111694649B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202010538340.5A CN111694649B (en) 2020-06-12 2020-06-12 Resource scheduling method, device, computer equipment and storage medium

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202010538340.5A CN111694649B (en) 2020-06-12 2020-06-12 Resource scheduling method, device, computer equipment and storage medium

Publications (2)

Publication Number Publication Date
CN111694649A CN111694649A (en) 2020-09-22
CN111694649B true CN111694649B (en) 2023-07-18

Family

ID=72480814

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202010538340.5A Active CN111694649B (en) 2020-06-12 2020-06-12 Resource scheduling method, device, computer equipment and storage medium

Country Status (1)

Country Link
CN (1) CN111694649B (en)

Families Citing this family (15)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112269659A (en) * 2020-10-23 2021-01-26 苏州浪潮智能科技有限公司 Resource management method, system, electronic equipment and storage medium
CN112463376A (en) * 2020-11-26 2021-03-09 北京字节跳动网络技术有限公司 Resource allocation method and device
CN112596904A (en) * 2020-12-25 2021-04-02 济南浪潮高新科技投资发展有限公司 Quantum service resource calling optimization method based on quantum cloud platform
CN113312161A (en) * 2021-05-06 2021-08-27 联想(北京)有限公司 Application scheduling method, platform and storage medium
CN113238848A (en) * 2021-05-27 2021-08-10 上海商汤科技开发有限公司 Task scheduling method and device, computer equipment and storage medium
CN113282419B (en) * 2021-06-07 2022-07-08 国家超级计算天津中心 Resource scheduling method, electronic device, and computer-readable storage medium
CN113535339B (en) * 2021-07-19 2022-06-17 赞同科技股份有限公司 Service calling method and device
CN113419839A (en) * 2021-07-20 2021-09-21 北京字节跳动网络技术有限公司 Resource scheduling method and device for multi-type jobs, electronic equipment and storage medium
US11277355B1 (en) * 2021-07-27 2022-03-15 Beijing Tenate Electronic Technology Co., Ltd. Adjustable resource management system
CN114035942A (en) * 2021-10-22 2022-02-11 北京字节跳动网络技术有限公司 Resource scheduling method and device, electronic equipment and storage medium
CN114138500B (en) * 2022-01-29 2022-07-08 阿里云计算有限公司 Resource scheduling system and method
CN114785794B (en) * 2022-03-29 2024-07-12 北京字节跳动网络技术有限公司 Resource allocation method, device, equipment, medium and system
CN115037752B (en) * 2022-04-22 2024-03-22 网易(杭州)网络有限公司 Resource allocation method and device and electronic equipment
CN114860453A (en) * 2022-05-27 2022-08-05 中国第一汽车股份有限公司 Method and device for executing tasks of scene engine, electronic equipment and storage medium
CN115827206B (en) * 2023-01-18 2023-05-05 太极计算机股份有限公司 Scheduling method and system for display card task resources based on machine learning

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2010086317A (en) * 2008-09-30 2010-04-15 Hitachi Ltd Resource allocation method, resource allocation program, and flow processing system
JP2014063449A (en) * 2012-09-24 2014-04-10 Hitachi Systems Ltd Resource management system, resource management method and resource management program

Family Cites Families (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102572003B (en) * 2010-12-08 2015-01-14 中国电信股份有限公司 Method and system for acquiring and processing multiplexing address and port range
CN108845877B (en) * 2013-05-17 2021-09-17 华为技术有限公司 Method, device and system for managing memory
CN104780146B (en) * 2014-01-13 2018-04-27 华为技术有限公司 Method for managing resource and device
CN105589750B (en) * 2015-07-07 2019-01-25 新华三技术有限公司 A kind of cpu resource dispatching method and server
CN105099951B (en) * 2015-07-27 2018-06-26 中国联合网络通信集团有限公司 A kind of resource regulating method and management equipment
CN108293041B (en) * 2015-12-28 2020-10-09 华为技术有限公司 Distributed system, resource container allocation method, resource manager and application controller
CN106603435B (en) * 2016-12-28 2019-10-15 北京华为数字技术有限公司 Distribute the method and device of port block resource
CN108400898A (en) * 2018-05-30 2018-08-14 郑州云海信息技术有限公司 The management method and device of resource in cloud data management platform
CN111045795A (en) * 2018-10-11 2020-04-21 浙江宇视科技有限公司 Resource scheduling method and device

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2010086317A (en) * 2008-09-30 2010-04-15 Hitachi Ltd Resource allocation method, resource allocation program, and flow processing system
JP2014063449A (en) * 2012-09-24 2014-04-10 Hitachi Systems Ltd Resource management system, resource management method and resource management program

Also Published As

Publication number Publication date
CN111694649A (en) 2020-09-22

Similar Documents

Publication Publication Date Title
CN111694649B (en) Resource scheduling method, device, computer equipment and storage medium
CN111522641B (en) Task scheduling method, device, computer equipment and storage medium
CN111091429A (en) Electronic bill identification distribution method and device and electronic bill generation system
CN112261115B (en) Resource allocation method, device and computer storage medium
CN103716383A (en) Method and device for accessing shared resources
CN110413845B (en) Resource storage method and device based on Internet of things operating system
CN101853215B (en) Memory allocation method and device
CN110196860A (en) Unique identification distribution method and device, electronic equipment, storage medium
CN110798507B (en) Method and system for DHCP address allocation memory
CN101354720B (en) Distributed memory database data system and sharing method thereof
CN112073532A (en) Resource allocation method and device
CN114155026A (en) Resource allocation method, device, server and storage medium
CN112631680A (en) Micro-service container scheduling system, method, device and computer equipment
US8156289B2 (en) Hardware support for work queue management
CN109819674B (en) Computer storage medium, embedded scheduling method and system
CN114217956A (en) Container cluster deployment method and device and computer equipment
WO2021057405A1 (en) Resource sharing method and device
CN112463376A (en) Resource allocation method and device
CN106559452A (en) Data processing method and device under cluster environment
CN112003930A (en) Task allocation method, device, equipment and storage medium
CN114253733A (en) Memory management method and device, computer equipment and storage medium
CN114924888A (en) Resource allocation method, data processing method, device, equipment and storage medium
CN107315693B (en) Data storage method and device
CN112667642A (en) Information generation method and device and electronic equipment
CN108196786B (en) Method and management device for storage system partitioning

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
TA01 Transfer of patent application right
TA01 Transfer of patent application right

Effective date of registration: 20220704

Address after: 100190 1309, 13th floor, building 4, Zijin Digital Park, Haidian District, Beijing

Applicant after: Beijing volcano Engine Technology Co.,Ltd.

Address before: 100041 B-0035, 2 floor, 3 building, 30 Shixing street, Shijingshan District, Beijing.

Applicant before: BEIJING BYTEDANCE NETWORK TECHNOLOGY Co.,Ltd.

GR01 Patent grant
GR01 Patent grant