Nothing Special   »   [go: up one dir, main page]

CN116841720A - Resource allocation method, apparatus, computer device, storage medium and program product - Google Patents

Resource allocation method, apparatus, computer device, storage medium and program product Download PDF

Info

Publication number
CN116841720A
CN116841720A CN202210295216.XA CN202210295216A CN116841720A CN 116841720 A CN116841720 A CN 116841720A CN 202210295216 A CN202210295216 A CN 202210295216A CN 116841720 A CN116841720 A CN 116841720A
Authority
CN
China
Prior art keywords
resource
target
information
node
resource node
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.)
Pending
Application number
CN202210295216.XA
Other languages
Chinese (zh)
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.)
Tencent Technology Shenzhen Co Ltd
Original Assignee
Tencent Technology Shenzhen 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 Tencent Technology Shenzhen Co Ltd filed Critical Tencent Technology Shenzhen Co Ltd
Priority to CN202210295216.XA priority Critical patent/CN116841720A/en
Publication of CN116841720A publication Critical patent/CN116841720A/en
Pending legal-status Critical Current

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/50Allocation of resources, e.g. of the central processing unit [CPU]
    • G06F9/5061Partitioning or combining of 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/5005Allocation of resources, e.g. of the central processing unit [CPU] to service a request
    • G06F9/5027Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resource being a machine, e.g. CPUs, Servers, Terminals

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 application provides a resource allocation method, a resource allocation device, computer equipment, a storage medium and a program product, and relates to the field of resource allocation. The resource allocation method comprises the following steps: if the existence of resource migration between at least one resource node is detected, determining target attribute information of target resources to be migrated; wherein the target attribute information includes at least one of a target business attribute and a target resource specification; acquiring at least one candidate destination resource node and acquiring configuration rule information of the at least one candidate destination resource node; the configuration rule information comprises at least one of business attribute affinity configuration information and resource specification affinity configuration information; if the configuration rule information is obtained, screening at least one candidate target resource node based on the target attribute information and the configuration rule information to obtain a target resource node; and distributing the target resource to the target resource node. The defragmentation efficiency can be improved.

Description

