CN112150181B - Resource allocation method, device, equipment and storage medium - Google Patents
Resource allocation method, device, equipment and storage medium Download PDFInfo
- Publication number
- CN112150181B CN112150181B CN201910576167.5A CN201910576167A CN112150181B CN 112150181 B CN112150181 B CN 112150181B CN 201910576167 A CN201910576167 A CN 201910576167A CN 112150181 B CN112150181 B CN 112150181B
- Authority
- CN
- China
- Prior art keywords
- target information
- resource
- information
- allocated
- 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.)
- Active
Links
- 238000013468 resource allocation Methods 0.000 title claims abstract description 68
- 238000000034 method Methods 0.000 title claims abstract description 61
- 238000004364 calculation method Methods 0.000 claims description 33
- 238000011084 recovery Methods 0.000 claims description 28
- 230000002860 competitive effect Effects 0.000 claims description 14
- 238000009499 grossing Methods 0.000 claims description 12
- 230000005059 dormancy Effects 0.000 claims description 3
- 238000012163 sequencing technique Methods 0.000 claims 1
- 239000000758 substrate Substances 0.000 claims 1
- 230000008901 benefit Effects 0.000 abstract description 9
- 238000009826 distribution Methods 0.000 description 7
- 230000000694 effects Effects 0.000 description 6
- 238000010586 diagram Methods 0.000 description 5
- 230000006735 deficit Effects 0.000 description 2
- 230000006870 function Effects 0.000 description 2
- 230000003287 optical effect Effects 0.000 description 2
- 238000004891 communication Methods 0.000 description 1
- 230000001627 detrimental effect Effects 0.000 description 1
- 235000003642 hunger Nutrition 0.000 description 1
- 230000002085 persistent effect Effects 0.000 description 1
- 230000000750 progressive effect Effects 0.000 description 1
- 230000002035 prolonged effect Effects 0.000 description 1
- 230000007958 sleep Effects 0.000 description 1
- 230000037351 starvation Effects 0.000 description 1
- 230000003068 static effect Effects 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q30/00—Commerce
- G06Q30/02—Marketing; Price estimation or determination; Fundraising
- G06Q30/0241—Advertisements
- G06Q30/0249—Advertisements based upon budgets or funds
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q30/00—Commerce
- G06Q30/02—Marketing; Price estimation or determination; Fundraising
- G06Q30/0241—Advertisements
- G06Q30/0272—Period of advertisement exposure
Abstract
The application provides a resource allocation method, a device, equipment and a storage medium, wherein the method comprises the following steps: determining a first current residual resource of the target object based on the current attribute information of the target object and the current attribute information of at least one target information included in the target object; determining a smooth consumption ratio of the target information based on the current attribute information of each target information and the first current remaining resources; distributing the first current residual resources to the target information according to the smooth consumption ratio of each target information to obtain distributed resource quota corresponding to the target information; determining a second current residual resource of the target object and a target information set to be allocated based on the allocated resource quota corresponding to each target information and the current attribute information of the target information; and determining the resource competitiveness of each piece of target information to be allocated, and allocating the second current residual resource to the target information to be allocated. The method and the device can maximize benefits of advertisers and advertising platforms and enrich ecology.
Description
Technical Field
The application belongs to the technical field of internet, and particularly relates to a resource allocation method, a device, equipment and a storage medium.
Background
In the field of advertisement budget allocation, when the current consumption amount of an account/advertisement exceeds the current budget set by a user, the resource allocation is generally carried out by adopting a budget method, and is called super budget limit, which is called super limit for short, the super limit consumption advertisement platform cannot charge, and the super limit consumption advertisement platform belongs to advertisement platform loss; multiple advertisements can be hung under a single account, an advertiser can set account budget and advertisement budget respectively, when the advertisements exceed the limits, the advertisements need to be put down, and when the accounts exceed the limits, all the advertisements under the accounts need to be put down. To prevent the occurrence of conditions such as overrun that are detrimental to the advertiser or advertising platform, it is desirable to reasonably allocate the budget of the account to the advertisement, i.e., to the advertisement budget.
Existing advertising platforms typically employ a uniform or proportionally budgeted allocation method when budgeting. However, the method is a static method in nature whether the method is a uniform division method or an advertisement budget proportion allocation method, the real-time competition condition of advertisements is not considered, and the budget quota proportion allocated to the advertisements is fixed. In actual delivery, a small amount of advertisements are usually good in effect, fast in consumption and poor in other advertisement effects, and in order to maximize the benefits of the advertisement platform under the condition of ensuring the delivery effect of advertisers, more quotas are required to be allocated to the advertisements which are fast in consumption and have more budgets, but in order to enrich ecology, most advertisements can be allocated to budgets and participate in competition.
Disclosure of Invention
In order to reduce the overrun proportion, maximize the benefits of advertisers and advertising platforms and enrich ecology, the application provides a resource allocation method, device, equipment and storage medium based on real-time consumption speed and real-time residual budget.
In one aspect, the present application proposes a budget allocation method, the method comprising:
determining a first current residual resource of a target object based on current attribute information of the target object and current attribute information of at least one target information included in the target object;
determining a smooth consumption ratio of each target information based on current attribute information of the target information and the first current residual resource;
distributing the first current residual resources to the target information according to the smooth consumption ratio of each target information to obtain distributed resource quota corresponding to the target information;
determining a second current residual resource of the target object and a target information set to be allocated based on allocated resource quota corresponding to each target information and current attribute information of the target information;
and determining the resource competitiveness of each piece of target information to be allocated, and allocating the second current residual resource to the target information to be allocated based on the resource competitiveness of the target information to be allocated.
In another aspect, the present application proposes a budget allocation apparatus, said apparatus comprising:
a first determining module, configured to determine a first current remaining resource of a target object based on current attribute information of the target object and current attribute information of at least one target information included in the target object;
the second determining module is used for determining the smooth consumption ratio of the target information based on the current attribute information of each target information and the first current residual resources;
the first allocation module is used for allocating the first current residual resources to the target information according to the smooth consumption ratio of each target information to obtain allocation resource quota corresponding to the target information;
the third determining module is used for determining a second current residual resource of the target object and a target information set to be allocated based on the allocated resource quota corresponding to each target information and the current attribute information of the target information;
and the second allocation module is used for determining the resource competitiveness of each piece of target information to be allocated and allocating the second current residual resource to the target information to be allocated based on the resource competitiveness of the target information to be allocated.
In another aspect, the present application proposes an apparatus comprising: a processor and a memory having stored therein at least one instruction, at least one program, a set of codes or a set of instructions loaded and executed by the processor to implement a budget allocation method as described above.
In another aspect, the present application proposes a computer readable storage medium having stored therein at least one instruction, at least one program, a set of codes or a set of instructions, the at least one instruction, the at least one program, the set of codes or the set of instructions being loaded and executed by a processor to implement a budget allocation method as described above.
According to the resource allocation method, the device, the equipment and the storage medium, the first current residual resources of each target object are determined based on the current attribute information (such as real-time consumption of the target information) of each target information and the current attribute information (such as real-time consumption of an account) of the target object, the first current residual resources are allocated to each target information according to the smooth consumption ratio of each target information, so that first round allocation is completed, in the first round allocation, as the smooth consumption ratio is used for first time allocation, more resources (better target information effect and faster consumption) can be ensured to be allocated to all target information under the target object, and meanwhile, each target information can be ensured to have a chance to participate in platform competition to test the target information effect. After the first round of allocation, a part of target information still has resource quota remaining, the part of target information can be used as target information to be allocated for participating in the second round of allocation, and the other part of target information allocation resource quota is not used up, the resource quota remaining in the part of target information can be recovered to obtain second current residual resources, meanwhile, the resource competitiveness of each piece of target information to be allocated is calculated, and the second current residual resources are allocated to the target information to be allocated based on the resource competitiveness of the target information to be allocated, so that the second round of allocation is completed. According to the method and the device, through the first round of distribution and the second round of distribution, real-time competition conditions of target information are fully considered, the overrun proportion of advertisements can be effectively reduced, benefits of advertisers and advertisement platforms are maximized, and ecology is enriched.
Drawings
In order to more clearly illustrate the technical solutions and advantages of embodiments of the present application or of the prior art, the following description will briefly introduce the drawings that are required to be used in the embodiments or the prior art descriptions, it is obvious that the drawings in the following description are only some embodiments of the present application, and other drawings may be obtained according to these drawings without inventive effort for a person skilled in the art.
Fig. 1 is an overall framework flowchart of a resource allocation method provided in an embodiment of the present application.
Fig. 2 is a schematic flow chart of a resource allocation method according to an embodiment of the present application.
Fig. 3 is a schematic flow chart of determining a first current remaining resource of a target object based on current attribute information of the target object and current attribute information of at least one target information included in the target object according to an embodiment of the present application.
Fig. 4 is a schematic flow chart of determining a smooth consumption ratio of each target information based on the current attribute information of the target information and the first current remaining resource according to the embodiment of the present application.
Fig. 5 is a schematic flow chart of determining a second current remaining resource of the target object and a target information set to be allocated based on an allocated resource quota corresponding to each target information and current attribute information of the target information according to an embodiment of the present application.
Fig. 6 is a schematic flow chart of determining a resource competitiveness of each target information to be allocated, and allocating the second current remaining resource to the target information to be allocated based on the resource competitiveness of the target information to be allocated according to the embodiment of the present application.
FIG. 7 is a schematic diagram of an advertising budget distribution provided by an embodiment of the present application.
Fig. 8 is an overrun ratio diagram at different time points according to an embodiment of the present application.
Fig. 9 is a schematic structural diagram of a resource allocation device according to an embodiment of the present application.
Fig. 10 is a schematic structural diagram of a server according to an embodiment of the present application.
Detailed Description
In order to make the present application solution better understood by those skilled in the art, the following description will be made in detail and with reference to the accompanying drawings in the embodiments of the present application, it is apparent that the described embodiments are only some embodiments of the present application, not all embodiments. All other embodiments, which can be made by one of ordinary skill in the art based on the embodiments herein without making any inventive effort, shall fall within the scope of the present application.
It should be noted that the terms "first," "second," and the like in the description and claims of the present application 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 embodiments of the present application 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 server that comprises a list of steps or elements is not necessarily limited to those steps or elements expressly listed or inherent to such process, method, article, or apparatus, but may include other steps or elements not expressly listed or inherent to such process, method, article, or apparatus.
For the target information, the number of online target information is relatively large, in order to facilitate the real-time processing of dynamic data and relieve the performance pressure of the target information engine, in the embodiment of the present application, a data service for computing resource allocation is independently provided, that is, the data service for computing resource allocation and the target information engine system are mutually independent, and a certain preset time is taken as a period, for example, a minute is taken as a period, and the latest data of all current online target information is tracked and obtained from the target information engine to perform resource allocation, and then the computing result is written back to the target information engine. Fig. 1 is a flowchart of an overall framework of a resource allocation method provided in an embodiment of the present application, where the method operation steps as described in the examples or flowcharts are provided, but may include more or fewer operation steps based on conventional or non-inventive labor. The order of steps recited in the embodiments is merely one way of performing the order of steps and does not represent a unique order of execution. In actual execution of the system or server product, the method may be performed sequentially or in parallel (e.g., in a parallel processor or a multithreaded environment) as shown in the embodiments or the drawings, and in particular, as shown in fig. 1, the overall framework flow may include the following steps:
S101, recording the current resource allocation starting time.
In the embodiment of the present disclosure, in order to realize dynamic real-time allocation of resources, when it is determined that resource allocation is required, a current resource allocation start time needs to be recorded, so that real-time dynamic allocation of resources is performed with a preset time as a period.
S103, acquiring current attribute information of each piece of target information and current attribute information of a target object which are currently online from a target information engine system.
In this embodiment of the present disclosure, taking the target information as an advertisement as an example, when the target information is an advertisement, the target object may be an account to which the advertisement belongs, and the resource may be a budget in the account.
In practical application, the advertisement engine may include at least one account, each account may include at least one advertisement, when budget allocation needs to be performed on the advertisement in the advertisement engine, all advertisements currently on line may be obtained from the advertisement engine, and current attribute information of each advertisement, such as advertisement budget, advertisement consumption, identity (id) of the account to which the advertisement belongs, and then current attribute information of all accounts, such as account budget, account consumption, etc., is obtained according to the account id.
S105, dynamically distributing the resources in the target objects to each piece of target information in real time.
In the embodiment of the specification, when the target object is an account, the target information is an advertisement, and the resource is a budget in the account, the budget in the account can be dynamically allocated to the advertisement in real time based on real-time consumption and real-time residual budget of the account or the advertisement.
In practical application, since the advertisement engine can include at least one account, and each account can include at least one advertisement, in order to improve the efficiency and accuracy of budget allocation, during budget allocation, advertisements can be grouped according to account ids, and in units of groups, the budget in the account is allocated to each advertisement under the account by using a dynamic allocation algorithm.
S107, the allocated resources are written back to the target information engine system.
In the embodiment of the present disclosure, since the target information engine system and the data service of resource allocation are independent of each other, after the resource allocation is completed, the allocated resource needs to be written back to the target information engine system. Taking the target information as an advertisement as an example, after the account budget is allocated to the advertisement, the allocated advertisement budget quota needs to be written back to the advertisement engine.
S109, recording the current resource allocation ending time.
S1011, comparing the difference between the resource allocation ending time and the resource allocation starting time with the first preset time.
S1013, when the difference value is larger than the first preset time, restarting resource allocation.
S1015, when the difference value is smaller than or equal to the first preset time, dormancy is performed for a second preset time, and the difference value is compared with the first preset time again after the second preset time.
In this embodiment of the present disclosure, after the resource allocation is completed, it is required to record the current resource allocation end time, determine whether the difference between the current resource allocation end time and the current resource allocation start time exceeds a first preset time, such as 1 minute, if so, return to S101 to restart the resource allocation, if not, sleep for a second preset time, such as 1 second, and return to S1011.
In the embodiment of the specification, a data service independent of a target information engine is started, all online target information is processed once per minute, budget quota allocated by the target information is calculated in real time and then written back to the target information engine, because the data service allocated by the calculation resource and the target information engine system are mutually independent, the performance pressure of the engine system can be effectively relieved, the performance of the engine system cannot be influenced due to complex logic, and meanwhile, the budget allocation is carried out on the target information by taking a group as a unit, so that the efficiency and the accuracy of the budget allocation can be effectively improved.
In order to accomplish the real-time dynamic allocation of the resources in the target object to each target information in S105, the embodiment of the present disclosure provides a resource allocation method, as shown in fig. 2, where the method may include:
s201, determining a first current residual resource of a target object based on current attribute information of the target object and current attribute information of at least one piece of target information included in the target object.
In this embodiment of the present disclosure, the current attribute information of the target information includes information consumption of the target information at a current time, such as advertisement consumption, and the current attribute information of the target object includes an object total resource of the target object at the current time, such as an account budget, and as shown in fig. 3, the determining, based on the current attribute information of the target object and the current attribute information of at least one target information included in the target object, the first current remaining resource of the target object may include:
s301, calculating the sum of information consumption of each target information to obtain the object consumption of the target object.
S303, calculating the difference value between the total resource of the object and the consumption of the object to obtain the first current residual resource.
In the embodiment of the present specification, the information consumption of the target information at the current time may be set as the cost a (i) Setting the total object resources of the target object as the budgets u The object consumption cost of the target object at the current time u For the sum of information consumption of all target information under the target object, the calculation formula is as follows:
cost u ＝∑ i cost a (i)，
first current residual resource left_widget of target object u Total resource budgets for objects u Consuming costs with the object u Is calculated as:
left_budget u ＝budget u -cost u 。
s203, determining the smooth consumption ratio of the target information based on the current attribute information of each target information and the first current residual resources.
In this embodiment of the present disclosure, as shown in fig. 4, the determining, based on the current attribute information of each piece of target information and the first current remaining resource, a smooth consumption ratio of the target information may include:
s401, calculating the sum of information consumption and smoothing factors of each piece of target information to obtain first smoothing consumption corresponding to the target information; wherein the smoothing factor characterizes a quotient of the first current remaining resource and the number of the target information.
S403, calculating the sum of the object consumption and the first current residual resource to obtain second smooth consumption.
S405, calculating a quotient of the first smooth consumption and the second smooth consumption corresponding to each piece of target information, and obtaining a smooth consumption ratio of the target information.
In the embodiment of the present specification, each target information a is calculated in S401 i Information consumption cost of (a) a (i) And the sum of the smoothing factor alpha to obtain each target information a i Corresponding firstSmooth consumption cost a (i) +α, then the sum of the object consumption and the first current remaining resource is calculated in S403 to obtain a second smoothed consumption Σ j cost a (j) +β, where Σ j cost a (j) For object consumption, it is identical to the foregoing cost u Belonging to the same concept, beta is the first current residual resource left_widget u Alpha is the average value of beta distributed according to the target information number, and the target information number of the target object u is assumed to be ad_num u Alpha = beta/ad_num u 。
Accordingly, the smooth consumption ratio cost_rate of the target information in S405 a (i) The calculation formula of (2) is as follows:
in the embodiment of the specification, the alpha and beta are added in the process of calculating the smooth consumption ratio, so that the influence of random factors can be effectively reduced, and the situation that when other target information is not consumed yet, a small part of target information with small consumption obtains most of resources to cause starvation of other target information is avoided, so that the rationality and accuracy of resource allocation are improved.
S205, distributing the first current residual resources to the target information according to the smooth consumption ratio of each target information, and obtaining the distributed resource quota corresponding to the target information.
In the embodiment of the present specification, after obtaining the smooth consumption ratio, the first current remaining resource left_widget may be determined according to the smooth consumption ratio u Assigned to each target information alpha i To complete the first round of resource allocation.
In one possible embodiment, a smooth consumption ratio cost_rate for each target information may be calculated a (i) And the first current residual resource left_widget u Obtaining the allocated resource quota assignment_hedget corresponding to the target information a (i) The calculation formula is as follows:
assign_budget a (i)＝left_budget u *cost_rate a (i)。
in the embodiment of the specification, the first round of resource allocation is completed through smooth consumption ratio, as the appeal of the target information delivery client is in the resource range, the more and better the target information consumption is, from the viewpoint of a platform, the longer the online delivery time of the target information is and the more prosperous the ecology is under the condition of maximizing the target information consumption, so in the first round of allocation, the faster the target information is consumed, more resources (the better the target information effect is, the faster the consumption is), meanwhile, all the target information in the target object can be distributed to certain resources, each target information is ensured to have the opportunity to participate in the platform competition, and the richness of ecology is ensured, thereby enabling the target information delivery client and the advertising platform to obtain the maximum benefit and reducing the overrun proportion.
S207, determining a second current residual resource of the target object and a target information set to be allocated based on allocated resource quota corresponding to each target information and current attribute information of the target information.
In this embodiment of the present disclosure, the current attribute information of the target information includes an information total resource unit of the target information at a current time a (i) For example, if the advertisement budget is an advertisement budget, as shown in fig. 5, the determining, based on the allocated resource quota corresponding to each piece of target information and the current attribute information of the target information, the second current remaining resource of the target object and the target information set to be allocated may include:
s501, obtaining the current resource quota of the target information based on the difference value of the information total resource and the information consumption of each target information.
S503, comparing the current resource quota of each piece of target information with the allocated resource quota of the target information.
S505, determining target information of which the current resource quota is smaller than the allocated resource quota as recovery target information, obtaining a recovery target information set, and determining target information of which the current resource quota is larger than the allocated resource quota as target information to be allocated, obtaining a target information set to be allocated.
S507, calculating the difference value of the allocated resource quota of each piece of recovery target information and the current resource quota of the recovery target information, and obtaining the resource quota difference value corresponding to the recovery target information.
S509, calculating the sum of the resource quota difference values of each piece of recovery target information to obtain the second current residual resource.
In the embodiment of the present specification, the current resource quota of the target information in S501 is the widget_quota a (i) The calculation formula of (2) is as follows:
budget_quota a (i)＝budget a (i)-cost a (i)。
in practical application, for the same target information, the widget_quota a (i) And assign_widget a (i) Is not necessarily equal, so the comparison of the hedge_quota is needed in S503 a (i) And assign_widget a (i) Is of a size of (a) and (b). In S505, for assignment_hedge a (i)<budget_quota a (i) After the first round of allocation, the target information still has resource quota remaining and can participate in the second round of allocation, so that the assignment_widget can be used for allocating a (i)<budget_quota a (i) The target information of the target information to be allocated is determined to be target information to be allocated, and a target information set to be allocated, which is required to carry out secondary resource allocation, is obtained, wherein the target information set to be allocated comprises at least one target information to be allocated.
In practical application, the resources to which the target information can be allocated generally do not exceed the current resource quota, if an assignment_hedge exists a (i)>budget_quota a (i) If the target information of the target information indicates that the resource quota of the target information is exhausted after the first round of resource allocation, but the target object allocates the resource of the target information to be not exhausted, in 507, the assignment_bandwidth may be used a (i)>budget_quota a (i) The target information of (2) is determined as recovery target information, a recovery target information set requiring recovery of the resource deficit is obtained, and the recovered resource deficit is taken as a second current residual resource left_hedget of the target object u2 . Wherein the resource quota difference value corresponding to each recovery target information is an assignment_hedge a (i)-budget_quota a (i) In S509, a second current residual resource left_widget u2 The calculation formula of (2) is as follows:
s209, determining the resource competitiveness of each piece of target information to be allocated, and allocating the second current residual resource to the target information to be allocated based on the resource competitiveness of the target information to be allocated.
In the embodiment of the present disclosure, after the first round of allocation is completed, a portion of the remaining resources of the target object remain unassigned, and a portion of the remaining resources of the target information remain available for the second round of allocation. The second round of allocation is aimed at zero remaining resources of the target object or zero remaining resource quota of all target information.
In this embodiment of the present disclosure, as shown in fig. 6, the determining the resource competitiveness of each target information to be allocated, and allocating the second current remaining resource to the target information to be allocated based on the resource competitiveness of the target information to be allocated may include:
s601, calculating the quotient of the information consumption of each piece of target information to be distributed and the sum of the information consumption to be distributed, and obtaining the relative consumption ratio of the target information to be distributed; the sum of the consumption of the information to be distributed is the sum of the consumption of the information of each target information to be distributed.
S603, calculating the quotient of the information consumption of each piece of target information to be allocated and the total information resource of the target information to be allocated, and obtaining the consumption resource ratio of the target information to be allocated.
S605, obtaining the competitive weight of the target information to be distributed based on the product of the relative consumption ratio of each target information to be distributed and the index of the consumption resource ratio of the target information to be distributed.
S607, sorting each piece of target information to be distributed according to the competitive weight in a descending order to obtain a target information sequence to be distributed.
S609, calculating the difference value between the current resource quota of each piece of target information to be allocated and the allocated resource quota of the target information to be allocated, and obtaining the residual resource quota corresponding to the target information to be allocated.
And S6011, based on the residual resource quota of each piece of target information to be allocated, sequentially allocating the second current residual resource to each piece of target information to be allocated according to the target information sequence to be allocated until the second current residual resource is zero or the residual resource quota of each piece of target information to be allocated is zero.
In the embodiment of the present disclosure, the second round of resource allocation may be performed according to the resource competitiveness of the target information to be allocated, in practical application, the faster the consumption of the target information, the more resources allocated, but in consideration of maximizing ecological benefits, the target information remaining available resources need to be considered, so that the target information always has resources to compete for a longer period of time, and thus a function proportional to the target information consumption speed and the target information remaining resources, such as the competitive weight W, may be used i To perform the second round of resource allocation, the competitive weight W in S605 i The calculation formula of (2) is as follows:
wherein the relative consumption ratio θ in S601 i The calculation formula of (2) is as follows:
θ i ＝cost a (i)/∑ j cost a (j)，
cost in the formula a (i) Sigma for information consumption of each target information to be allocated j cost a (j) And (3) taking the sum of the consumption of the information to be distributed as the quotient of the consumption sum of the information of each piece of target information to be distributed.
Consumption resource ratio lambda in S603 i The calculation formula of (2) is as follows:
λ i ＝cost a (i)/budget a (i)，
the male partCost in the formula a (i) Information consumption of target information to be allocated to each piece of target information a (i) The information total resource corresponding to each target information to be allocated is represented by lambda i And W is equal to i Inversely proportional, lambda i The larger W i The smaller.
In the embodiment of the present specification, in S607, W is obtained i Thereafter, each target information to be allocated can be set according to W i Descending order arrangement is carried out to obtain a target information sequence to be distributed, and then the current resource quota of each target information to be distributed is calculated according to S609 a (i) Allocated resource quota assignment_hedget of the target information to be allocated a (i) Obtaining the residual resource quota left_quoa corresponding to the target information to be allocated a (i) The calculation formula is as follows:
left_quota a (i)＝budget_quota a (i)-assign_budget a (i)。
in the examples of the present specification, left_quota was obtained a (i) And W is i Thereafter, according to S6011, left_hedget is used u2 Left_quota to fill in each target information to be allocated a (i) Until left_widget u2 Zero, or left_quota a (i) Zero.
In practical application, if two or more W of target information to be distributed appear i Equal to W i Equal target information to be distributed can be obtained according to left_quota a (i) And performing descending order sorting to obtain a target information sequence to be allocated, thereby increasing the accuracy and feasibility of the target information sequence to be allocated, and further improving the accuracy and rationality of target information resource allocation.
The resource allocation method in the embodiment of the present application is described in detail below by taking the target information-Emei advertisement as an example:
when the target information is advertisement, the target object can be account, the target information can be advertisement hung under the account, the resource can be budget, the resource allocation can be budget allocation of account, the first current residual resource can be first current residual budget, and the resource allocation can be carried outThe source quota may be an allocated budget quota, the second current remaining resource may be a second current remaining budget, the information consumption may be advertisement consumption, the information total resource may be advertisement budget, the object total resource may be account budget, the object consumption may be account consumption, the allocated resource quota may be an allocated budget quota, the current resource quota may be a current budget quota, and the remaining resource quota may be a remaining budget quota. Suppose there are 3 advertisements a under advertiser account u 1 、a 2 、a 3 The respective budget distributions are shown in FIG. 7, account budgets u 1000, a 1 、a 2 、a 3 Advertisement budget budgets of (a) a (i) 330, 240, 450, respectively, then budget the account for the widget u Dynamic allocation of 3 advertisements a in real time 1 、a 2 、a 3 The specific process of (2) may be as follows:
first round of allocation:
account consumption is calculated, and the account consumption is the sum of advertisement consumption of each advertisement, and the calculation formula is as follows:
cost u ＝∑ 3 cost a (i)＝200+100+400＝700。
calculating a first current residual budget which is an account budget u The difference from the account consumption is calculated as follows:
left_budget u ＝budget u -cost u ＝1000-700＝300。
alpha is a smoothing factor, beta is a first current residual budget and is an account budget, and the calculation formula is as follows:
β＝left_budget u ＝300；α＝β/ad_num c ＝300/3＝100。
according toCalculating a smooth consumption ratio for each advertisement:
cost_rate a (1)＝(200+100)/(700+300)＝0.3，cost_rate a (2)＝0.2，cost_rate a (3)＝0.5。
calculating allocated budget quota allocated to each advertisement according to the smooth consumption ratio, and calculating residual budget quota and second current residual budget according to the difference between the current budget quota and the allocated budget quota, wherein the calculation formula is as follows:
a 1 the allocated budget quota is left_budget u * cost_rate=300×0.3=90, and left_bridge a (1) =330-200=130, so a 1 Residual budget quota left_quota a (1) =130-90=40, here left_bridge a (1) And the hedget_quota a (1) Belonging to the same concept, all represent the current resource quota;
a 2 allocated to an allocated budget quota of 60, and left_budget a (2) =240-100=140, so a 2 Residual budget quota 140-60=80;
a 3 allocated budget quota 150, left_budget a (3) =450-400=50, so a 3 Residual budget quota 150-50=100, a needs to be 3 Reclaiming as reclaiming target information, namely, a second current residual budget left_widget u2 ＝100。
Second round of dispensing:
after the first round of allocation, the account still has 100 unallocated, i.e. the second current residual budget left_budget u2 =100, and a 1 Residual budget quota 40, a 2 Residual budget quota 80, so a 1 、a 2 For target information to be allocated, the target information of a is needed to be compared with the target information of a 1 、a 2 A second round of dispensing is performed.
Calculation of a 1 、a 2 θ of (2) i And lambda (lambda) i The calculation formula is as follows;
θ 1 ＝cost a (1)/(cost(1)+cost(2))＝0.66，λ 1 ＝cost a (i)/budget a (i)＝200/330＝0.6，θ 2 ＝cost a (2)/(cost(1)+cost(2))＝0.33，λ 2 ＝0.41。
according to theta i And lambda (lambda) i Calculation of a 1 、a 2 Competitive weight W of (2) 1 And W is equal to 2 The calculation formula is as follows:
according to W using a rapid ordering method i The advertisements are arranged in descending order: a, a 1 >a 2 。
Will left_bridge u2 Sequentially filling a 1 And a 2 Is a residual budget quota of:
from a 1 Initially, a is first applied 1 The remaining budget quota is filled, allocation 40; and then the rest is distributed to a 2 I.e. a 2 Dispensing 60;
final a 1 The allocated budget quota is 90+40=130, a 2 The allocated budget quota is 60+60=120, a 3 The allocated budget quota is 50.
According to the embodiment of the application, account budgets are allocated based on real-time consumption and real-time residual budgets of advertisements, current consumption and advertisement budgets of all advertisements which are online at present are firstly obtained from an advertisement engine, all account information is obtained according to account ids, then advertisements are grouped according to the account ids, the account budgets are allocated to all advertisements under the group in a group unit, so that the efficiency and accuracy of budget allocation are improved, meanwhile, the budget allocation is carried out with time as a period, after the current budget is allocated, the next allocation is carried out in a preset time, real-time competition conditions of the advertisements are fully considered, and the situation that budget quota allocated by the advertisements is fixed is avoided. In the first round of distribution, firstly, account consumption is calculated according to advertisement consumption of all advertisements in the group, then a first current residual budget is calculated according to a difference value between the account budget and the account consumption, and then the first current residual budget is distributed to each advertisement according to a smooth consumption ratio of each advertisement, so that not only can advertisements with quick consumption and more budgets be distributed with more budget quota, but also each advertisement can be distributed with the budget to participate in competition, and ecological enrichment is maintained. After the first round of allocation is finished, the account still has a second current residual budget which is not allocated, and a part of advertisements still have residual budget quota which can be allocated, so that the second current residual budget can be allocated to the part of advertisements according to the competitive weight of the advertisements until the second current residual budget is zero or the residual budget quota of each advertisement is zero. According to the embodiment of the application, through the two-round distribution, more account budget quota is distributed to the good advertisements, consumption of the whole account budget is accelerated, less budget quota is distributed to the advertisements with less residual budget, the consumption speed of the advertisements is slowed down, the online advertisement delivery time is prolonged, benefits of advertisers and platforms are facilitated, and the overrun ratio is reduced.
In practical application, after the resource allocation method provided by the embodiment of the application is used, the average online time of all advertisements on a platform is increased by 8.3%, the platform income is increased by 5.2%, as shown in fig. 8, the abscissa in fig. 8 is time, and the ordinate is an overrun proportion, and after the resource allocation method provided by the embodiment of the application is used from the beginning of an arrow, compared with the resource allocation method not used in the application, the overrun proportion of the advertisements is reduced by about 37%.
As shown in fig. 9, an embodiment of the present application provides a resource allocation apparatus, where the apparatus may include:
the first determining module 901 may be configured to determine a first current remaining resource of the target object based on current attribute information of the target object and current attribute information of at least one target information included in the target object.
The second determining module 903 may be configured to determine a smooth consumption ratio of each target information based on current attribute information of the target information and the first current remaining resource.
The first allocation module 905 may be configured to allocate the first current remaining resource to each target information according to a smooth consumption ratio of the target information, so as to obtain an allocated resource quota corresponding to the target information.
A third determining module 907 may be configured to determine, based on the allocated resource quota corresponding to each target information and current attribute information of the target information, a second current remaining resource of the target object and a target information set to be allocated.
The second allocation module 909 may be configured to determine a resource competitiveness of each target information to be allocated, and allocate the second current remaining resource to the target information to be allocated based on the resource competitiveness of the target information to be allocated.
In a possible embodiment, the current attribute information of the target information includes information consumption of the target information at a current time, and the current attribute information of the target object includes an object total resource of the target object at the current time, and the first determining module 901 may further include:
and an object consumption calculation unit, configured to calculate a sum of information consumption of each target information, and obtain object consumption of the target object.
The first current residual resource calculating unit can be used for calculating the difference value between the total resource of the object and the consumption of the object to obtain the first current residual resource.
In one possible embodiment, the second determining module 903 may further include:
The first smooth consumption calculation unit can be used for calculating the sum of the information consumption and the smoothing factor of each piece of target information to obtain first smooth consumption corresponding to the target information; wherein the smoothing factor characterizes a quotient of the first current remaining resource and the number of the target information.
And the second smooth consumption calculation unit can be used for calculating the sum of the object consumption and the first current residual resource to obtain second smooth consumption.
And a smooth consumption ratio calculation unit, configured to calculate a quotient of the first smooth consumption and the second smooth consumption corresponding to each piece of target information, and obtain a smooth consumption ratio of the target information.
In a possible embodiment, the first allocation module 905 may be further configured to calculate a product of the smooth consumption ratio of each target information and the first current remaining resource, to obtain an allocated resource quota corresponding to the target information.
In a possible embodiment, the third determining module 907 may further include:
the current resource quota calculating unit can be used for obtaining the current resource quota of the target information based on the difference value between the information total resource and the information consumption of each target information.
The resource quota comparison unit can be used for comparing the current resource quota of each piece of target information with the allocated resource quota of the target information.
The target information set determining unit may be configured to determine, as recovery target information, target information with the current resource quota being smaller than the allocated resource quota, to obtain a recovery target information set, and determine, as target information to be allocated, target information with the current resource quota being greater than the allocated resource quota, to obtain a target information set to be allocated.
The resource quota difference calculation unit can be used for calculating the difference value between the allocated resource quota of each piece of recovery target information and the current resource quota of the recovery target information to obtain a resource quota difference value corresponding to the recovery target information.
And the second current residual resource calculating unit can be used for calculating the sum of the resource quota difference values of each piece of recovery target information to obtain the second current residual resource.
In one possible embodiment, the second distribution module 909 may further include:
the relative consumption ratio calculation unit can be used for calculating the quotient of the information consumption of each piece of target information to be distributed and the sum of the information consumption to be distributed, so as to obtain the relative consumption ratio of the target information to be distributed; the sum of the consumption of the information to be distributed is the sum of the consumption of the information of each target information to be distributed.
The consumption resource ratio calculation unit may be configured to calculate a quotient of information consumption of each target information to be allocated and an information total resource of the target information to be allocated, to obtain a consumption resource ratio of the target information to be allocated.
And the competitive weight calculation unit can be used for obtaining the competitive weight of the target information to be distributed based on the product of the relative consumption ratio of each target information to be distributed and the index of the consumption resource ratio of the target information to be distributed.
The target information sequence to be allocated obtaining unit may be configured to sort each target information to be allocated in descending order according to the competitive weight, so as to obtain a target information sequence to be allocated.
The remaining resource quota calculating unit may be configured to calculate a difference between a current resource quota of each piece of target information to be allocated and an allocated resource quota of the target information to be allocated, to obtain a remaining resource quota corresponding to the target information to be allocated.
The second current remaining resource allocation unit may be configured to allocate the second current remaining resource to each target information to be allocated in sequence according to the target information sequence to be allocated based on a remaining resource quota of each target information to be allocated until the second current remaining resource is zero or the remaining resource quota of each target information to be allocated is zero.
In a possible embodiment, the apparatus may further include:
the resource allocation starting time recording module can be used for recording the current resource allocation starting time.
And the attribute information acquisition module can be used for acquiring the current attribute information of each piece of target information currently online and the current attribute information of the target object from the target information engine system.
And the write-back module can be used for writing back the allocated resources to the target information engine system.
And the resource allocation ending time recording module can be used for recording the current resource allocation ending time.
And the difference comparison module is used for comparing the difference between the resource allocation ending time and the resource allocation starting time with the first preset time.
And the reassignment module is used for restarting the resource assignment when the difference value is larger than the first preset time.
And the re-comparison module can be used for dormancy for a second preset time when the difference value is smaller than or equal to the first preset time, and re-comparing the difference value with the first preset time after the second preset time.
The embodiment of the application also provides a resource allocation device, which comprises a processor and a memory, wherein at least one instruction, at least one section of program, a code set or an instruction set is stored in the memory, and the at least one instruction, the at least one section of program, the code set or the instruction set is loaded and executed by the processor to realize the resource allocation method provided by the embodiment of the method.
Embodiments of the present application further provide a storage medium, where the storage medium may be configured in a terminal to store at least one instruction, at least one program, a code set, or an instruction set related to a method for implementing a resource allocation method in a method embodiment, where the at least one instruction, the at least one program, the code set, or the instruction set is loaded and executed by the processor to implement the resource allocation method provided in the method embodiment.
Alternatively, in the present description embodiment, the storage medium may be located in at least one network server among a plurality of network servers of the computer network. Alternatively, in the present embodiment, the storage medium may include, but is not limited to: a U-disk, a Read-Only Memory (ROM), a random access Memory (Random Access Memory, RAM), a removable hard disk, a magnetic disk, or an optical disk, or other various media capable of storing program codes.
The memory according to the embodiments of the present disclosure may be used to store software programs and modules, and the processor executes the software programs and modules stored in the memory to perform various functional applications and data processing. The memory may mainly include a storage program area and a storage data area, wherein the storage program area may store an operating system, application programs required for functions, and the like; the storage data area may store data created according to the use of the device, etc. In addition, the memory may include high-speed random access memory, and may also include non-volatile memory, such as at least one magnetic disk storage device, flash memory device, or other volatile solid-state storage device. Accordingly, the memory may also include a memory controller to provide access to the memory by the processor.
The resource allocation method embodiments provided in the embodiments of the present application may be executed in a mobile terminal, a computer terminal, a server, or similar computing devices. Taking the operation on the server as an example, fig. 10 is a block diagram of a hardware structure of the server of a resource allocation method according to an embodiment of the present application. As shown in fig. 10, the server 1000 may vary considerably in configuration or performance and may include one or more central processing units (Central Processing Units, CPU) 1010 (the processor 1210 may include, but is not limited to, a microprocessor MCU or a processing device such as a programmable logic device FPGA), a memory 1030 for storing data, one or more storage mediums 1020 (e.g., one or more mass storage devices) for storing applications 1023 or data 1022. Wherein the memory 1030 and storage medium 1020 can be transitory or persistent storage. The program stored on the storage medium 1020 may include one or more modules, each of which may include a series of instruction operations on a server. Still further, the central processor 1010 may be configured to communicate with a storage medium 1020 and execute a series of instruction operations in the storage medium 1020 on the server 1000. The server 1000 may also include one or more power supplies 1060, one or more wired or wireless network interfaces 1050, one or more input/output interfaces 1040, and/or one or more operating systems 1021, such as Windows ServerTM, mac OS XTM, unixTM, linuxTM, freeBSDTM, and the like.
Input-output interface 1040 may be used to receive or transmit data via a network. The specific example of the network described above may include a wireless network provided by a communication provider of the server 1000. In one example, input-output interface 1040 includes a network adapter (Network Interface Controller, NIC) that may be connected to other network devices via base stations to communicate with the internet. In one example, the input-output interface 1040 may be a Radio Frequency (RF) module for communicating with the internet wirelessly.
It will be appreciated by those of ordinary skill in the art that the configuration shown in fig. 10 is merely illustrative and is not intended to limit the configuration of the electronic device described above. For example, the server 1000 may also include more or fewer components than shown in fig. 10, or have a different configuration than shown in fig. 10.
It should be noted that: the foregoing sequence of the embodiments of the present application is only for describing, and does not represent the advantages and disadvantages of the embodiments. And the foregoing description has been directed to specific embodiments of this specification. Other embodiments are within the scope of the following claims. In some cases, the actions or steps recited in the claims can be performed in a different order than in the embodiments and still achieve desirable results. In addition, the processes depicted in the accompanying figures do not necessarily require the particular order shown, or sequential order, to achieve desirable results. In some embodiments, multitasking and parallel processing are also possible or may be advantageous.
In this specification, each embodiment is described in a progressive manner, and identical and similar parts of each embodiment are all referred to each other, and each embodiment mainly describes differences from other embodiments. In particular, for the device and server embodiments, since they are substantially similar to the method embodiments, the description is relatively simple, and references to the parts of the description of the method embodiments are only required.
It will be understood by those skilled in the art that all or part of the steps for implementing the above embodiments may be implemented by hardware, or may be implemented by a program for instructing relevant hardware, where the program may be stored in a computer readable storage medium, and the storage medium may be a read-only memory, a magnetic disk or an optical disk, etc.
The foregoing description of the preferred embodiments of the present application is not intended to limit the invention to the particular embodiments of the present application, but to limit the scope of the invention to the particular embodiments of the present application.
Claims (6)
1. A method of resource allocation, the method comprising:
determining a first current residual resource of a target object based on current attribute information of the target object and current attribute information of at least one target information included in the target object; the current attribute information of the target information comprises information consumption and information total resources of the target information at the current time, and the current attribute information of the target object comprises object total resources of the target object at the current time;
Determining a smooth consumption ratio of each target information based on current attribute information of the target information and the first current remaining resources, including: calculating the sum of the information consumption and the smoothing factor of each piece of target information to obtain first smoothing consumption corresponding to the target information; calculating the sum of the object consumption and the first current residual resource to obtain second smooth consumption; calculating a quotient of the first smooth consumption and the second smooth consumption corresponding to each piece of target information to obtain the smooth consumption ratio; wherein the smoothing factor characterizes a quotient of the first current remaining resource and the number of the target information; the object consumption is the sum of information consumption of each target information;
distributing the first current residual resources to the target information according to the smooth consumption ratio of each target information to obtain distributed resource quota corresponding to the target information, wherein the distributed resource quota comprises the following components: calculating the product of the smooth consumption ratio of each piece of target information and the first current residual resource to obtain the allocated resource quota;
determining a second current residual resource of the target object and a target information set to be allocated based on the allocated resource quota corresponding to each target information and the current attribute information of the target information, wherein the method comprises the following steps: obtaining the current resource quota of each target information based on the difference value between the information total resource and the information consumption of each target information; comparing the current resource quota of each piece of target information with the allocated resource quota of the target information; determining target information of which the current resource quota is smaller than the allocated resource quota as recovery target information to obtain a recovery target information set, and determining target information of which the current resource quota is larger than the allocated resource quota as target information to be allocated to obtain a target information set to be allocated; calculating the difference value of the allocated resource quota of each piece of recovery target information and the current resource quota of the recovery target information to obtain a resource quota difference value corresponding to the recovery target information; calculating the sum of the resource quota difference values of each piece of recovery target information to obtain the second current residual resource;
Determining the resource competitiveness of each piece of target information to be allocated, allocating the second current residual resource to the target information to be allocated based on the resource competitiveness of the target information to be allocated, including: calculating the quotient of the information consumption of each piece of target information to be distributed and the sum of the information consumption to be distributed, and obtaining the relative consumption ratio of the target information to be distributed; the sum of the consumption of the information to be distributed is the sum of the consumption of the information of each target information to be distributed; calculating the quotient of the information consumption of each piece of target information to be allocated and the total information resource of the target information to be allocated, and obtaining the consumption resource ratio of the target information to be allocated; obtaining the competitive weight of the target information to be distributed based on the product of the relative consumption ratio of each target information to be distributed and the index of the consumption resource ratio of the target information to be distributed; sorting each piece of target information to be distributed in a descending order according to the competitive weight to obtain a target information sequence to be distributed; calculating the difference value between the current resource quota of each piece of target information to be allocated and the allocated resource quota of the target information to be allocated to obtain the residual resource quota corresponding to the target information to be allocated; and based on the residual resource quota of each piece of target information to be allocated, sequentially allocating the second current residual resource to each piece of target information to be allocated according to the target information sequence to be allocated until the second current residual resource is zero or the residual resource quota of each piece of target information to be allocated is zero.
2. The method of claim 1, wherein the determining the first current remaining resource of the target object based on the current attribute information of the target object and the current attribute information of the at least one target information included in the target object comprises:
calculating the sum of information consumption of each piece of target information to obtain the object consumption;
and calculating the difference value between the total resource of the object and the consumption of the object to obtain the first current residual resource.
3. The method of claim 1, wherein the step of determining the position of the substrate comprises,
before the determining the first current remaining resource of the target object based on the current attribute information of the target object and the current attribute information of the at least one target information included in the target object, the method further includes:
recording the current resource allocation starting time;
acquiring current attribute information of each piece of target information currently online and current attribute information of the target object from a target information engine system;
after the allocating the second current remaining resource to the target information to be allocated, the method further includes:
the allocated resources are written back to the target information engine system;
Recording the current resource allocation ending time;
comparing the difference between the resource allocation ending time and the resource allocation starting time with a first preset time;
when the difference value is larger than the first preset time, restarting resource allocation;
and when the difference value is smaller than or equal to the first preset time, dormancy is performed for a second preset time, and the difference value is compared with the first preset time again after the second preset time.
4. A resource allocation apparatus, the apparatus comprising:
a first determining module, configured to determine a first current remaining resource of a target object based on current attribute information of the target object and current attribute information of at least one target information included in the target object; the current attribute information of the target information comprises information consumption and information total resources of the target information at the current time, and the current attribute information of the target object comprises object total resources of the target object at the current time;
the second determining module is used for determining the smooth consumption ratio of the target information based on the current attribute information of each target information and the first current residual resources; the second determining module includes: a first smooth consumption calculation unit, configured to calculate a sum of information consumption and a smoothing factor of each target information, to obtain first smooth consumption corresponding to the target information; a second smooth consumption calculation unit, configured to calculate a sum of an object consumption and the first current remaining resource, to obtain a second smooth consumption; a smooth consumption ratio calculation unit configured to calculate a quotient of a first smooth consumption and the second smooth consumption corresponding to each target information, to obtain the smooth consumption ratio; wherein the smoothing factor characterizes a quotient of the first current remaining resource and the number of the target information; the object consumption is the sum of information consumption of each target information;
The first allocation module is used for calculating the product of the smooth consumption ratio of each piece of target information and the first current residual resource to obtain allocation resource quota corresponding to the target information;
the third determining module is used for determining a second current residual resource of the target object and a target information set to be allocated based on the allocated resource quota corresponding to each target information and the current attribute information of the target information; the third determination module includes: the current resource quota calculating unit is used for obtaining the current resource quota of the target information based on the difference value of the information total resource and the information consumption of each target information; a resource quota comparing unit, configured to compare a current resource quota of each piece of target information with a size of an allocated resource quota of the target information; the target information set determining unit is used for determining target information of which the current resource quota is smaller than the allocated resource quota as recovery target information to obtain a recovery target information set, and determining target information of which the current resource quota is larger than the allocated resource quota as target information to be allocated to obtain a target information set to be allocated; a resource quota difference calculation unit, configured to calculate a difference between an allocated resource quota of each piece of recovery target information and a current resource quota of the recovery target information, to obtain a resource quota difference corresponding to the recovery target information; a second current residual resource calculation unit, configured to calculate a sum of resource quota difference values of each piece of recovery target information, to obtain the second current residual resource;
A second allocation module, configured to determine a resource competitiveness of each target information to be allocated, and allocate the second current remaining resource to the target information to be allocated based on the resource competitiveness of the target information to be allocated, where the second allocation module includes: the relative consumption ratio calculation unit is used for calculating the quotient of the information consumption of each piece of target information to be distributed and the sum of the information consumption to be distributed, and obtaining the relative consumption ratio of the target information to be distributed; the sum of the consumption of the information to be distributed is the sum of the consumption of the information of each target information to be distributed; the consumption resource ratio calculation unit is used for calculating the quotient of the information consumption of each piece of target information to be allocated and the total information resource of the target information to be allocated to obtain the consumption resource ratio of the target information to be allocated; a competitive weight calculation unit, configured to obtain a competitive weight of each target information to be allocated based on a product of a relative consumption ratio of the target information to be allocated and an index of a consumption resource ratio of the target information to be allocated; the target information sequence to be distributed is obtained by sequencing each piece of target information to be distributed in descending order according to the competitive weight; a remaining resource quota calculating unit, configured to calculate a difference value between a current resource quota of each piece of target information to be allocated and an allocated resource quota of the target information to be allocated, to obtain a remaining resource quota corresponding to the target information to be allocated; and the second current residual resource allocation unit is used for allocating the second current residual resource to each piece of target information to be allocated according to the target information sequence to be allocated based on the residual resource quota of each piece of target information to be allocated until the second current residual resource is zero or the residual resource quota of each piece of target information to be allocated is zero.
5. An apparatus for resource allocation, the apparatus comprising: a processor and a memory having stored therein at least one instruction, at least one program, code set or instruction set, the at least one instruction, the at least one program, the code set or instruction set being loaded and executed by the processor to implement the resource allocation method of any of claims 1-3.
6. A computer readable storage medium having stored therein at least one instruction, at least one program, a set of codes, or a set of instructions, the at least one instruction, the at least one program, the set of codes, or the set of instructions being loaded and executed by a processor to implement the resource allocation method of any one of claims 1-3.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910576167.5A CN112150181B (en) | 2019-06-28 | 2019-06-28 | Resource allocation method, device, equipment and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910576167.5A CN112150181B (en) | 2019-06-28 | 2019-06-28 | Resource allocation method, device, equipment and storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN112150181A CN112150181A (en) | 2020-12-29 |
| CN112150181B true CN112150181B (en) | 2024-04-16 |
Family
ID=73870114
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910576167.5A Active CN112150181B (en) | 2019-06-28 | 2019-06-28 | Resource allocation method, device, equipment and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112150181B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112836971A (en) * | 2021-02-04 | 2021-05-25 | 北京明略昭辉科技有限公司 | Quota resource determination method and device, electronic equipment and storage medium |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106485535A (en) * | 2015-08-25 | 2017-03-08 | 阿里巴巴集团控股有限公司 | The system of selection of publicity orders and device, management system |
| CN108256878A (en) * | 2016-12-28 | 2018-07-06 | 北京奇虎科技有限公司 | One kind is super to throw control method, device and equipment |
| CN108269123A (en) * | 2017-12-29 | 2018-07-10 | 广东神马搜索科技有限公司 | Control method and device are launched in advertisement |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20150161662A1 (en) * | 2013-12-10 | 2015-06-11 | Acquisio | System and Method for Directing Online Advertising Across Multiple Channels |
| US20170061473A1 (en) * | 2015-08-31 | 2017-03-02 | Linkedin Corporation | Managing online ad serving |
-
2019
- 2019-06-28 CN CN201910576167.5A patent/CN112150181B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106485535A (en) * | 2015-08-25 | 2017-03-08 | 阿里巴巴集团控股有限公司 | The system of selection of publicity orders and device, management system |
| CN108256878A (en) * | 2016-12-28 | 2018-07-06 | 北京奇虎科技有限公司 | One kind is super to throw control method, device and equipment |
| CN108269123A (en) * | 2017-12-29 | 2018-07-10 | 广东神马搜索科技有限公司 | Control method and device are launched in advertisement |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112150181A (en) | 2020-12-29 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107659433B (en) | Cloud resource scheduling method and equipment | |
| Levin et al. | DP-FAIR: A simple model for understanding optimal multiprocessor scheduling | |
| CN107291546B (en) | Resource scheduling method and device | |
| CN108234581B (en) | Resource scheduling method and server | |
| US9009719B2 (en) | Computer workload capacity estimation using proximity tables | |
| US11436667B2 (en) | Pure-spot and dynamically rebalanced auto-scaling clusters | |
| CN106453146B (en) | Method, system, device and readable storage medium for allocating private cloud computing resources | |
| CN107124472A (en) | Load-balancing method and device, computer-readable recording medium | |
| CN109325825B (en) | Flow data regulation and control method and device | |
| CN111225050A (en) | Cloud computing resource allocation method and device | |
| CN111798113A (en) | Resource allocation method, device, storage medium and electronic equipment | |
| JP2017514247A5 (en) | ||
| CN112150181B (en) | Resource allocation method, device, equipment and storage medium | |
| CN110009233A (en) | Based on the method for allocating tasks of game theory in intelligent perception | |
| Mashayekhy et al. | Truthful mechanisms for competitive reward-based scheduling | |
| CN111796933B (en) | Resource scheduling method, device, storage medium and electronic equipment | |
| CN103942109A (en) | Self-adaptation task scheduling method based on multi-core DSP | |
| Salehan et al. | An online valuation-based sealed winner-bid auction game for resource allocation and pricing in clouds | |
| CN110413393B (en) | Cluster resource management method and device, computer cluster and readable storage medium | |
| Vardi et al. | Dynamic fair resource division | |
| CN108876446B (en) | Consumption resource allocation method, device and equipment | |
| CN109189581B (en) | Job scheduling method and device | |
| CN116010051A (en) | Federal learning multitasking scheduling method and device | |
| CN111796934B (en) | Task issuing method and device, storage medium and electronic equipment | |
| CN108429704B (en) | Node resource allocation method and device |
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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |