CN117056055A - Resource scheduling method and device, electronic equipment and storage medium - Google Patents
Resource scheduling method and device, electronic equipment and storage medium Download PDFInfo
- Publication number
- CN117056055A CN117056055A CN202311177803.XA CN202311177803A CN117056055A CN 117056055 A CN117056055 A CN 117056055A CN 202311177803 A CN202311177803 A CN 202311177803A CN 117056055 A CN117056055 A CN 117056055A
- Authority
- CN
- China
- Prior art keywords
- tenant
- resource
- application program
- time interval
- current
- 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
Links
- 238000000034 method Methods 0.000 title claims abstract description 56
- 238000012163 sequencing technique Methods 0.000 claims abstract description 9
- 238000010586 diagram Methods 0.000 claims description 59
- 239000008280 blood Substances 0.000 claims description 34
- 210000004369 blood Anatomy 0.000 claims description 34
- 238000004590 computer program Methods 0.000 claims description 16
- 238000013468 resource allocation Methods 0.000 claims description 16
- 238000004364 calculation method Methods 0.000 description 10
- 238000004891 communication Methods 0.000 description 8
- 230000008569 process Effects 0.000 description 5
- 230000001419 dependent effect Effects 0.000 description 4
- 238000007726 management method Methods 0.000 description 3
- 230000003287 optical effect Effects 0.000 description 3
- 230000006870 function Effects 0.000 description 2
- 230000003993 interaction Effects 0.000 description 2
- 238000003491 array Methods 0.000 description 1
- 238000013473 artificial intelligence Methods 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000001413 cellular effect Effects 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 238000013523 data management Methods 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 230000003111 delayed effect Effects 0.000 description 1
- 239000011521 glass Substances 0.000 description 1
- 230000010354 integration Effects 0.000 description 1
- 239000004973 liquid crystal related substance Substances 0.000 description 1
- 238000010801 machine learning Methods 0.000 description 1
- 239000013307 optical fiber Substances 0.000 description 1
- 229920006395 saturated elastomer Polymers 0.000 description 1
- 239000004065 semiconductor Substances 0.000 description 1
- 230000001953 sensory effect Effects 0.000 description 1
- 230000000007 visual effect Effects 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements 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/46—Multiprogramming arrangements
- G06F9/48—Program initiating; Program switching, e.g. by interrupt
- G06F9/4806—Task transfer initiation or dispatching
- G06F9/4843—Task transfer initiation or dispatching by program, e.g. task dispatcher, supervisor, operating system
- G06F9/4881—Scheduling strategies for dispatcher, e.g. round robin, multi-level priority queues
-
- Y—GENERAL 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
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE 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/00—Energy 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)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The embodiment of the invention discloses a resource scheduling method, a device, electronic equipment and a storage medium, which comprise the following steps: acquiring resource consumption data of a tenant application program; determining the resource overhead peak time interval of each tenant according to the resource consumption data; sequencing the termination time points of the resource overhead peak time intervals of the tenants to obtain a tenant resource consumption sequence queue; and distributing resources to the tenant application programs according to the tenant resource consumption sequence queue. The technical scheme of the embodiment of the invention can reasonably allocate resources to each tenant application program and improve the utilization rate of the resources, thereby guaranteeing the continuity and stability of the operation of the tenant application program.
Description
Technical Field
The embodiment of the invention relates to the technical field of resource management, in particular to a resource scheduling method, a device, electronic equipment and a storage medium.
Background
Currently, when most enterprise-level data center stations schedule resources, a data center station administrator sets a resource queue quota for each tenant, and each tenant is set to run computing tasks only in its own resource queue. The resource queue quota comprises the minimum resource quantity and the maximum resource quantity required by the tenant and the weight for acquiring resource allocation by each tenant queue. Further, the tenant applies for resources to the resource scheduling platform, and the resource scheduling platform firstly meets the minimum resource quantity set for the tenant on the premise of determining that residual resources exist. When the resources applied by the tenants exceed the minimum number of resources and the residual resources still exist, the resource scheduling platform allocates the needed resources for the tenants according to the allocation weights, the resources are more easily acquired when the weights are larger, and the resources are more difficult to acquire when the weights are smaller. When the application program submitted by the tenant is operated, the resource scheduling platform recovers the resources and allocates the resources to the tenant queue which still submits the application program and has not been allocated with the resources up to the set maximum resources.
Under the condition of higher overall load of the cluster, the use amount of the resource queue of each tenant tends to be saturated, in order to ensure that each tenant has a chance to acquire resources, a resource scheduling platform allocates resources for the tenant in a tenant preemption mode, so that the problem that service operation is discontinuous, even enough resources cannot be acquired, and operation fails is caused by the fact that tenant application programs cannot continuously acquire the resources. Therefore, in order to solve the technical problem, in the prior art, according to the service importance of each tenant, different weights are set for each tenant, and the tenant queue with high weight is easier to acquire resources. Higher weight is allocated to important business, so that sufficient resources are easier to obtain in the running process of the business. Secondly, automatically adjusting tenant sub-element queues according to a time plan, dividing peaks of running application programs of all tenants according to time periods, setting a resource adjustment plan with fixed time points, automatically adjusting resources of all tenant queues, distributing more resources for tenants consuming the peak time periods of the resources, and distributing less resources for tenants consuming the valley time periods of the resources.
In the process of realizing the invention, the inventor discovers that the problem of unreasonable resource allocation caused by difficult determination of the allocation weight of the resources of the tenants in the data exists in the prior art. Secondly, in the case of a change in the peak period of resource consumption due to external reasons, etc., it is difficult to ensure continuous and stable running of the application by each tenant.
Disclosure of Invention
The embodiment of the invention provides a resource scheduling method, a device, electronic equipment and a storage medium, which can realize reasonable resource allocation to each tenant application program and improve the resource utilization rate, thereby guaranteeing the continuity and stability of the operation of the tenant application program.
According to an aspect of the present invention, there is provided a resource scheduling method, including:
acquiring resource consumption data of a tenant application program;
determining the resource overhead peak time interval of each tenant according to the resource consumption data;
sequencing the termination time points of the resource overhead peak time intervals of the tenants to obtain a tenant resource consumption sequence queue;
and distributing resources to the tenant application programs according to the tenant resource consumption sequence queue.
According to another aspect of the present invention, there is provided a resource scheduling apparatus including:
the resource consumption data acquisition module is used for acquiring the resource consumption data of the tenant application program;
the resource overhead peak time interval determining module is used for determining the resource overhead peak time interval of each tenant according to the resource consumption data;
the tenant resource consumption sequence queue acquisition module is used for sequencing the termination time points of the resource overhead peak time intervals of each tenant to obtain a tenant resource consumption sequence queue;
And the tenant application program resource allocation module is used for allocating resources for each tenant application program according to the tenant resource consumption sequence queue.
According to another aspect of the present invention, there is provided an electronic apparatus including:
at least one processor; and
a memory communicatively coupled to the at least one processor; wherein,
the memory stores a computer program executable by the at least one processor to enable the at least one processor to perform the resource scheduling method of any one of the embodiments of the present invention.
According to another aspect of the present invention, there is provided a computer readable storage medium storing computer instructions for causing a processor to execute a resource scheduling method according to any embodiment of the present invention.
According to the technical scheme, the resource expense peak time interval of each tenant is determined according to the acquired resource expense data of the tenant application program, so that the termination time point of the resource expense peak time interval of each tenant is analyzed, and the tenant resource expense sequence queue is obtained. After the tenant resource consumption sequence queue is obtained, resources are allocated to each tenant application program according to the tenant resource consumption sequence queue, so that the problem of unreasonable allocation of tenant application program resources in the prior art is solved, reasonable allocation of resources to each tenant application program can be realized, the resource utilization rate is improved, and the continuity and stability of operation of the tenant application program are ensured.
It should be understood that the description in this section is not intended to identify key or critical features of the embodiments of the invention or to delineate the scope of the invention. Other features of the present invention will become apparent from the description that follows.
Drawings
In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the drawings required for the description of the embodiments will be briefly described below, and it is apparent that the drawings in the following description are only some embodiments of the present invention, and other drawings may be obtained according to these drawings without inventive effort for a person skilled in the art.
Fig. 1 is a flowchart of a resource scheduling method according to a first embodiment of the present invention;
fig. 2 is a flowchart of a resource scheduling method according to a second embodiment of the present invention;
fig. 3 is a schematic diagram of a tenant resource consumption timing diagram according to a second embodiment of the present invention;
FIG. 4 is a schematic diagram of a blood relationship diagram according to a second embodiment of the present invention;
fig. 5 is a schematic diagram of a dynamically adjusted tenant resource queue according to a second embodiment of the present invention;
fig. 6 is a schematic diagram of a dynamically adjusted tenant resource consumption timing diagram according to a second embodiment of the present invention;
FIG. 7 is a flowchart of another resource scheduling method according to the second embodiment of the present invention;
fig. 8 is a schematic diagram of a resource scheduling device structure according to a second embodiment of the present invention;
fig. 9 is a schematic diagram of a resource scheduling device according to a third embodiment of the present invention;
fig. 10 is a schematic structural diagram of an electronic device according to a fourth embodiment of the present invention.
Detailed Description
In order that those skilled in the art will better understand the present invention, a technical solution in the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings in which it is apparent that the described embodiments are only some embodiments of the present invention, not all embodiments. All other embodiments, which can be made by those skilled in the art based on the embodiments of the present invention without making any inventive effort, shall fall within the scope of the present invention.
It should be noted that the terms "first," "second," and the like in the description and the claims of the present invention and the above figures are used for distinguishing between similar objects and not necessarily for describing a particular sequential or chronological order. It is to be understood that the data so used may be interchanged where appropriate such that the embodiments of the invention described herein may be implemented in sequences other than those illustrated or otherwise described herein. Furthermore, the terms "comprises," "comprising," and "having," and any variations thereof, are intended to cover a non-exclusive inclusion, such that a process, method, system, article, or apparatus that comprises a list of steps or elements is not necessarily limited to those steps or elements expressly listed but may include other steps or elements not expressly listed or inherent to such process, method, article, or apparatus.
Example 1
Fig. 1 is a flowchart of a resource scheduling method provided in an embodiment of the present invention, where the embodiment is applicable to a case of dynamically allocating resources to tenant applications according to a tenant resource consumption sequence queue, and the method may be performed by a resource scheduling device, where the device may be implemented by software and/or hardware, and may be generally integrated in an electronic device, where the electronic device may be a terminal device or a server device, and may be used as a data middle station to implement resource scheduling, and the embodiment of the present invention does not limit a specific device type of the electronic device. Accordingly, as shown in fig. 1, the method includes the following operations:
s110, acquiring resource consumption data of the tenant application program.
The tenant application program can be an application program which is deployed in the data center station by the tenant and can only run in the affiliated tenant resource queue. The resource consumption data may be data for analyzing tenant resource overhead peak time intervals, or may be data for analyzing tenant resource overhead valley time intervals.
In the embodiment of the invention, before the resource consumption data of the tenant application program is acquired, a tenant queue can be created in the resource scheduling platform, and a minimum resource value is configured in the tenant queue according to the resource demand of the tenant application. The resource scheduling platform may be a YARN (Yet Another Resource Negotiator, another resource coordinator) for providing uniform resource management and scheduling for the application program, and may be an internal functional module belonging to the data center. Further, the tenant may deploy tenant applications in the data, configure dependencies between applications, and of course, the tenant applications may only run in the tenant resource queue. The data center can be used for realizing resource integration and centralized configuration, and improving the data management efficiency. After the configuration is completed, the scheduling system of the data center station can send an application program execution instruction to the resource scheduling platform, and the resource scheduling platform can respond to the application program execution instruction to allocate resources for the tenant application program. After the allocation of the resources is completed, the resource consumption data of the tenant application program can be obtained from the resource scheduling platform.
Optionally, the types of resources that the data center may allocate for the tenant application may include, but are not limited to, computing resources, network resources, storage resources, and the like.
S120, determining the resource overhead peak time interval of each tenant according to the resource consumption data.
The resource overhead peak time interval may be a time interval in which the amount of resources used by the tenant application is large.
Correspondingly, after the resource consumption data of the tenant application program is obtained according to the steps, the resource consumption data of each tenant can be analyzed, and the resource overhead peak time interval of each tenant is obtained. It should be noted that, by analyzing the resource consumption data of each tenant to obtain the resource overhead peak time interval of each tenant, the problem that the overall delay or advance of the tenant running application program progress is caused by special conditions or uncontrollable reasons in the prior art, the resource allocation of each tenant resource queue is unreasonable according to a fixed time plan can be effectively avoided, and the actual running time of the tenant application program can be more accurately matched,
S130, ordering the termination time points of the resource overhead peak time intervals of the tenants to obtain a tenant resource consumption sequence queue.
The termination time point of the resource overhead peak time interval may be the end time of the tenant resource overhead peak time interval. The tenant resource consumption order queue may be a tenant order queue for allocating resources to a tenant application program by analyzing a resource overhead condition of a tenant.
After obtaining the resource expense peak time interval of each tenant, obtaining the termination time point of the resource expense peak time interval of each tenant according to the resource expense peak time interval of each tenant, and sequencing the termination time points to obtain a tenant resource consumption sequence queue; the termination time point is determined by the resource overhead peak time interval of each tenant. It should be noted that, compared with the generation method of the tenant resource consumption sequence queue according to subjective experience in the prior art, the generation method of the tenant resource consumption sequence queue provided by the embodiment of the invention has objectivity and scientificity.
And S140, distributing resources for each tenant application program according to the tenant resource consumption sequence queue.
In the embodiment of the invention, resources can be allocated to each tenant application program according to the tenant resource consumption sequence queue so as to realize the utilization of limited resources, and the tenants can be intensively supplied in turn, so that the tenants can acquire sufficient resources in turn and the capability of concurrently executing the application programs, and most of the application programs can be intensively and rapidly completed.
According to the technical scheme, the resource expense peak time interval of each tenant is determined according to the acquired resource expense data of the tenant application program, so that the termination time point of the resource expense peak time interval of each tenant is analyzed, and the tenant resource expense sequence queue is obtained. After the tenant resource consumption sequence queue is obtained, resources are allocated to each tenant application program according to the tenant resource consumption sequence queue, so that the problem of unreasonable allocation of tenant application program resources in the prior art is solved, reasonable allocation of resources to each tenant application program can be realized, the resource utilization rate is improved, and the continuity and stability of operation of the tenant application program are ensured.
Example two
Fig. 2 is a flowchart of a resource scheduling method according to a second embodiment of the present invention, where the present embodiment is implemented based on the foregoing embodiment, and in this embodiment, various specific alternative implementations of dynamically adjusting resources allocated to each tenant application and allocated resources are provided. Accordingly, as shown in fig. 2, the method of this embodiment may include:
S210, acquiring resource consumption data of the tenant application program.
In the embodiment of the invention, before the resource consumption data of the tenant application program is acquired, a tenant queue can be created in the resource scheduling platform, and a minimum resource value is configured in the tenant queue according to the resource demand of the tenant application. Further, tenants can deploy tenant applications in the data and configure dependencies between applications. After the configuration is completed, the scheduling system of the data center station can send an application program execution instruction to the resource scheduling platform, and the resource scheduling platform can respond to the application program execution instruction to allocate computing resources for the tenant application program. After the allocation of the resources is completed, the resource consumption data of the tenant application program can be obtained in the resource scheduling platform.
S220, determining the resource overhead peak time interval of each tenant according to the resource consumption data.
S230, ordering the termination time points of the resource overhead peak time intervals of the tenants to obtain a tenant resource consumption sequence queue.
In an optional embodiment of the present invention, the determining, according to the resource consumption data, a resource overhead peak time interval of each tenant may include: generating a resource consumption timing diagram according to the resource consumption data of the application program of the tenant; dividing the resource consumption time sequence diagram into basic time units; determining a unit resource consumption of each tenant application program in each basic time unit; and determining the resource overhead peak time interval of each tenant according to the increment of the unit resource consumption of each tenant application program in each basic time unit.
The resource consumption timing diagram may be a schematic diagram that represents the computing resource consumption of each tenant over a period of time. The base time unit may be a minimum time unit for determining tenant resource consumption. The unit resource consumption may be a consumption of computing resources of the tenant application within a base time unit. The increase in unit resource consumption may be an increase in resource consumption between adjacent base time units.
Correspondingly, a resource consumption time sequence diagram of each tenant can be generated according to the resource consumption data obtained in the steps, and basic time units are divided into the resource consumption time sequence diagram, so that the unit resource consumption of each tenant application program in each basic time unit is obtained. Further, the increment of the unit resource consumption of each tenant application program in each basic time unit can be obtained through calculation, so that the resource overhead peak time interval of each tenant is obtained. Optionally, the basic time units of the resource consumption timing chart may be divided into 10min, 20min or 30min according to actual requirements, and the specific values of the basic time units are not limited in the embodiment of the present invention.
Optionally, a resource consumption timing diagram of each tenant may be generated according to the resource consumption diagram of the tenant, and the basic time unit may be divided for the resource consumption timing diagram. Fig. 3 is a schematic diagram of a tenant resource consumption timing diagram according to a second embodiment of the present invention, in a specific example, as shown in fig. 3, a basic time unit may be 10min, so that a unit resource consumption of each tenant application within 10min may be obtained. Further, the increasing amount of the unit resource consumption of each tenant application program in each basic time unit can be obtained through calculation, so that the resource overhead peak time interval of each tenant can be obtained, for example, the increasing amount of the unit resource consumption of each tenant application program in each basic time unit can be obtained through calculation, so that the resource overhead peak time interval of tenant 1 can be from a time point D to a time point E; the increment of the unit resource consumption of the tenant 2 application program in each basic time unit can be obtained through calculation, and then the resource overhead peak time interval of the tenant 2 can be obtained from a time point 1 to a time point E; the increase of the unit resource consumption of the tenant 3 application program in each basic time unit can be obtained through calculation, and then the resource overhead peak time interval of the tenant 3 can be obtained from a time point 0 to a time point D. It should be noted that, the increasing amount of the unit resource consumption of each tenant application program in each basic time unit can be obtained through calculation, so as to obtain a resource overhead low-valley time interval of each tenant, for example, the increasing amount of the unit resource consumption of the tenant 1 application program in each basic time unit can be obtained through calculation, so that a resource overhead peak time interval of the tenant 1 can be obtained from a time point 0 to a time point C; the increment of the unit resource consumption of the tenant 2 application program in each basic time unit can be obtained through calculation, and then the resource overhead peak time interval of the tenant 2 can be from a time point 0 to a time point C; the increase of the unit resource consumption of the tenant 3 application program in each basic time unit can be obtained through calculation, and then the resource overhead peak time interval of the tenant 3 can be from a time point D to a time point 2.
After determining the resource overhead peak time interval of each tenant, the termination time points of the resource overhead peak time interval of each tenant can be ordered to obtain a tenant resource consumption sequence queue.
S240, determining the current residual resources.
The current remaining resources may be the resources to be allocated after the resource scheduling platform allocates the minimum resources to each tenant.
In the embodiment of the invention, the data platform can calculate the sum of the minimum resource values of each tenant, and judge whether the sum of the minimum resource values of each tenant reaches the upper limit value of the resource scheduling platform. And if the sum of the minimum resources of each tenant reaches the upper limit value of the resource scheduling platform, the fact that the current residual resources do not exist in the resource scheduling platform at the current moment is indicated. And if the sum of the minimum resources of each tenant does not reach the upper limit value of the resource scheduling platform, indicating that the resource scheduling platform has residual resources at the current moment.
S250, determining the resource allocation sequence of each tenant application program according to the tenant resource consumption sequence queue.
And S260, sequentially distributing the current residual resources to the tenant application programs according to the resource distribution sequence.
Correspondingly, the resource allocation sequence of each tenant application program can be determined according to the tenant resource consumption sequence queue, and then the current residual resources obtained in the steps are allocated to each tenant application program in sequence according to the resource allocation sequence.
In an optional embodiment of the invention, the resource scheduling method may further include: acquiring a blood margin relation diagram; determining a first front-end application program of each tenant's resource overhead peak time interval according to the blood relationship diagram; and dynamically adjusting the resources allocated by each tenant application program according to the first front-end application program of the resource overhead peak time interval of each tenant.
The blood relationship graph may be a tenant application relationship graph obtained according to a dependency relationship between tenant applications and an execution sequence of the tenant applications. The first pre-application may be a tenant application for representing an originating resource consumption peak time interval.
In the embodiment of the invention, the blood-edge relation diagram can be obtained from the data platform, and the execution sequence of the tenant application program and the follow-up dependent program of the current tenant application program can be obtained according to the blood-edge relation diagram, so that the first front-end application program of the resource overhead peak time interval of each tenant can be determined according to the execution sequence of the tenant application program and the follow-up dependent program of the current tenant application program. After the first pre-application program is determined, the resources allocated by each tenant application program can be dynamically adjusted according to the first pre-application program in the resource overhead peak time interval of each tenant.
In an optional embodiment of the present invention, the determining, according to the blood relationship graph, the first pre-application of the resource overhead peak time interval of each tenant may include: determining a first pre-application threshold; determining a subsequent program and a subsequent time interval of the tenant application program according to the blood relationship diagram; and under the condition that the subsequent program quantity is determined to be larger than the first pre-application program threshold value and the subsequent time interval belongs to the resource overhead peak time interval range of the tenant, the tenant application program is used as the first pre-application program of the resource overhead peak time interval.
The first pre-application threshold may be index data for determining a degree of dependency of the subsequent program on the current tenant application. Optionally, the value of the first front-end application threshold may be specifically set according to actual requirements, e.g., 2, 3, or 5, and the embodiment of the present invention does not limit the specific value of the first front-end application threshold. The successor of the tenant application may be an application that has a dependency relationship with the tenant application. Optionally, the subsequent program of the tenant application program may be one or more application programs, and the embodiment of the present invention does not limit the specific numerical value of the subsequent program of the tenant application program.
Correspondingly, firstly, obtaining a follow-up program and a follow-up time interval of the tenant application program according to the blood relationship diagram, determining a first pre-application program threshold, and taking the tenant application program as a first pre-application program of a resource overhead peak time interval if the number of the follow-up programs is larger than the first pre-application program threshold and the follow-up time interval belongs to the resource overhead peak time interval range of the tenant.
Optionally, the application program dependency relationship and the execution sequence of each tenant can be obtained from the data center station, and a blood relationship graph is formed. Fig. 4 is a schematic diagram of a blood relationship diagram provided in the second embodiment of the present invention, in a specific example, as shown in fig. 4, taking a tenant application E as an example, if a first pre-application threshold is 3, then subsequent programs of the tenant application E can be obtained according to the blood relationship diagram and are tenant application I, tenant application M, tenant application J, and tenant application K, and the number of subsequent programs is 4. Further, the subsequent time interval of the tenant application E may be determined to be from the time point B to the time point C according to the blood relationship diagram, and then the subsequent time interval may be determined to belong to the resource overhead peak time interval range of the tenant in combination with the tenant resource consumption time sequence diagram, that is, the number of the subsequent programs of the tenant application E is greater than the first front-end application threshold, and the subsequent time interval belongs to the resource overhead peak time interval range of the tenant, so that the tenant application E may be used as the first front-end application of the resource overhead peak time interval.
In an optional embodiment of the present invention, the dynamically adjusting, by the first pre-application program of the resource overhead peak time interval of each tenant, the resource allocated by each tenant application program may include: determining a current tenant application program of a current tenant and a concurrent number of the current application program; and under the condition that the current tenant application program is determined to be the first front-end application program of the resource overhead peak time interval of the current tenant, the current application program concurrency number of the current tenant is improved.
The current tenant application program may be an application program in the current tenant queue, where dynamic adjustment of resources is required. The current number of application concurrency may be a request representing the number of applications that the resource scheduling platform is able to handle simultaneously. Optionally, the value of the concurrency number of the current application program may be specifically set according to actual requirements, such as 2, 3 or 5, and the embodiment of the present invention does not limit the specific value of the concurrency number of the current application program.
After the first front-end application program is determined, the current tenant application program and the current application program concurrency number of the current tenant can be obtained, if the current tenant application program is the first front-end application program in the resource overhead peak time interval of the current tenant, the resource upper limit of the current tenant of the current application program and the current application program concurrency number can be increased, so that the current tenant can execute the tenant application program to the greatest extent under the condition of sufficient resources, and the tenant application program completion speed is improved.
In an optional embodiment of the invention, the resource scheduling method may further include: determining a resource overhead valley time interval of each tenant according to the resource consumption data; after allocating resources to each tenant application program according to the tenant resource consumption order queue, the method may further include: determining a second pre-application program of the resource overhead low-valley time interval of each tenant according to the blood relationship diagram; and dynamically adjusting the resources allocated by each tenant application program according to the second pre-application program of the resource overhead low-valley time interval of each tenant.
The resource overhead valley time interval may be a time interval in which the amount of resources used by the tenant application is small. The second pre-application may be a tenant application for representing a time interval that induces a low-valley of resource consumption.
In the embodiment of the invention, the resource overhead valley time interval of each tenant can be determined according to the resource consumption data. Specifically, a resource consumption time sequence diagram of each tenant can be generated according to the resource consumption data, and basic time units are divided into the resource consumption time sequence diagram, so that unit resource consumption of each tenant application program in each basic time unit is obtained. Further, the increment of the unit resource consumption of each tenant application program in each basic time unit can be obtained through calculation, and then the resource overhead low-valley time interval of each tenant is obtained. After resources are allocated to each tenant application program according to the tenant resource consumption sequence queue, a blood relationship diagram can be obtained on a data platform, and the execution sequence of the tenant application program and the follow-up dependent program of the current tenant application program can be obtained according to the blood relationship diagram, so that the second front-end application program of the resource expense valley time interval of each tenant can be determined according to the execution sequence of the tenant application program and the follow-up dependent program of the current tenant application program. After the second pre-application program is determined, the resources allocated by the application programs of each tenant can be dynamically adjusted according to the second pre-application program in the resource overhead low-valley time interval of each tenant.
In an optional embodiment of the present invention, the determining, according to the blood relationship graph, the second pre-application of the resource overhead valley time interval of each tenant may include: determining a second pre-application threshold; determining a subsequent program and a subsequent time interval of the tenant application program according to the blood relationship diagram; and under the condition that the subsequent program quantity is smaller than the second pre-application program threshold value and the subsequent time interval belongs to the resource overhead low-valley time interval range of the tenant, the tenant application program is used as the second pre-application program of the resource overhead low-valley time interval.
The second pre-application threshold may be another index data for determining the dependency of the subsequent program on the current tenant application. Optionally, the value of the second pre-application threshold may be specifically set according to actual needs, for example, 2, 3, or 5, and the embodiment of the present invention does not limit the specific value of the second pre-application threshold.
Correspondingly, firstly, obtaining a subsequent program and a subsequent time interval of the tenant application program according to the blood relationship diagram, determining a second pre-application program threshold, and if the number of the subsequent program is smaller than the second pre-application program threshold and the subsequent time interval belongs to the resource expense low-valley time interval range of the tenant, taking the tenant application program as the second pre-application program of the resource expense low-valley time interval.
In one specific example, the description proceeds with the blood relationship diagram provided in FIG. 4. As shown in fig. 4, taking the tenant application L as an example, assuming that the second pre-application threshold is 3, it can be obtained from the blood relationship diagram that there are no subsequent programs in the tenant application L, and therefore the number of subsequent programs is 0. Further, the subsequent time interval of the tenant application program L may be determined to be the time point D to the time point E according to the blood relationship diagram, and then the subsequent time interval may be determined to belong to the resource overhead low-valley time interval range of the tenant in combination with the tenant resource consumption time sequence diagram, that is, the number of subsequent program of the tenant application program L is smaller than the second front-end application program threshold, and the subsequent time interval belongs to the resource overhead low-valley time interval range of the tenant, so that the tenant application program L may be used as the second front-end application program of the resource overhead low-valley time interval.
In an optional embodiment of the present invention, the dynamically adjusting, by the second pre-application program of the resource overhead low-valley time interval of each tenant, the resources allocated by each tenant application program may include: determining a current tenant application program of a current tenant and a concurrent number of the current application program; and under the condition that the current tenant application program is determined to be a second front-end application program of the resource overhead valley time interval of the current tenant, and the second front-end application program is operated, recovering the resources allocated to the current tenant as current residual resources, and simultaneously reducing the concurrency number of the current application program of the current tenant.
The current residual resource may be a released computing resource after the second front-end application of the current tenant completes running.
After the second front-end application program is determined, the current tenant application program of the current tenant and the concurrency number of the current application program can be obtained, if the current tenant application program is the second front-end application program of the resource overhead low-valley time interval of the current tenant and the second front-end application program is already operated, the upper limit of the resource of the current tenant of the current application program and the concurrency number of the current application program can be reduced, the resource allocated by the current tenant is recovered as the current residual resource and is allocated to the tenant queue which still submits the tenant application program and has not been allocated with the resource reaching the set maximum resource.
Fig. 5 is a schematic diagram of a dynamically adjusted tenant resource queue provided by the second embodiment of the present invention, and fig. 6 is a schematic diagram of a dynamically adjusted tenant resource consumption timing diagram provided by the second embodiment of the present invention, in a specific example, as shown in fig. 5 and fig. 6, after the dynamic adjustment of the resources allocated to each tenant application program is completed, limited computing resources may be used to intensively supply each tenant in turn, so that it can obtain sufficient resources in turn and concurrently execute the application program, and ensure that most of the application programs can be intensively and rapidly completed. By dynamically adjusting the resource queues of each tenant on line based on the pre-application program in the resource consumption peak time interval and the pre-application program in the resource consumption valley time interval, the actual running time of the tenant application program can be more accurately matched. The problem that the dynamic allocation scheme for adjusting the resource queues of each tenant according to a fixed time plan cannot be matched with the actual running time of the tenant application program under the condition that the overall running application program progress of the tenant is delayed or advanced due to special conditions or uncontrollable reasons is effectively avoided.
Fig. 7 is a flowchart of another resource scheduling method according to the second embodiment of the present invention, in a specific example, as shown in fig. 7, taking a yan as an example of a resource scheduling platform, the overall flow of the resource scheduling method may include the following operations: firstly, creating each tenant queue in the YARN according to tenant application, and setting a minimum resource value in the tenant queue according to the resource requirement of the tenant application. Each tenant can deploy tenant application programs on the data center, configure dependency relationships among the tenant application programs, obtain a blood relationship graph, initiate application program execution applications to the YARN through a dispatching system of the data center, and the YARN can allocate computing resources for the tenant application programs within a tenant resource queue range.
Further, the data platform may calculate the sum of the minimum number of resources of each tenant, determine whether the sum of the minimum number of resources of each tenant reaches the upper limit of YARN, and if not, may allocate the remaining resources to each tenant resource queue. Specifically, the data platform can collect the resource consumption data of each program operation of each tenant, analyze and find out the peak time interval and the valley time interval of the resource expense, and find out the front-end program causing the peak time interval of the resource expense and the front-end program of the valley time interval of the resource expense by combining the dispatching operation sequence of each tenant application program in the data center.
Further, the data platform can sort the queues of each tenant according to the time point sequence of the completion of the preprogram in the resource consumption peak time interval, and generate a tenant resource consumption peak time sequence queue. After the tenant resource consumption peak time sequencing queue is generated, the resource scheduling platform can sequentially allocate the residual resources to tenants according to the tenant resource consumption peak time sequencing queue, and meanwhile, the data platform online promotes the concurrency number of application programs submitted by the tenants, so that the tenants can execute the application programs in a concurrent mode to the greatest extent under the condition that the resources are sufficient, and the completion speed of the tenant application programs is improved. After the operation of the pre-program in the low valley area of the tenant resource expense is completed, the resource scheduling platform can recover the allocated resource and reallocate the resource to the next tenant in the tenant resource consumption peak time sequencing queue, and meanwhile, the concurrency number of the application program submitted by the tenant is reduced. It should be noted that, the data center station may further configure a maximum resource obtaining duration, and control a duration of each tenant queue for obtaining the maximum resource, so as to avoid that some tenants occupy the resource for too long, so that other tenants cannot obtain enough resources.
Fig. 8 is a schematic diagram of a structure of a resource scheduling device according to a second embodiment of the present invention, in a specific example, as shown in fig. 8, a resource scheduling method may be performed by a data center, where the data center may include a yan, a PAAS (Platform as a Service ), and a resource scheduling device.
For example, the YARN may allocate a resource queue for the tenant according to the tenant resource requirement, and preset the minimum resource and the maximum resource of the tenant queue; tenant authority can be configured to ensure that the tenant can only use own resource queues; the minimum resource value and the maximum resource value of each tenant resource queue can be dynamically adjusted on line according to the adjustment request initiated by the resource allocation device; resources can be allocated to the tenant application program within the minimum resource and maximum resource range according to the number of resources applied by the application program; the sum of the actual allocated resources of each tenant resource queue can be ensured not to exceed the upper limit of all resources which can be allocated by the data center station; the running state of each tenant application program can be tracked and recorded, and data such as resource consumption and the like can be recorded; and after the execution of the tenant application program is finished, the allocated resources can be automatically recovered and reallocated to the tenant queues of other application resources.
By way of example, the PAAS may provide tools for individual tenant development and deployment applications; the sequence and the dependency relationship of the running of each tenant application program can be recorded, and then a blood relationship graph is obtained; according to the program execution sequence and the dependency relationship configured by the user in the blood relationship graph, the application programs meeting the operation conditions can sequentially apply resources to the YARN and execute the resources; online adjusting concurrency of submitting application programs by tenants; the running state of the application program can be tracked, the running state is returned, and the running state report is output and saved.
For example, the resource allocation configuration may collect and store resource consumption data and a blood relationship graph of each tenant; the method comprises the steps that a pre-program of a resource consumption peak time interval and a pre-program of a resource consumption valley time interval of each tenant queue can be found out, and a tenant resource consumption sequence queue is generated; the online resource adjustment request can be periodically initiated, and the duration of obtaining the maximum resource by the tenant queue is preset.
According to the technical scheme, firstly, the resource consumption data of the tenant application program is obtained, the resource expense peak time interval of each tenant is determined according to the resource consumption data, and the termination time point of the resource expense peak time interval of each tenant is analyzed to obtain the tenant resource consumption sequence queue. After the tenant resource consumption sequence queue is obtained, the current residual resources are determined, the resource allocation sequence of each tenant application program is determined according to the tenant resource consumption sequence queue, and the current residual resources are sequentially allocated to each tenant application program according to the resource allocation sequence, so that the problem of unreasonable allocation of tenant application program resources in the prior art is solved, reasonable allocation of resources to each tenant application program can be realized, the resource utilization rate is improved, and the continuity and stability of operation of the tenant application program are ensured.
Example III
Fig. 9 is a schematic diagram of a resource scheduling apparatus according to a third embodiment of the present invention, as shown in fig. 9, where the apparatus includes: a resource consumption data acquisition module 310, a resource overhead peak time interval determination module 320, a tenant resource consumption order queue acquisition module 330, and a tenant application resource allocation module 340, wherein:
a resource consumption data acquisition module 310, configured to acquire resource consumption data of a tenant application program;
a resource overhead peak time interval determining module 320, configured to determine a resource overhead peak time interval of each tenant according to the resource consumption data;
a tenant resource consumption order queue obtaining module 330, configured to sort termination time points of resource overhead peak time intervals of each tenant, so as to obtain a tenant resource consumption order queue;
the tenant application resource allocation module 340 is configured to allocate resources for each tenant application according to the tenant resource consumption order queue.
According to the technical scheme, the resource expense peak time interval of each tenant is determined according to the acquired resource expense data of the tenant application program, so that the termination time point of the resource expense peak time interval of each tenant is analyzed, and the tenant resource expense sequence queue is obtained. After the tenant resource consumption sequence queue is obtained, resources are allocated to each tenant application program according to the tenant resource consumption sequence queue, so that the problem of unreasonable allocation of tenant application program resources in the prior art is solved, reasonable allocation of resources to each tenant application program can be realized, the resource utilization rate is improved, and the continuity and stability of operation of the tenant application program are ensured.
Optionally, the tenant application resource allocation module 340 is specifically configured to determine a current remaining resource; determining the resource allocation sequence of each tenant application program according to the tenant resource consumption sequence queue; and distributing the current residual resources to each tenant application program in turn according to the resource distribution sequence.
Optionally, the resource scheduling device further includes a first resource adjustment module, configured to obtain a blood-edge relationship graph; determining a first front-end application program of each tenant's resource overhead peak time interval according to the blood relationship diagram; and dynamically adjusting the resources allocated by each tenant application program according to the first front-end application program of the resource overhead peak time interval of each tenant.
Optionally, the first resource adjustment module is specifically configured to: determining a current tenant application program of a current tenant and a concurrent number of the current application program; and under the condition that the current tenant application program is determined to be the first front-end application program of the resource overhead peak time interval of the current tenant, the current application program concurrency number of the current tenant is improved.
Optionally, the first resource adjustment module is specifically configured to: determining a resource overhead valley time interval of each tenant according to the resource consumption data; the apparatus further comprises a second resource adjustment module configured to: determining a second pre-application program of the resource overhead low-valley time interval of each tenant according to the blood relationship diagram; and dynamically adjusting the resources allocated by each tenant application program according to the second pre-application program of the resource overhead low-valley time interval of each tenant.
Optionally, the second resource adjustment module is specifically configured to: determining a current tenant application program of a current tenant and a concurrent number of the current application program; and under the condition that the current tenant application program is determined to be a second front-end application program of the resource overhead valley time interval of the current tenant, and the second front-end application program is operated, recovering the resources allocated to the current tenant as current residual resources, and simultaneously reducing the concurrency number of the current application program of the current tenant.
Optionally, the first resource adjustment module is specifically configured to: determining a first pre-application threshold; determining a subsequent program and a subsequent time interval of the tenant application program according to the blood relationship diagram; when the subsequent program quantity is determined to be larger than the first pre-application program threshold value and the subsequent time interval belongs to the resource overhead peak time interval range of the tenant, the tenant application program is used as a first pre-application program of the resource overhead peak time interval; the apparatus further comprises a second resource adjustment module configured to: determining a second pre-application threshold; determining a subsequent program and a subsequent time interval of the tenant application program according to the blood relationship diagram; and under the condition that the subsequent program quantity is smaller than the second pre-application program threshold value and the subsequent time interval belongs to the resource overhead low-valley time interval range of the tenant, the tenant application program is used as the second pre-application program of the resource overhead low-valley time interval.
The resource scheduling device can execute the resource scheduling method provided by any embodiment of the invention, and has the corresponding functional modules and beneficial effects of the execution method. Technical details which are not described in detail in this embodiment can be referred to the resource scheduling method provided in any embodiment of the present invention.
Example IV
Fig. 10 shows a schematic diagram of the structure of an electronic device 10 that may be used to implement an embodiment of the invention. Electronic devices are intended to represent various forms of digital computers, such as laptops, desktops, workstations, personal digital assistants, servers, blade servers, mainframes, and other appropriate computers. Electronic equipment may also represent various forms of mobile devices, such as personal digital processing, cellular telephones, smartphones, wearable devices (e.g., helmets, glasses, watches, etc.), and other similar computing devices. The components shown herein, their connections and relationships, and their functions, are meant to be exemplary only, and are not meant to limit implementations of the inventions described and/or claimed herein.
As shown in fig. 10, the electronic device 10 includes at least one processor 11, and a memory, such as a Read Only Memory (ROM) 12, a Random Access Memory (RAM) 13, etc., communicatively connected to the at least one processor 11, in which the memory stores a computer program executable by the at least one processor, and the processor 11 may perform various appropriate actions and processes according to the computer program stored in the Read Only Memory (ROM) 12 or the computer program loaded from the storage unit 18 into the Random Access Memory (RAM) 13. In the RAM 13, various programs and data required for the operation of the electronic device 10 may also be stored. The processor 11, the ROM 12 and the RAM 13 are connected to each other via a bus 14. An input/output (I/O) interface 15 is also connected to bus 14.
Various components in the electronic device 10 are connected to the I/O interface 15, including: an input unit 16 such as a keyboard, a mouse, etc.; an output unit 17 such as various types of displays, speakers, and the like; a storage unit 18 such as a magnetic disk, an optical disk, or the like; and a communication unit 19 such as a network card, modem, wireless communication transceiver, etc. The communication unit 19 allows the electronic device 10 to exchange information/data with other devices via a computer network, such as the internet, and/or various telecommunication networks.
The processor 11 may be a variety of general and/or special purpose processing components having processing and computing capabilities. Some examples of processor 11 include, but are not limited to, a Central Processing Unit (CPU), a Graphics Processing Unit (GPU), various specialized Artificial Intelligence (AI) computing chips, various processors running machine learning model algorithms, digital Signal Processors (DSPs), and any suitable processor, controller, microcontroller, etc. The processor 11 performs the various methods and processes described above, such as the resource scheduling method.
In some embodiments, the resource scheduling method may be implemented as a computer program tangibly embodied on a computer-readable storage medium, such as the storage unit 18. In some embodiments, part or all of the computer program may be loaded and/or installed onto the electronic device 10 via the ROM 12 and/or the communication unit 19. When the computer program is loaded into RAM 13 and executed by processor 11, one or more steps of the resource scheduling method described above may be performed. Alternatively, in other embodiments, the processor 11 may be configured to perform the resource scheduling method in any other suitable way (e.g. by means of firmware).
Various implementations of the systems and techniques described here above may be implemented in digital electronic circuitry, integrated circuit systems, field Programmable Gate Arrays (FPGAs), application Specific Integrated Circuits (ASICs), application Specific Standard Products (ASSPs), systems On Chip (SOCs), load programmable logic devices (CPLDs), computer hardware, firmware, software, and/or combinations thereof. These various embodiments may include: implemented in one or more computer programs, the one or more computer programs may be executed and/or interpreted on a programmable system including at least one programmable processor, which may be a special purpose or general-purpose programmable processor, that may receive data and instructions from, and transmit data and instructions to, a storage system, at least one input device, and at least one output device.
A computer program for carrying out methods of the present invention may be written in any combination of one or more programming languages. These computer programs may be provided to a processor of a general purpose computer, special purpose computer, or other programmable data processing apparatus, such that the computer programs, when executed by the processor, cause the functions/acts specified in the flowchart and/or block diagram block or blocks to be implemented. The computer program may execute entirely on the machine, partly on the machine, as a stand-alone software package, partly on the machine and partly on a remote machine or entirely on the remote machine or server.
In the context of the present invention, a computer-readable storage medium may be a tangible medium that can contain, or store a computer program for use by or in connection with an instruction execution system, apparatus, or device. The computer readable storage medium may include, but is not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any suitable combination of the foregoing. Alternatively, the computer readable storage medium may be a machine readable signal medium. More specific examples of a machine-readable storage medium would include an electrical connection based on 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.
To provide for interaction with a user, the systems and techniques described here can be implemented on an electronic device having: a display device (e.g., a CRT (cathode ray tube) or LCD (liquid crystal display) monitor) for displaying information to a user; and a keyboard and a pointing device (e.g., a mouse or a trackball) through which a user can provide input to the electronic device. Other kinds of devices may also be used to provide for interaction with a user; for example, feedback provided to the user may be any form of sensory feedback (e.g., visual feedback, auditory feedback, or tactile feedback); and input from the user may be received in any form, including acoustic input, speech input, or tactile input.
The systems and techniques described here can be implemented in a computing system that includes a background component (e.g., as a data server), or that includes a middleware component (e.g., an application server), or that includes a front-end component (e.g., a user computer having a graphical user interface or a web browser through which a user can interact with an implementation of the systems and techniques described here), or any combination of such background, middleware, or front-end components. The components of the system can be interconnected by any form or medium of digital data communication (e.g., a communication network). Examples of communication networks include: local Area Networks (LANs), wide Area Networks (WANs), blockchain networks, and the internet.
The computing system may include clients and servers. The client and server are typically remote from each other and typically interact through a communication network. The relationship of client and server arises by virtue of computer programs running on the respective computers and having a client-server relationship to each other. The server can be a cloud server, also called a cloud computing server or a cloud host, and is a host product in a cloud computing service system, so that the defects of high management difficulty and weak service expansibility in the traditional physical hosts and VPS service are overcome.
Claims (10)
1. A method for scheduling resources, comprising:
acquiring resource consumption data of a tenant application program;
determining the resource overhead peak time interval of each tenant according to the resource consumption data;
sequencing the termination time points of the resource overhead peak time intervals of the tenants to obtain a tenant resource consumption sequence queue;
and distributing resources to the tenant application programs according to the tenant resource consumption sequence queue.
2. The method of claim 1, wherein the allocating resources for each of the tenant applications according to the tenant resource consumption order queue comprises:
determining the current residual resources;
determining the resource allocation sequence of each tenant application program according to the tenant resource consumption sequence queue;
and distributing the current residual resources to each tenant application program in turn according to the resource distribution sequence.
3. The method according to claim 1 or 2, characterized in that the method further comprises:
acquiring a blood margin relation diagram;
determining a first front-end application program of each tenant's resource overhead peak time interval according to the blood relationship diagram;
and dynamically adjusting the resources allocated by each tenant application program according to the first front-end application program of the resource overhead peak time interval of each tenant.
4. The method of claim 3, wherein the dynamically adjusting the resources allocated by each tenant application according to the first pre-application for the resource overhead peak time interval of each tenant comprises:
determining a current tenant application program of a current tenant and a concurrent number of the current application program;
and under the condition that the current tenant application program is determined to be the first front-end application program of the resource overhead peak time interval of the current tenant, the current application program concurrency number of the current tenant is improved.
5. A method according to claim 3, further comprising:
determining a resource overhead valley time interval of each tenant according to the resource consumption data;
after allocating resources to each tenant application program according to the tenant resource consumption order queue, the method further comprises:
determining a second pre-application program of the resource overhead low-valley time interval of each tenant according to the blood relationship diagram;
and dynamically adjusting the resources allocated by each tenant application program according to the second pre-application program of the resource overhead low-valley time interval of each tenant.
6. The method of claim 5, wherein the dynamically adjusting the resources allocated by each tenant application according to the second pre-application for the resource overhead valley time interval of each tenant comprises:
determining a current tenant application program of a current tenant and a concurrent number of the current application program;
and under the condition that the current tenant application program is determined to be a second front-end application program of the resource overhead valley time interval of the current tenant, and the second front-end application program is operated, recovering the resources allocated to the current tenant as current residual resources, and simultaneously reducing the concurrency number of the current application program of the current tenant.
7. The method of claim 5, wherein the determining a first pre-application for each tenant's resource overhead peak time interval from the blood-edge relationship graph comprises:
determining a first pre-application threshold;
determining a subsequent program and a subsequent time interval of the tenant application program according to the blood relationship diagram;
when the subsequent program quantity is determined to be larger than the first pre-application program threshold value and the subsequent time interval belongs to the resource overhead peak time interval range of the tenant, the tenant application program is used as a first pre-application program of the resource overhead peak time interval;
The determining, according to the blood relationship graph, a second pre-application of a resource overhead valley time interval of each tenant includes:
determining a second pre-application threshold;
determining a subsequent program and a subsequent time interval of the tenant application program according to the blood relationship diagram;
and under the condition that the subsequent program quantity is smaller than the second pre-application program threshold value and the subsequent time interval belongs to the resource overhead low-valley time interval range of the tenant, the tenant application program is used as the second pre-application program of the resource overhead low-valley time interval.
8. A resource scheduling apparatus, comprising:
the resource consumption data acquisition module is used for acquiring the resource consumption data of the tenant application program;
the resource overhead peak time interval determining module is used for determining the resource overhead peak time interval of each tenant according to the resource consumption data;
the tenant resource consumption sequence queue acquisition module is used for sequencing the termination time points of the resource overhead peak time intervals of each tenant to obtain a tenant resource consumption sequence queue;
and the tenant application program resource allocation module is used for allocating resources for each tenant application program according to the tenant resource consumption sequence queue.
9. An electronic device, the electronic device comprising:
at least one processor; and
a memory communicatively coupled to the at least one processor; wherein,
the memory stores a computer program executable by the at least one processor to enable the at least one processor to perform the resource scheduling method of any one of claims 1-7.
10. A computer storage medium storing computer instructions for causing a processor to perform the resource scheduling method of any one of claims 1-7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311177803.XA CN117056055A (en) | 2023-09-13 | 2023-09-13 | Resource scheduling method and device, electronic equipment and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311177803.XA CN117056055A (en) | 2023-09-13 | 2023-09-13 | Resource scheduling method and device, electronic equipment and storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN117056055A true CN117056055A (en) | 2023-11-14 |
Family
ID=88667619
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202311177803.XA Pending CN117056055A (en) | 2023-09-13 | 2023-09-13 | Resource scheduling method and device, electronic equipment and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN117056055A (en) |
-
2023
- 2023-09-13 CN CN202311177803.XA patent/CN117056055A/en active Pending
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN112559182B (en) | Resource allocation method, device, equipment and storage medium | |
| CN105320561A (en) | Task management method and system | |
| CN111078404B (en) | Computing resource determining method and device, electronic equipment and medium | |
| CN112527509B (en) | Resource allocation method and device, electronic equipment and storage medium | |
| CN112783659A (en) | Resource allocation method and device, computer equipment and storage medium | |
| CN115658311A (en) | Resource scheduling method, device, equipment and medium | |
| CN114327918A (en) | Method and device for adjusting resource amount, electronic equipment and storage medium | |
| CN114579323A (en) | Thread processing method, device, equipment and medium | |
| CN110673950A (en) | Cloud computing task allocation method, device, equipment and storage medium | |
| CN117472471A (en) | Application program configuration method, device, equipment and storage medium | |
| CN117112222A (en) | Request processing method and device, electronic equipment and storage medium | |
| CN112860401A (en) | Task scheduling method and device, electronic equipment and storage medium | |
| CN116048791B (en) | Regulation and control method and device of test node, electronic equipment and storage medium | |
| CN117056055A (en) | Resource scheduling method and device, electronic equipment and storage medium | |
| CN115952054A (en) | Simulation task resource management method, device, equipment and medium | |
| CN115757120A (en) | Pressure testing method and device, electronic equipment and readable storage medium | |
| CN113032092B (en) | Distributed computing method, device and platform | |
| CN115269145A (en) | High-energy-efficiency heterogeneous multi-core scheduling method and device for offshore unmanned equipment | |
| CN114862223A (en) | Robot scheduling method, device, equipment and storage medium | |
| CN112817761A (en) | Energy-saving method for enhancing cloud computing environment | |
| CN113515355A (en) | Resource scheduling method, device, server and computer readable storage medium | |
| CN116389499A (en) | Task allocation method, device, equipment and medium based on electric power Internet of things | |
| CN116361008A (en) | Task balanced distribution method, device, equipment and medium based on electric power Internet of things | |
| CN116893893B (en) | Virtual machine scheduling method and device, electronic equipment and storage medium | |
| CN115361449B (en) | Method, device, equipment and storage medium for adjusting IP 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 |