Resource allocation method, apparatus, computer device, storage medium and program product
Technical Field
The present application relates to the field of resource allocation technology, and in particular, to a resource allocation method, apparatus, computer device, storage medium, and program product.
Background
With the increasing number of cores of a CPU (central processing unit ) of a single machine, a single service is difficult to eat the number of cores of the whole machine, and resources are required to be isolated in a containerized manner for each service to use, but when the single machine resources are packaged by the container, due to the difference of the resource quantity required by each service, after the single machine resources are segmented by the service, the fragmented resources are difficult to use out, and the remaining unavailable fragments are called fragmented resources.
For the fragmented resources in the cluster, the resource allocation strategy is planned in advance at present, and then the service side is pushed to move the resources to finish the defragmentation, so that the defragmentation process not only requires the personnel at the resource side to carry out closed loop, but also requires the service side to carry out follow-up, the time consumption is long, and the defragmentation efficiency is lower.
Disclosure of Invention
The application provides a resource allocation method, a resource allocation device, computer equipment, a storage medium and a program product, which can solve the problems of long time consumption and low efficiency of chip arrangement in the related technology. The technical scheme is as follows:
in one aspect, a method for configuring resources is provided, including:
if the existence of resource migration between at least one resource node is detected, determining target attribute information of target resources to be migrated; wherein the target attribute information includes at least one of a target business attribute and a target resource specification;
Acquiring at least one candidate destination resource node and acquiring configuration rule information of the at least one candidate destination resource node; the configuration rule information comprises at least one of business attribute affinity configuration information and resource specification affinity configuration information;
if the configuration rule information is obtained, screening at least one candidate target resource node based on the target attribute information and the configuration rule information to obtain a target resource node;
and distributing the target resource to the target resource node.
In one possible implementation manner, before detecting that there is resource migration between at least one resource node, the method further includes:
collecting service distribution information and resource fragment information of at least one resource node;
and if the service distribution information or the resource fragment information of any resource node is detected to change, judging that the resource migration exists between at least one resource node.
In one possible implementation, the service distribution information and the resource fragmentation information of at least one resource node are collected, triggered based on at least one of the following conditions:
spacing a preset period;
the current time reaches the preset time;
and receiving a resource configuration instruction.
In one possible implementation, obtaining at least one candidate destination resource node includes:
Acquiring at least one idle resource node;
respectively determining idle resource specifications in idle resource nodes;
and taking the idle resource node with the idle resource specification not smaller than the target resource specification as a candidate target resource node.
In one possible implementation, the target attribute information includes a target service attribute, and the configuration rule information includes service attribute affinity configuration information;
screening at least one candidate destination resource node based on the target attribute information and the configuration rule information to obtain a destination resource node, including:
determining the operation business attribute of the existing resources in each candidate destination resource node;
and determining the destination resource node based on the candidate destination resource node with which the operation service attribute is compatible with the target service attribute.
In one possible implementation, the target attribute information further includes a target resource specification, and the configuration rule information further includes a target resource specification;
determining a destination resource node based on candidate destination resource nodes for which the operational service attributes are affinitive to the target service attributes, comprising:
the candidate destination resource node with the operation service attribute being compatible with the target service attribute is used as a first resource node;
determining the idle resource specification of each first resource node;
And taking the first resource node with the affinity of the idle resource specification and the target resource specification as a target resource node.
In one possible implementation, the method further includes:
if the configuration rule information is not obtained, determining the resource fragment rate of each candidate destination resource node;
and taking the candidate destination resource node with the resource fragment rate lower than the preset threshold value as the destination resource node.
In one possible implementation, the method further includes:
and updating the configuration rule information of the at least one resource node based on the service distribution information and the resource fragment information of the current at least one resource node.
In another aspect, there is provided a resource allocation apparatus, the apparatus comprising:
the detection module is used for determining target attribute information of target resources to be migrated if the existence of resource migration between at least one resource node is detected; wherein the target attribute information includes at least one of a target business attribute and a target resource specification;
the acquisition module is used for acquiring at least one candidate destination resource node and acquiring configuration rule information of the at least one candidate destination resource node; the configuration rule information comprises at least one of business attribute affinity configuration information and resource specification affinity configuration information;
The screening module is used for screening at least one candidate destination resource node based on the target attribute information and the configuration rule information if the configuration rule information is acquired, so as to obtain the destination resource node;
and the allocation module is used for allocating the target resource to the target resource node.
In one possible implementation manner, the device further comprises an acquisition module, configured to:
collecting service distribution information and resource fragment information of at least one resource node;
and if the service distribution information or the resource fragment information of any resource node is detected to change, judging that the resource migration exists between at least one resource node.
In one possible implementation manner, the acquisition module acquires service distribution information and resource fragment information of at least one resource node, and triggers based on at least one of the following conditions:
spacing a preset period;
the current time reaches the preset time;
and receiving a resource configuration instruction.
In one possible implementation manner, the acquiring module is specifically configured to, when acquiring at least one candidate destination resource node:
acquiring at least one idle resource node;
respectively determining idle resource specifications in idle resource nodes;
and taking the idle resource node with the idle resource specification not smaller than the target resource specification as a candidate target resource node.
In one possible implementation, the target attribute information includes a target service attribute, and the configuration rule information includes service attribute affinity configuration information;
the screening module screens at least one candidate destination resource node based on the target attribute information and the configuration rule information, and is specifically used for:
determining the operation business attribute of the existing resources in each candidate destination resource node;
and determining the destination resource node based on the candidate destination resource node with which the operation service attribute is compatible with the target service attribute.
In one possible implementation, the target attribute information further includes a target resource specification, and the configuration rule information further includes a target resource specification;
the screening module is specifically configured to, when determining a destination resource node based on a candidate destination resource node for which the operation service attribute is compatible with the target service attribute:
the candidate destination resource node with the operation service attribute being compatible with the target service attribute is used as a first resource node;
determining the idle resource specification of each first resource node;
and taking the first resource node with the affinity of the idle resource specification and the target resource specification as a target resource node.
In one possible implementation manner, the method further includes a determining module, configured to:
If the configuration rule information is not obtained, determining the resource fragment rate of each candidate destination resource node;
and taking the candidate destination resource node with the resource fragment rate lower than the preset threshold value as the destination resource node.
In one possible implementation, the method further includes an update module configured to:
and updating the configuration rule information of the at least one resource node based on the service distribution information and the resource fragment information of the current at least one resource node.
In another aspect, a computer device is provided, including a memory, a processor, and a computer program stored on the memory, the processor executing the computer program to implement the resource allocation method described above.
In another aspect, a computer readable storage medium is provided, on which a computer program is stored, which when executed by a processor implements the above-described resource allocation method.
In another aspect, a computer program product is provided, comprising a computer program, which when executed by a processor implements the above-described resource allocation method.
The technical scheme provided by the application has the beneficial effects that:
when resource migration exists between at least one resource node, at least one candidate target resource node is screened through service attribute affinity configuration information and resource specification affinity configuration information to obtain a target resource node, and target resources are distributed to the target resource node without intervention of a resource side and a service side, so that communication cost can be effectively reduced, and defragmentation efficiency is improved.
Furthermore, the configuration rule information of at least one resource node is planned and adjusted in real time, so that the resource configuration can be carried out by combining the configuration rule information in the next resource migration, the availability of the resource can be effectively improved, and the cost is reduced.
Drawings
In order to more clearly illustrate the technical solutions in the embodiments of the present application, the drawings that are required to be used in the description of the embodiments of the present application will be briefly described below.
FIG. 1 is a schematic diagram of a fragmented resource provided by an example of the present application;
FIG. 2 is a schematic diagram of an implementation environment of a resource allocation method according to an embodiment of the present application;
fig. 3 is a schematic flow chart of a resource allocation method according to an embodiment of the present application;
FIG. 4 is a schematic diagram of an architecture of a resource configuration provided by an example of the present application;
FIG. 5 is a schematic diagram of a scheme of resource allocation provided by an example of the present application;
fig. 6 is a schematic structural diagram of a resource allocation device according to an embodiment of the present application;
fig. 7 is a schematic structural diagram of a computer device according to an embodiment of the present application.
Detailed Description
Embodiments of the present application are described below with reference to the drawings in the present application. It should be understood that the embodiments described below with reference to the drawings are exemplary descriptions for explaining the technical solutions of the embodiments of the present application, and the technical solutions of the embodiments of the present application are not limited.
As used herein, the singular forms "a", "an", "the" and "the" are intended to include the plural forms as well, unless expressly stated otherwise, as understood by those skilled in the art. It will be further understood that the terms "comprises" and "comprising," when used in this specification, specify the presence of stated features, information, data, steps, operations, elements, and/or components, but do not preclude the presence or addition of other features, information, data, steps, operations, elements, components, and/or groups thereof, all of which may be included in the present specification. It will be understood that when an element is referred to as being "connected" or "coupled" to another element, it can be directly connected or coupled to the other element or intervening elements may be present. Further, "connected" or "coupled" as used herein may include wirelessly connected or wirelessly coupled. The term "and/or" as used herein indicates at least one of the items defined by the term, e.g. "a and/or B" indicates implementation as "a", or as "a and B".
For the purpose of making the objects, technical solutions and advantages of the present application more apparent, the embodiments of the present application will be described in further detail with reference to the accompanying drawings.
With the increasing number of CPU cores of single-machine equipment, a single service is difficult to eat up the number of cores of the whole machine, resources are required to be isolated in a containerized mode for each service to use, but when single-machine resources are packaged by containers, the single-machine resources are cut by the service due to the difference of the resource quantity required by each service, and the fragmented resources are difficult to use, so that the fragmented resources of the service are generated.
As shown in fig. 1, in a stand-alone device with 90 cores, different service demands are different, for example, there are resources with 40 cores and resources with 36 cores, so that after the device resources are split by the service, there remains a fragment resource, as shown in the figure, 2core and 10core resource fragments remain respectively, the number of the fragment resource CPU cores of the cluster is uneven, the difference is large, and from the perspective of the cluster, there is enough service availability of the available cores of the cluster, but the specification cluster of the service demands cannot be satisfied.
For the fragment resources in the cluster, the traditional solution is to firstly plan the allocation strategy of the resources, then push the service side to move the resources to finish the defragmentation, the defragmentation process is not only closed-loop of personnel at the resource side, but also needs the responsible person at the service side to follow up, the time consumption is long, the process is not measurable, and the overall output of the effect is unpredictable.
The application executes the affinity and anti-affinity strategy when the resources are allocated; the running state executes a dynamic defragmentation strategy according to the change of resources, and a defragmentation real-time method is provided, and compared with the prior scheme, the method is optimized:
1) The defragmentation of the resources is arranged in a closed loop of the resource layer, the intervention of business side colleagues is not needed, and the communication cost is reduced;
2) The defragmentation effect under the defragmentation strategy in real time can be measured, the process can be quantitatively output, and the situation that the defragmentation is carried out for a long time but no defragmentation effect can be measured is avoided;
3) The boxing rate of the resource clusters is improved, particularly, the average boxing rate according to the time dimension is greatly higher than the period of communication alignment, business intervention follow-up and floor execution in the traditional scheme;
4) The problem of resource false shortage is solved, and the situation that the cluster feeds back the resource shortage when a user submits a requirement of a certain specification is avoided. 5) By planning before resource allocation and real-time adjustment in operation, allocation adjustment and dynamic strategy are combined, the availability of resources is improved to the maximum extent, and the cost is reduced.
Fig. 2 is a schematic diagram of an implementation environment of a resource allocation method according to an embodiment of the present application, referring to fig. 2, the implementation environment includes: resource configuration device 101, resource node 102a, resource node 102b, and resource node 102c.
Specifically, there is a change in traffic distribution information or resource fragmentation information between the resource node 102a, the resource node 102b, and the resource node 102c, i.e., resource migration occurs. If the resource allocation device 101 detects the resource migration, determining target attribute information of a target resource to be migrated; for example, if the resource to be migrated is migrated from the resource node 102a, the resource node 102b and the resource node 102c may be candidate destination resource nodes, obtain configuration rule information of the candidate destination resource nodes, and screen the candidate destination resource nodes based on the target attribute information and the configuration rule information to obtain destination resource nodes, for example, screen and determine that the destination resource node is the resource node 102c, and allocate the target resource to the destination resource node 102c.
It will be appreciated that fig. 2 shows an application scenario in an example, and is not limited to the application scenario of the resource allocation method of the present application. The resource allocation device 101 may be a terminal or a server.
Those skilled in the art will appreciate that the server may be an independent physical server, or may be a server cluster or a distributed system formed by a plurality of physical servers, or may be a cloud server or a server cluster that provides cloud services, cloud databases, cloud computing, cloud functions, cloud storage, network services, cloud communication, middleware services, domain name services, security services, CDN (Content Delivery Network ), and basic cloud computing services such as big data and artificial intelligence platforms. The terminal may be a smart phone (such as an Android mobile phone, an iOS mobile phone, etc.), a tablet computer, a notebook computer, a digital broadcast receiver, an MID (Mobile Internet Devices, mobile internet device), a PDA (personal digital assistant), a desktop computer, a smart home appliance, a vehicle-mounted terminal (such as a vehicle-mounted navigation terminal, a vehicle-mounted computer, etc.), a smart speaker, a smart watch, etc., and the terminal and the server may be directly or indirectly connected through wired or wireless communication manners, but are not limited thereto. And in particular, the method can be determined based on actual application scene requirements, and is not limited herein.
Fig. 3 is a flow chart of a resource allocation method according to an embodiment of the present application. The execution body of the method can be resource allocation equipment, and the resource allocation equipment can be a terminal or a server. As shown in fig. 3, the method may include the steps of:
step 301, if it is detected that there is resource migration between at least one resource node, determining target attribute information of a target resource to be migrated.
The resource node may be a stand-alone device or a non-stand-alone device.
Wherein the target attribute information includes at least one of a target business attribute and a target resource specification.
Specifically, the target attribute information is attribute information of a service used for running by the target resource; if the target resource is a resource fragment, the target service attribute is not included.
In some possible implementations, whether there is a resource migration in a resource node may be determined by traffic distribution information and resource fragmentation information between at least one resource node.
In some possible embodiments, step S301 may further include, before detecting that there is a resource migration between at least one resource node:
(1) Collecting service distribution information and resource fragment information of at least one resource node;
(2) And if the service distribution information or the resource fragment information of any resource node is detected to change, judging that the resource migration exists between at least one resource node.
Specifically, the resource allocation device may collect service distribution information and resource fragment information of each resource node through an agent (agent) deployed on each resource node.
Specifically, the service distribution information may include which services the resources of each of the at least one resource node are used to run, and the resource fragmentation information may include resource fragmentation information, such as a resource fragmentation specification, on each of the at least one resource node.
In some possible embodiments, the collecting of the traffic distribution information and the resource fragmentation information of the at least one resource node may be triggered based on at least one of the following conditions:
spacing a preset period;
the current time reaches the preset time;
and receiving a resource configuration instruction.
Specifically, the service distribution information and the resource fragment information of at least one resource node may be collected every interval preset period, the service distribution information and the resource fragment information of at least one resource node may be collected every time a preset time is reached, and the service distribution information and the resource fragment information of at least one resource node may be triggered and collected based on a resource configuration instruction.
Step S302, at least one candidate destination resource node is obtained, and configuration rule information of the at least one candidate destination resource node is obtained.
Specifically, other resource nodes except the source resource node where the target resource to be migrated is located may be used as candidate target resource nodes, and the candidate target resource nodes may be determined by screening other resource nodes except the source resource node where the target resource to be migrated is located by using the idle resource specification, and the process of obtaining the candidate target resource nodes will be described in further detail below.
The configuration rule information comprises at least one of business attribute affinity configuration information and resource specification affinity configuration information.
Specifically, the service attribute affinity configuration information may be that the resource node may receive a target resource that is affinitive to a service attribute of an existing resource, i.e. the service attribute of the existing resource in the resource node must be affinitive to the target service attribute of the target resource.
Wherein affinity refers to compatibility between different business attributes or compatibility between different resource specifications; anti-affinity refers to incompatibility between different business specifications or incompatibility between different resource specifications. Specifically, the resource specification affinity configuration information may be a target resource for which the resource node may receive a target resource specification that is compatible with the current idle resource specification.
Step S303, if the configuration rule information is obtained, screening at least one candidate destination resource node based on the target attribute information and the configuration rule information to obtain the destination resource node.
Specifically, if the service attribute affinity configuration information is set, determining target attribute information of the target resource, and screening at least one candidate target resource node according to the service attribute affinity configuration information and the target attribute information to obtain the target resource node.
If the resource specification affinity configuration information is set, determining a target resource specification of the target resource, and screening at least one candidate target resource node according to the target resource specification and the resource specification affinity configuration information to obtain the target resource node.
The screening process, specifically for candidate destination resource nodes, is described in further detail below.
Step S304, the target resource is distributed to the target resource node.
In some possible embodiments, at least one determined destination resource node may exist, and if the number of destination resource nodes is greater than one, one destination resource node may be selected, and the destination resource may be allocated to the destination resource node.
In other possible embodiments, the fragmentation rates between the destination resource nodes may also be compared, and the destination resource may be allocated to the destination resource node with a lower fragmentation rate.
In the above embodiment, when there is resource migration between at least one resource node, at least one candidate destination resource node is screened by using the service attribute affinity configuration information and the resource specification affinity configuration information to obtain the destination resource node, and the destination resource is allocated to the destination resource node, so that intervention of a resource side and a service side is not required, communication cost can be effectively reduced, and defragmentation efficiency is improved.
The process of acquiring at least one candidate destination resource node will be further described in connection with embodiments below.
In some possible embodiments, step S302 of obtaining at least one candidate destination resource node may include:
(1) Acquiring at least one idle resource node;
(2) Respectively determining idle resource specifications in idle resource nodes;
(3) And taking the idle resource node with the idle resource specification not smaller than the target resource specification as a candidate target resource node.
In the specific implementation process, the candidate destination resource node needs to be provided with the idle resource specification to receive the target resource, so that the idle resource specification in each idle resource node can be determined first, preliminary screening is performed according to the idle resource specification, and the candidate destination resource node is determined.
The above embodiment describes a process of obtaining candidate destination resource nodes, and a specific process of determining destination resource nodes according to configuration rule information and target service attribute screening will be further described in connection with the embodiment.
In some possible embodiments, candidate destination resource nodes may be screened according to service attributes to obtain destination resource nodes.
Specifically, the target attribute information includes a target service attribute, and the configuration rule information includes service attribute affinity configuration information;
step S303 filters at least one candidate destination resource node based on the target attribute information and the configuration rule information, to obtain a destination resource node, which may include:
(1) Determining the operation business attribute of the existing resources in each candidate destination resource node;
(2) And determining the destination resource node based on the candidate destination resource node with which the operation service attribute is compatible with the target service attribute.
Specifically, if the candidate destination resource node has a resource, the operation service attribute of the existing resource can be determined, whether the operation service attribute of the existing resource is compatible with the target service attribute is judged, and if the operation service attribute of the existing resource is compatible with the target service attribute, the candidate destination resource node can be used as the destination resource node; if the running service attribute of the existing resource is anti-affinitive to the target service attribute, the candidate target resource node cannot be used as the target resource node.
For example, an IO type (Input/Output) service and a CPU intensive service are complementary, and the two services can be configured with an affinity attribute when being distributed to nodes, and the same type of service can be configured with an anti-affinity policy due to the competition of bottleneck resources.
In some possible embodiments, candidate destination resource nodes may be screened according to the resource specification to obtain destination resource nodes.
Specifically, the target attribute information includes a target resource specification, and the configuration rule information includes a target resource specification;
step S303 filters at least one candidate destination resource node based on the target attribute information and the configuration rule information, to obtain a destination resource node, which may include:
(1) Determining idle resource specifications of each candidate destination resource node;
(2) And taking the candidate target resource node with the affinity of the idle resource specification and the target resource specification as the target resource node.
Specifically, whether the idle resource specification of each candidate destination resource node is compatible with the target resource specification can be judged; if the idle resource specification of the candidate destination resource node is compatible with the target resource specification, the candidate destination resource node can be used as the destination resource node; if the idle resource specification of the candidate destination resource node is anti-compatible with the target resource specification, the candidate destination resource node cannot be used as the destination resource node.
For example, an idle 90core (core) has been set to have affinity to a 40core specification resource, and if the idle resource specification of the candidate destination resource node is 90 cores, the candidate destination resource node may be used as the target resource node.
In some possible embodiments, candidate destination resource nodes may be screened in combination with service attributes and resource specifications to obtain destination resource nodes.
Specifically, the target attribute information further includes a target resource specification, and the configuration rule information further includes a target resource specification;
determining a destination resource node based on candidate destination resource nodes for which the operational service attributes are affinitive to the target service attributes, comprising:
the candidate destination resource node with the operation service attribute being compatible with the target service attribute is used as a first resource node;
determining the idle resource specification of each first resource node;
and taking the first resource node with the affinity of the idle resource specification and the target resource specification as a target resource node.
Specifically, whether the operation service attribute of the existing resource is compatible with the target service attribute can be judged first, and if the operation service attribute of the existing resource is reversely compatible with the target service attribute, the candidate target resource node cannot be used as the target resource node; if the running service attribute of the existing resource is compatible with the target service attribute, the running service attribute of the existing resource can be used as a first resource node; further judging whether the idle resource specification is compatible with the target resource specification; if the idle resource specification of the first resource node is compatible with the target resource specification, the first resource node can be used as the target resource node; if the idle resource specification of the first resource node is anti-compatible with the target resource specification, the first resource node cannot be used as the target resource node.
In some possible embodiments, it may also be determined whether the idle resource specification of the candidate destination resource node is compatible with the target resource specification, and further determine whether the operation service attribute of the existing resource is compatible with the target service attribute, so as to screen out the destination resource node.
Determining a destination resource node based on candidate destination resource nodes for which the operational service attributes are affinitive to the target service attributes, comprising:
the candidate target resource node with the compatible idle resource specification and the target resource specification is used as a second resource node;
determining the operation service attribute of each second resource node;
and taking the second resource node with the affinity of the operation service attribute and the target service attribute as a target resource node.
Specifically, whether the idle resource specification is compatible with the target resource specification can be judged first; if the idle resource specification of the candidate destination resource node is compatible with the target resource specification, the candidate destination resource node can be used as a second resource node; if the idle resource specification of the candidate destination resource node is reversely compatible with the target resource specification, the candidate destination resource node cannot be used as a second resource node; further judging whether the operation business attribute of the existing resource is compatible with the target business attribute, if the operation business attribute of the existing resource is reversely compatible with the target business attribute, the second resource node cannot be used as a target resource node; if the running service attribute of the existing resource is compatible with the target service attribute, the running service attribute of the existing resource can be used as a target resource node.
In some possible embodiments, the method further comprises:
if the configuration rule information is not obtained, determining the resource fragment rate of each candidate destination resource node;
and taking the candidate destination resource node with the resource fragment rate lower than the preset threshold value as the destination resource node.
Specifically, if the configuration rule information is not set, the candidate destination resource node with lower resource fragment rate is preferentially selected as the destination resource node.
In some possible embodiments, the method further comprises:
and updating the configuration rule information of the at least one resource node based on the service distribution information and the resource fragment information of the current at least one resource node.
Specifically, configuration rule information can be dynamically adjusted, each resource node is provided with a monitoring agent which is responsible for statistics of resource fragment information and operation service specifications, resource configuration equipment is used for preferentially rescheduling small-specification services according to a centralized area criterion of scheduling fragment resources to the resource specifications by summarizing the collected service distribution information and the resource fragment information, and rescheduling small-specification services to be scattered and scheduled again to finish filling the fragment small-specification resources, so that currently used resources are released, and the resources are combined with single residual resources to form centralized interval specification resources, thereby facilitating resource re-digestion.
In the specific implementation process, the process of dynamically adjusting the configuration rule information can occur before or after resource migration, the time for adjusting the configuration rule information is not limited, and the configuration rule information can be adjusted based on instruction triggering.
In the implementation, the configuration rule information of at least one resource node is planned and adjusted in real time, so that the resource configuration can be carried out by combining the configuration rule information in the next resource migration, the availability of the resource can be effectively improved, and the cost is reduced.
In order to more clearly illustrate the resource allocation method of the present application, the resource allocation method of the present application will be described below in terms of the overall architecture of the resource allocation.
As shown in fig. 4, the resource configuration architecture is divided into resource configuration devices (i.e., cluster policy centers as shown in the figure) and allocation and run phases of resources.
Resource allocation device, i.e. cluster policy center: the policy for storing allocation configuration rule information, namely cluster policy and calculation running state policy, mainly refers to the policy for resource allocation and running stage configuration. The strategy in the allocation stage is mainly configured in a static mode, the strategy in the running state is generated in a dynamic mode, and the scheduler completes the arrangement of fragments according to the configuration provided by the strategy center, so that the boxing rate of the clusters is improved.
The distribution stage: the allocation stage is a container allocation creation stage of the service, and the allocation strategy is appointed according to the resource attribute and the service attribute of the cluster; the policies related to the resource attributes mainly comprise affinity configuration and anti-affinity configuration of the resources, and the resource specification of the cluster is calculated statistically according to a normal distribution mode, if the distribution interval is shown in the following table:
wherein the header area identifies a larger specification of resource requirements; the specification of the centralized area mark resource is basically concentrated in the area, and the fragment resource of the resource falls in the area and is easy to consume; the long tail region marks the resource requirement of small specification, the resource digestion amount of the section is small, and the small-specification business is required to be subjected to adaptive digestion.
According to the application, the residual resources after segmentation are kept in the concentrated section as much as possible, and the large-size resources of the head section are concentrated on a single machine, so that the residual resources are concentrated in the long tail section and are not easy to digest, and therefore, the large-size resources of the head are scattered on each device preferentially. From the standpoint of affinity and anti-affinity, the specification of the header and the stand-alone are idle, only a stand-alone with a small specification is affinity, but anti-affinity with the node where the header specification has been created; the resource affinity of the concentrated region specification and the concentrated region, the resource affinity of the small specification resource and the head region and the long tail region, and the resource anti-affinity of the concentrated region. The affinity and anti-affinity of the services are mainly related to the service attributes, and firstly, there is a difference between resource bottleneck points among the services, and complementation may also exist, for example, IO type services and CPU intensive services are more complemental, the affinity attribute can be configured when the two services are distributed at the node, and the anti-affinity strategy can be configured for the same type of services due to the competition of bottleneck resources.
And (3) operating state: the running state is mainly that configuration rule information and fragment adjustment strategies are dynamically generated, and the fragment adjustment strategies are sent to a scheduler through a cluster strategy center to carry out fine adjustment. The generation of the dynamic strategy mainly depends on the monitoring of resource fragments and the distribution information of node service specifications to judge, each resource node is provided with a monitoring agent which is responsible for the statistics of the resource fragments and operation service specifications, and a strategy center of the cluster is used for preferentially rescheduling and adjusting small-specification services according to the centralized area criterion of scheduling the fragment resources to the resource specifications by summarizing the collected single-machine node information, and rescheduling and scheduling the small-specification services to finish filling the fragment small-specification resources, releasing the currently used resources and combining the current used resources and the single-machine residual resources into centralized interval specification resources, thereby facilitating the re-digestion of the resources. After the small-size service is adjusted, the policy dispatching center also carries out dynamic dispatching policies aiming at the large-size service, so that the purpose is to keep the distribution of fragmented resources in a centralized interval, the large-size dispatching policies are distributed on each node preferentially, if the large-size service exists in each node, the large-size dispatching is linked when the small-size service is dispatched, and the affinity combination of the small-size service and the large-size service is adopted to finish the boxing of the resources, so that the fragmented resources are reduced.
In order to more clearly illustrate the resource allocation method of the present application, the resource allocation method of the present application will be further described with reference to examples.
As shown in fig. 5, in one example, the resource allocation method of the present application may include the steps of:
collecting service distribution information and resource fragment information of at least one resource node;
judging whether the service distribution information on the resource node changes or not, and judging whether the resource fragment information on the resource node changes or not;
if not, returning to collect service distribution information and resource fragment information of at least one resource node;
if any one of the service distribution information or the resource fragment information is changed, a dynamic scheduling strategy is constructed;
judging whether service attribute affinity configuration information is set;
if not, directly judging whether the resource specification affinity configuration information is set;
if yes, screening candidate target resource nodes according to service attributes preferentially, and further judging whether resource specification affinity configuration information is set;
if yes, screening candidate target resource nodes according to the resource specification preferentially;
if not, determining the resource fragment rate of each candidate destination resource node; the method comprises the steps of carrying out a first treatment on the surface of the
And taking the candidate destination resource node with the resource fragment rate lower than the preset threshold value as the destination resource node.
According to the resource allocation method, when the resource migration exists between at least one resource node, the at least one candidate target resource node is screened through the service attribute affinity configuration information and the resource specification affinity configuration information to obtain the target resource node, the target resource is allocated to the target resource node, the intervention of a resource side and a service side is not needed, the communication cost can be effectively reduced, and the defragmentation efficiency is improved.
Furthermore, the configuration rule information of at least one resource node is planned and adjusted in real time, so that the resource configuration can be carried out by combining the configuration rule information in the next resource migration, the availability of the resource can be effectively improved, and the cost is reduced.
Fig. 6 is a schematic structural diagram of a resource allocation device according to an embodiment of the present application. As shown in fig. 6, the apparatus includes:
the detection module 601 is configured to determine target attribute information of a target resource to be migrated if it is detected that there is resource migration between at least one resource node; wherein the target attribute information includes at least one of a target business attribute and a target resource specification;
An obtaining module 602, configured to obtain at least one candidate destination resource node, and obtain configuration rule information of the at least one candidate destination resource node; the configuration rule information comprises at least one of business attribute affinity configuration information and resource specification affinity configuration information;
a screening module 603, configured to screen at least one candidate destination resource node based on the target attribute information and the configuration rule information if the configuration rule information is obtained, so as to obtain a destination resource node;
an allocation module 604 is configured to allocate the target resource to the target resource node.
In one possible implementation manner, the device further comprises an acquisition module, configured to:
collecting service distribution information and resource fragment information of at least one resource node;
and if the service distribution information or the resource fragment information of any resource node is detected to change, judging that the resource migration exists between at least one resource node.
In one possible implementation manner, the acquisition module acquires service distribution information and resource fragment information of at least one resource node, and triggers based on at least one of the following conditions:
spacing a preset period;
the current time reaches the preset time;
and receiving a resource configuration instruction.
In one possible implementation, the obtaining module 602 is specifically configured to, when obtaining at least one candidate destination resource node:
acquiring at least one idle resource node;
respectively determining idle resource specifications in idle resource nodes;
and taking the idle resource node with the idle resource specification not smaller than the target resource specification as a candidate target resource node.
In one possible implementation, the target attribute information includes a target service attribute, and the configuration rule information includes service attribute affinity configuration information;
the screening module 603 is specifically configured to, when screening at least one candidate destination resource node based on the target attribute information and the configuration rule information to obtain a destination resource node:
determining the operation business attribute of the existing resources in each candidate destination resource node;
and determining the destination resource node based on the candidate destination resource node with which the operation service attribute is compatible with the target service attribute.
In one possible implementation, the target attribute information further includes a target resource specification, and the configuration rule information further includes a target resource specification;
the filtering module 603 is specifically configured to, when determining the destination resource node based on the candidate destination resource node with which the running service attribute is compatible with the target service attribute:
The candidate destination resource node with the operation service attribute being compatible with the target service attribute is used as a first resource node;
determining the idle resource specification of each first resource node;
and taking the first resource node with the affinity of the idle resource specification and the target resource specification as a target resource node.
In one possible implementation manner, the method further includes a determining module, configured to:
if the configuration rule information is not obtained, determining the resource fragment rate of each candidate destination resource node;
and taking the candidate destination resource node with the resource fragment rate lower than the preset threshold value as the destination resource node.
In one possible implementation, the method further includes an update module configured to:
and updating the configuration rule information of the at least one resource node based on the service distribution information and the resource fragment information of the current at least one resource node.
According to the resource allocation device, when the resource migration exists between at least one resource node, the at least one candidate target resource node is screened through the service attribute affinity configuration information and the resource specification affinity configuration information to obtain the target resource node, the target resource is allocated to the target resource node, the intervention of a resource side and a service side is not needed, the communication cost can be effectively reduced, and the defragmentation efficiency is improved.
Furthermore, the configuration rule information of at least one resource node is planned and adjusted in real time, so that the resource configuration can be carried out by combining the configuration rule information in the next resource migration, the availability of the resource can be effectively improved, and the cost is reduced.
The resource allocation device of this embodiment may execute the resource allocation method shown in the foregoing embodiment of the present application, and its implementation principle is similar, and will not be described herein.
Fig. 7 is a schematic structural diagram of a computer device according to an embodiment of the present application. As shown in fig. 7, the computer device includes: a memory and a processor; at least one program stored in the memory for execution by the processor, which, when executed by the processor, performs:
when resource migration exists between at least one resource node, at least one candidate target resource node is screened through service attribute affinity configuration information and resource specification affinity configuration information to obtain a target resource node, and target resources are distributed to the target resource node without intervention of a resource side and a service side, so that communication cost can be effectively reduced, and defragmentation efficiency is improved.
Furthermore, the configuration rule information of at least one resource node is planned and adjusted in real time, so that the resource configuration can be carried out by combining the configuration rule information in the next resource migration, the availability of the resource can be effectively improved, and the cost is reduced.
In an alternative embodiment, a computer device is provided, as shown in fig. 7, the computer device 700 shown in fig. 7 comprising: a processor 701 and a memory 703. The processor 701 is coupled to a memory 703, such as via a bus 702. Optionally, the computer device 700 may further comprise a transceiver 704, the transceiver 704 may be used for data interaction between the computer device and other computer devices, such as transmission of data and/or reception of data, etc. It should be noted that, in practical applications, the transceiver 704 is not limited to one, and the structure of the computer device 700 is not limited to the embodiment of the present application.
The processor 701 may be a CPU (Central Processing Unit ), general purpose processor, DSP (Digital Signal Processor, data signal processor), ASIC (Application Specific Integrated Circuit ), FPGA (Field Programmable Gate Array, field programmable gate array) or other programmable logic device, transistor logic device, hardware components, or any combination thereof. Which may implement or perform the various exemplary logic blocks, modules and circuits described in connection with this disclosure. The processor 701 may also be a combination that performs computing functions, such as including one or more microprocessors, a combination of a DSP and a microprocessor, or the like.
Bus 702 may include a path to transfer information between the components. Bus 702 may be a PCI (Peripheral Component Interconnect, peripheral component interconnect labeling) bus, or an EISA (Extended Industry Standard Architecture, extended industry labeling architecture) bus, among others. Bus 702 may be divided into an address bus, a data bus, a control bus, and the like. For ease of illustration, only one thick line is shown in fig. 7, but not only one bus or one type of bus.
The Memory 703 may be, but is not limited to, ROM (Read Only Memory) or other type of static storage device that can store static information and instructions, RAM (Random Access Memory ) or other type of dynamic storage device that can store information and instructions, EEPROM (Electrically Erasable Programmable Read Only Memory ), CD-ROM (Compact Disc Read Only Memory, compact disc Read Only Memory) or other optical disk storage, optical disk storage (including compact discs, laser discs, optical discs, digital versatile discs, blu-ray discs, etc.), magnetic disk storage media or other magnetic storage devices, or any other medium that can be used to carry or store desired program code in the form of instructions or data structures and that can be accessed by a computer.
The memory 703 is used for storing application program codes (computer programs) for executing the inventive arrangements and is controlled to be executed by the processor 701. The processor 701 is configured to execute application code stored in the memory 703 to implement what is shown in the foregoing method embodiments.
Wherein the computer device includes, but is not limited to: virtualized computer devices, virtual machines, servers, service clusters, user terminals, and the like.
Embodiments of the present application provide a computer-readable storage medium having a computer program stored thereon, which when run on a computer, enables the computer to perform the respective content of the resource allocation method in the foregoing method embodiments.
Embodiments of the present application provide a computer program product or computer program comprising computer instructions stored in a computer readable storage medium. The processor of the computer device reads the computer instructions from the computer-readable storage medium, and the processor executes the computer instructions, so that the computer device performs the above-described resource allocation method.
It should be understood that, although the steps in the flowcharts of the figures are shown in order as indicated by the arrows, these steps are not necessarily performed in order as indicated by the arrows. The steps are not strictly limited in order and may be performed in other orders, unless explicitly stated herein. Moreover, at least some of the steps in the flowcharts of the figures may include a plurality of sub-steps or stages that are not necessarily performed at the same time, but may be performed at different times, the order of their execution not necessarily being sequential, but may be performed in turn or alternately with other steps or at least a portion of the other steps or stages.
It should be noted that the computer readable medium described in the present disclosure may be a computer readable signal medium or a computer readable storage medium, or any combination of the two. The computer readable storage medium can be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or a combination of any of the foregoing. More specific examples of the computer-readable storage medium may include, but are not limited to: an electrical connection having one or more wires, a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In the context of this disclosure, a computer-readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device. In the present disclosure, however, the computer-readable signal medium may include a data signal propagated in baseband or as part of a carrier wave, with the computer-readable program code embodied therein. Such a propagated data signal may take any of a variety of forms, including, but not limited to, electro-magnetic, optical, or any suitable combination of the foregoing. A computer readable signal medium may also be any computer readable medium that is not a computer readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device. Program code embodied on a computer readable medium may be transmitted using any appropriate medium, including but not limited to: electrical wires, fiber optic cables, RF (radio frequency), and the like, or any suitable combination of the foregoing.
The computer readable medium may be contained in the electronic device; or may exist alone without being incorporated into the electronic device.
The computer-readable medium carries one or more programs which, when executed by the electronic device, cause the electronic device to perform the methods shown in the above-described embodiments.
Computer program code for carrying out operations of the present disclosure may be written in one or more programming languages, including an object oriented programming language such as Java, smalltalk, C ++ and conventional procedural programming languages, such as the "C" programming language or similar programming languages. The program code may execute entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer or entirely on the remote computer or server. In the case of a remote computer, the remote computer may be connected to the user's computer through any kind of network, including a Local Area Network (LAN) or a Wide Area Network (WAN), or may be connected to an external computer (for example, through the Internet using an Internet service provider).
The flowcharts and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present disclosure. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
The modules described in the embodiments of the present disclosure may be implemented in software or hardware. The name of a module is not limited to the module itself in some cases, and for example, the acquisition module may also be described as "a module for acquiring candidate destination resource nodes".
The foregoing description is only of the preferred embodiments of the present disclosure and description of the principles of the technology being employed. It will be appreciated by persons skilled in the art that the scope of the disclosure referred to in this disclosure is not limited to the specific combinations of features described above, but also covers other embodiments which may be formed by any combination of features described above or equivalents thereof without departing from the spirit of the disclosure. Such as those described above, are mutually substituted with the technical features having similar functions disclosed in the present disclosure (but not limited thereto).

Claims (12)

1. A method of resource allocation, the method comprising:
if the existence of resource migration between at least one resource node is detected, determining target attribute information of the target resource to be migrated; wherein the target attribute information comprises at least one of a target business attribute and a target resource specification;
acquiring at least one candidate destination resource node and acquiring configuration rule information of the at least one candidate destination resource node; the configuration rule information comprises at least one of business attribute affinity configuration information and resource specification affinity configuration information;
If the configuration rule information is obtained, screening the at least one candidate target resource node based on the target attribute information and the configuration rule information to obtain a target resource node;
and distributing the target resource to the target resource node.
2. The method for configuring resources according to claim 1, wherein before detecting that there is a resource migration between at least one resource node, further comprising:
collecting service distribution information and resource fragment information of at least one resource node;
and if the service distribution information or the resource fragment information of any resource node is detected to change, judging that the resource migration exists between the at least one resource node.
3. The resource allocation method according to claim 2, wherein the collecting of traffic distribution information and resource fragmentation information of at least one resource node is triggered based on at least one of the following conditions:
spacing a preset period;
the current time reaches the preset time;
and receiving a resource configuration instruction.
4. The method for resource allocation according to claim 1, wherein said obtaining at least one candidate destination resource node comprises:
Acquiring at least one idle resource node;
respectively determining idle resource specifications in idle resource nodes;
and taking the idle resource node with the idle resource specification not smaller than the target resource specification as the candidate target resource node.
5. The resource allocation method according to claim 1, wherein the target attribute information includes a target service attribute, and the allocation rule information includes service attribute affinity allocation information;
the screening the at least one candidate destination resource node based on the target attribute information and the configuration rule information to obtain a destination resource node includes:
determining the operation business attribute of the existing resources in each candidate destination resource node;
and determining the destination resource node based on the candidate destination resource node with which the operation service attribute is compatible with the target service attribute.
6. The resource allocation method according to claim 5, wherein the target attribute information further includes a target resource specification, and the allocation rule information further includes a target resource specification;
the determining the destination resource node based on the candidate destination resource node with which the operation service attribute is compatible with the target service attribute comprises the following steps:
Taking the candidate destination resource node with the operation service attribute compatible with the target service attribute as a first resource node;
determining the idle resource specification of each first resource node;
and taking the first resource node with the idle resource specification being compatible with the target resource specification as the target resource node.
7. The resource allocation method according to claim 1, further comprising:
if the configuration rule information is not obtained, determining the resource fragment rate of each candidate destination resource node;
and taking the candidate target resource node with the resource fragment rate lower than the preset threshold value as the target resource node.
8. The resource allocation method according to claim 2, further comprising:
and updating the configuration rule information of the at least one resource node based on the service distribution information and the resource fragment information of the current at least one resource node.
9. A resource allocation apparatus, the apparatus comprising:
the detection module is used for determining target attribute information of the target resource to be migrated if the resource migration exists between at least one resource node; wherein the target attribute information comprises at least one of a target business attribute and a target resource specification;
The acquisition module is used for acquiring at least one candidate destination resource node and acquiring configuration rule information of the at least one candidate destination resource node; the configuration rule information comprises at least one of business attribute affinity configuration information and resource specification affinity configuration information;
the screening module is used for screening the at least one candidate destination resource node based on the target attribute information and the configuration rule information if the configuration rule information is acquired, so as to obtain a destination resource node;
and the allocation module is used for allocating the target resource to the target resource node.
10. A computer device comprising a memory, a processor and a computer program stored on the memory, characterized in that the processor executes the computer program to implement the resource allocation method of any of claims 1 to 8.
11. A computer readable storage medium having stored thereon a computer program, wherein the computer program when executed by a processor implements the resource allocation method of any of claims 1 to 8.
12. A computer program product comprising a computer program, characterized in that the computer program, when executed by a processor, implements the resource allocation method of any of claims 1 to 8.
CN202210295216.XA 2022-03-23 2022-03-23 Resource allocation method, apparatus, computer device, storage medium and program product Pending CN116841720A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202210295216.XA CN116841720A (en) 2022-03-23 2022-03-23 Resource allocation method, apparatus, computer device, storage medium and program product

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202210295216.XA CN116841720A (en) 2022-03-23 2022-03-23 Resource allocation method, apparatus, computer device, storage medium and program product

Publications (1)

Publication Number Publication Date
CN116841720A true CN116841720A (en) 2023-10-03

Family

ID=88160442

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202210295216.XA Pending CN116841720A (en) 2022-03-23 2022-03-23 Resource allocation method, apparatus, computer device, storage medium and program product

Country Status (1)

Country Link
CN (1) CN116841720A (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN117331678A (en) * 2023-12-01 2024-01-02 之江实验室 Heterogeneous computing power federation-oriented multi-cluster job resource specification computing method and system

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN117331678A (en) * 2023-12-01 2024-01-02 之江实验室 Heterogeneous computing power federation-oriented multi-cluster job resource specification computing method and system
CN117331678B (en) * 2023-12-01 2024-04-19 之江实验室 Heterogeneous computing power federation-oriented multi-cluster job resource specification computing method and system

Similar Documents

Publication Publication Date Title
US12045652B2 (en) Technologies for batching requests in an edge infrastructure
US10003500B2 (en) Systems and methods for resource sharing between two resource allocation systems
CN106933669B (en) Apparatus and method for data processing
CN113641457A (en) Container creation method, device, apparatus, medium, and program product
CN112130963A (en) Virtual machine task scheduling method and device, computer equipment and storage medium
CN112905342B (en) Resource scheduling method, device, equipment and computer readable storage medium
CN102981973B (en) Perform the method for request within the storage system
CN112714164A (en) Internet of things system and task scheduling method thereof
US20230136612A1 (en) Optimizing concurrent execution using networked processing units
CN115033340A (en) Host selection method and related device
CN116800616B (en) Management method and related device of virtualized network equipment
CN104580194A (en) Virtual resource management method and device oriented to video applications
CN112600761A (en) Resource allocation method, device and storage medium
US9594596B2 (en) Dynamically tuning server placement
CN114301980A (en) Method, device and system for scheduling container cluster and computer readable medium
CN116841720A (en) Resource allocation method, apparatus, computer device, storage medium and program product
CN105653347B (en) A kind of server, method for managing resource and virtual machine manager
CN116456496B (en) Resource scheduling method, storage medium and electronic equipment
CN113301087B (en) Resource scheduling method, device, computing equipment and medium
CN116795492A (en) Resource scheduling method, device and equipment of cloud platform and readable storage medium
CN111694670A (en) Resource allocation method, device, equipment and computer readable medium
US9628401B2 (en) Software product instance placement
CN116032614A (en) Container network micro-isolation method, device, equipment and medium
WO2022240590A1 (en) Application-centric design for 5g and edge computing applications
CN114942833A (en) Method and related device for dynamically scheduling timing task resources

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