CN112149964A - Resource allocation method and device - Google Patents
Resource allocation method and device Download PDFInfo
- Publication number
- CN112149964A CN112149964A CN202010917654.6A CN202010917654A CN112149964A CN 112149964 A CN112149964 A CN 112149964A CN 202010917654 A CN202010917654 A CN 202010917654A CN 112149964 A CN112149964 A CN 112149964A
- Authority
- CN
- China
- Prior art keywords
- resource
- sub
- resources
- demander
- pool
- 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
- 238000013468 resource allocation Methods 0.000 title claims abstract description 52
- 238000000034 method Methods 0.000 title claims abstract description 45
- 238000004590 computer program Methods 0.000 claims description 17
- 238000004891 communication Methods 0.000 claims description 16
- 238000003860 storage Methods 0.000 claims description 14
- 238000009826 distribution Methods 0.000 abstract description 10
- 238000010586 diagram Methods 0.000 description 10
- 230000000694 effects Effects 0.000 description 8
- 238000005516 engineering process Methods 0.000 description 8
- 230000008569 process Effects 0.000 description 6
- 230000006870 function Effects 0.000 description 5
- 238000012545 processing Methods 0.000 description 5
- 230000005236 sound signal Effects 0.000 description 4
- 230000007246 mechanism Effects 0.000 description 3
- 230000003287 optical effect Effects 0.000 description 3
- 241000282326 Felis catus Species 0.000 description 2
- 238000007726 management method Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000003068 static effect Effects 0.000 description 2
- 230000009471 action Effects 0.000 description 1
- 230000005540 biological transmission Effects 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 230000006872 improvement Effects 0.000 description 1
- 239000004973 liquid crystal related substance Substances 0.000 description 1
- 238000004519 manufacturing process Methods 0.000 description 1
- 238000010295 mobile communication Methods 0.000 description 1
- 238000012544 monitoring process Methods 0.000 description 1
- 239000002699 waste material Substances 0.000 description 1
Images
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
- G06Q10/00—Administration; Management
- G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
- G06Q10/063—Operations research, analysis or management
- G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
- G06Q10/06315—Needs-based resource requirements planning or analysis
Landscapes
- Business, Economics & Management (AREA)
- Human Resources & Organizations (AREA)
- Engineering & Computer Science (AREA)
- Strategic Management (AREA)
- Entrepreneurship & Innovation (AREA)
- Economics (AREA)
- Operations Research (AREA)
- Game Theory and Decision Science (AREA)
- Development Economics (AREA)
- Marketing (AREA)
- Educational Administration (AREA)
- Quality & Reliability (AREA)
- Tourism & Hospitality (AREA)
- Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The embodiment of the application provides a resource allocation method and device. In the embodiment of the application, the corresponding sub-resource pool is allocated to each resource demander, each resource demander preferentially requests resources from the sub-resource pool of each resource demander, and when the resources in the sub-resource pool of each resource demander are insufficient, the resources can be requested from other sub-resource pools with the adjustable resources. Therefore, each resource demander has the own sub-resource pool, so that each resource demander can be ensured to distribute resources, the technical problem of unreasonable resource distribution caused by sequentially distributing the requested resources to each resource demander according to the sequence of the resource requesting time is effectively solved, and more reasonable resource distribution is realized. Meanwhile, the method also supports the request of any resource demander for resources from other sub-resource pools, and ensures that the resources can be allocated when the sub-resource pool of any resource demander is insufficient, so that the resources are allocated more reasonably.
Description
Technical Field
The present application relates to the field of resource processing technologies, and in particular, to a resource allocation method and apparatus.
Background
Currently, each resource demander requests resources from the same resource provider. And the resource provider distributes the requested resources to each resource demander in turn according to the sequence of the morning and the evening of the resource requesting time. If the number of resources requested by the resource demanding side having an earlier resource requesting timing is large, the resource provider may easily provide insufficient resources. Thus, a resource requester who has a later opportunity to request a resource is likely to be unable to allocate the resource. Therefore, a scheme for more reasonably allocating resources is needed.
Disclosure of Invention
Aspects of the present disclosure provide a method and apparatus for allocating resources to more reasonably allocate resources.
An embodiment of the present application provides a resource allocation method, including:
performing initial allocation on resources in the resource pool to obtain a sub-resource pool corresponding to each resource demand party;
responding to a resource request initiated by each resource demander, and performing resource allocation on each resource demander from a sub-resource pool corresponding to each resource demander; and
under the condition that the first sub-resource pool with insufficient resources exists, whether the other sub-resource pools have the resources which can be allocated or not is estimated according to historical resource use information and/or resource use plan information of resource demanders corresponding to the other sub-resource pools;
and selecting a second sub-resource pool with the available adjustable resources from other sub-resource pools, and controlling a first resource demander corresponding to the first sub-resource pool to use the adjustable resources in the second sub-resource pool.
An embodiment of the present application further provides a resource allocation apparatus, including: a memory, a processor, and a communications component;
the memory for storing a computer program;
the processor, coupled with the memory, to execute the computer program to:
performing initial allocation on resources in the resource pool to obtain a sub-resource pool corresponding to each resource demand party;
responding to a resource request initiated by each resource demander through the communication assembly, and performing resource allocation on each resource demander from a sub-resource pool corresponding to each resource demander; and
under the condition that the first sub-resource pool with insufficient resources exists, whether the other sub-resource pools have the resources which can be allocated or not is estimated according to historical resource use information and/or resource use plan information of resource demanders corresponding to the other sub-resource pools;
and selecting a second sub-resource pool with the available adjustable resources from other sub-resource pools, and controlling a first resource demander corresponding to the first sub-resource pool to use the adjustable resources in the second sub-resource pool.
Embodiments of the present application further provide a computer-readable storage medium storing a computer program, which, when executed by a processor, causes the processor to implement the steps in the resource allocation method.
According to the resource allocation method and device provided by the embodiment of the application, the corresponding sub-resource pool is allocated to each resource demander, each resource demander preferentially requests resources from the sub-resource pool of each resource demander, and when the resources in the sub-resource pool of each resource demander are insufficient, the resources can be requested from other sub-resource pools with the adjustable resources. Therefore, each resource demander has the own sub-resource pool, so that each resource demander can be ensured to distribute resources, the technical problem of unreasonable resource distribution caused by sequentially distributing the requested resources to each resource demander according to the sequence of the resource requesting time is effectively solved, and more reasonable resource distribution is realized. Meanwhile, the method also supports the request of any resource demander for resources from other sub-resource pools, and ensures that any resource demander can allocate resources when the sub-resource pool of the resource demander is insufficient, so that the resource allocation is more reasonable.
Drawings
The accompanying drawings, which are included to provide a further understanding of the application and are incorporated in and constitute a part of this application, illustrate embodiment(s) of the application and together with the description serve to explain the application and not to limit the application. In the drawings:
fig. 1 is a flowchart illustrating a resource allocation method according to an exemplary embodiment of the present application;
FIG. 2 is an exemplary budget allocation map;
fig. 3 is a flowchart illustrating a resource allocation method according to another exemplary embodiment of the present application;
fig. 4 is a schematic structural diagram of a resource allocation apparatus according to an exemplary embodiment of the present application.
Detailed Description
In order to make the objects, technical solutions and advantages of the present application more apparent, the technical solutions of the present application will be described in detail and completely with reference to the following specific embodiments of the present application and the accompanying drawings. It should be apparent that the described embodiments are only some of the embodiments of the present application, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present application.
Aiming at the technical problem of unreasonable resource allocation in the prior art, the embodiment of the application provides a solution, and the basic idea is as follows: and when the resources in the sub-resource pool of each resource demander are insufficient, the resources can be requested from other sub-resource pools with the adjustable resources. Therefore, each resource demander has the own sub-resource pool, so that each resource demander can be ensured to distribute resources, the technical problem of unreasonable resource distribution caused by sequentially distributing the requested resources to each resource demander according to the sequence of the resource requesting time is effectively solved, and more reasonable resource distribution is realized. Meanwhile, the method also supports the request of any resource demander for resources from other sub-resource pools, and ensures that any resource demander can allocate resources when the sub-resource pool of the resource demander is insufficient, so that the resource allocation is more reasonable.
The technical solutions provided by the embodiments of the present application are described in detail below with reference to the accompanying drawings.
Fig. 1 is a flowchart illustrating a resource allocation method according to an exemplary embodiment of the present application. As shown in fig. 1, the method comprises the steps of:
In this embodiment, the resource may be any form of resource such as a storage resource, a network bandwidth resource, an active budget, and the like, but is not limited thereto.
In this embodiment, the resource pool and the sub-resource pool can be both understood as an abstract object for maintaining and managing resources. The resource pool and the sub-resource pool may allocate resources owned by the resource pool and the sub-resource pool, may record the destination of the allocated resources, and may also count the number of remaining resources in the resource pool, of course, the functions of the resource pool and the sub-resource pool are not limited thereto.
In this embodiment, the resource demanding party may be understood as a party that needs resources to process the service. In order to ensure that each resource demander can allocate resources, a sub-resource pool of each resource demander is created, so that when each resource demander needs resources, the resources can be acquired from the sub-resource pool of each resource demander.
In this embodiment, the resources in the resource pool are allocated to each sub-resource pool by initially allocating the resources in the resource pool. It should be noted that, when the resources in the resource pool are initially allocated, the allocation may be performed according to the actual service requirement. For example, the initial allocation may be made according to resource usage plan information for each resource demander. The amount of the resource which is planned to be used by the resource demander can be obtained through the resource use plan information. At the initial allocation, a quantity of resources greater than or equal to the resource demander's planned use may be allocated. For example, when the resource is a storage resource, the number of resources planned to be used by a certain resource demander is greater than or equal to 1000G, and then the number of storage resources in the sub-resource pool that can be allocated to the resource demander is greater than or equal to 1000G. When the resource is a network bandwidth resource, the network bandwidth resource planned to be used by a certain resource demander is 2M/sec, and the network bandwidth resource in the sub-resource pool which can be allocated to the resource demander is greater than or equal to 2M/sec. Taking resources as an active budget as an example, if the amount of resources planned to be used by a certain resource demander is 1 ten thousand blocks, the amount of funds in the sub-resource pool that can be allocated to the resource demander is greater than or equal to 1 ten thousand blocks.
In this embodiment, for a resource request initiated by any resource demander, resource allocation is performed for the resource demander from its own sub-resource pool.
In a practical situation, a situation may arise where the amount of resources in the resource demander's own sub-resource pool may be insufficient, leading to a situation that may have a number of factors. For example, the resource demander may allocate resources from its sub-resource pool several times, resulting in insufficient amount of resources in its sub-resource pool. For another example, the resource demander temporarily changes the resource usage plan, the number of resources requested by a resource request initiated at a certain time is large, and after a certain time of resource allocation, the number of resources in its own sub-resource pool may be insufficient.
Therefore, in order to ensure that the resource demander can allocate resources each time as much as possible, the number of resources in the sub-resource pool corresponding to each resource demander can be monitored, and when the condition that the sub-resource pool with insufficient resources appears is monitored, the resource shortage early warning can be carried out, so that the resource allocation strategy can be adjusted quickly.
And 103, under the condition that the first sub-resource pool has insufficient resources, estimating whether the other sub-resource pools have the resources which can be allocated or not according to historical resource use information and/or resource use plan information of the resource demander corresponding to the other sub-resource pools.
In this embodiment, when the first sub-resource pool with insufficient resources is monitored, the resource allocation apparatus may send an acquisition request to the resource demander corresponding to the other sub-resource pool to request the historical resource usage information and/or the resource usage plan information provided by the corresponding resource demander. After the historical resource use information and/or the resource use plan information provided by the resource demander corresponding to the other sub-resource pools are obtained, whether the resource which can be allocated exists in the other sub-resource pools is judged by analyzing the historical resource use information and/or the resource use plan information of the resource demander corresponding to the other sub-resource pools. Wherein, the other sub-resource pool refers to a sub-resource pool except the first sub-resource pool.
It can be understood that, by analyzing the historical resource usage information, the most available resources of the resource demander corresponding to the other sub-resource pool can be estimated, and the resource initially allocated to the other sub-resource pool is subtracted by the "most available resources", so as to determine whether the other sub-resource pool has the remaining resources, that is, whether the allocatable resources exist in the other sub-resource pool is estimated.
It can be understood that, by analyzing the resource usage plan information, the amount of the resource planned to be used by the resource demander can be obtained, and whether the other sub-resource pools have the remaining resources can be estimated by combining the resources initially allocated to the other sub-resource pools. If the other sub-resource pool has the residual resources, the existence of the resource which can be allocated in the other sub-resource pool is estimated.
It should be noted that, it is also possible to predict whether there are any allocatable resources in other sub-resource pools by combining the history resource usage information and the resource usage plan information.
And 104, selecting a second sub-resource pool with the adjustable resources from the other sub-resource pools, and controlling a first resource demander corresponding to the first sub-resource pool to use the adjustable resources in the second sub-resource pool.
In this embodiment, the number of the second sub resource pools in which the tunable resources exist may be one or multiple. When the number of the resource demand parties is one, the first resource demand party corresponding to the first sub-resource pool can be controlled to use the adjustable resources in the second sub-resource pool. When the number of the first sub-resource pools is multiple, the first resource demander corresponding to the first sub-resource pool can be controlled to respectively use the adjustable resources in each second sub-resource pool, so that the phenomenon that the resources of the second sub-resource pools are insufficient due to the fact that the resources are only allocated from one second sub-resource pool can be effectively avoided. Of course, when the number of the second sub-resource pools is multiple, the tunable resource in one of the second sub-resource pools may also be used, depending on the actual situation.
In this embodiment, there may be a plurality of ways to select the second sub-resource pool in which the tunable resources exist from the other sub-resource pools.
For example, according to the sequence from the large number of the tunable dial resources to the small number of the tunable dial resources, the first N sub-resource pools with the tunable dial resources are selected from the other sub-resource pools as the second sub-resource pool, where N is a positive integer.
For another example, selecting a second sub-resource pool from the other sub-resource pools for which there are callable resources includes: selecting the first N sub-resource pools with the adjustable dialing resources from other sub-resource pools according to the sequence of the number of the adjustable dialing resources from large to small, wherein N is a positive integer; sending a resource allocation and approval request to a target approver, wherein the target approver is an approver of the first N sub-resource pools with the adjustable and approvable resources; and if an approval result of agreeing to resource allocation returned by the target approving party is received, determining the sub-resource pool corresponding to the target approving party as a second sub-resource pool with the resource which can be allocated.
In this embodiment, the first N sub-resource pools with the tunable and dialable resources are selected first, so that it is ensured that the selected sub-resource pools with the tunable and dialable resources are not likely to have insufficient resources after the resources are allocated. The target approver is introduced to approve the resource allocation, so that the resource allocation among the sub-resource pools can be controlled more effectively.
FIG. 2 is an exemplary budget allocation map. Taking the marketing subject as the treasure, the marketing subject holds the item, for example, double 11, and the activities held by double 11 include activity a, activity B, and the like, the activity a is, for example, a house piling, and the activity B is, for example, a cat catching. The total budget pool of the treasure is 10 thousands of money, 5 out of 10 thousands of money are allocated to the stockpile house, and 5 out of 10 thousands of money are allocated to the cat trap. The resource allocated by the budget of the A activity is distributed in a mode of sending a coupon to the user and sending a red packet to the user. The resource of budget allocation of the B activity is issued in the form of issuing third party tickets.
The resource allocation method provided by the embodiment of the application allocates the corresponding sub-resource pools to each resource demander, each resource demander preferentially requests resources from the sub-resource pools of the resource demander, and when the resources in the sub-resource pools of each resource demander are insufficient, the resources can be requested from other sub-resource pools with the adjustable and allocatable resources. Therefore, each resource demander has the own sub-resource pool, so that each resource demander can be ensured to distribute resources, the technical problem of unreasonable resource distribution caused by sequentially distributing the requested resources to each resource demander according to the sequence of the resource requesting time is effectively solved, and more reasonable resource distribution is realized. Meanwhile, the method also supports the request of any resource demander for resources from other sub-resource pools, and ensures that the resources can be allocated when the sub-resource pool of any resource demander is insufficient, so that the resources are allocated more reasonably.
Fig. 3 is a flowchart illustrating a resource allocation method according to another exemplary embodiment of the present application. On the basis of the embodiment shown in fig. 1, in the embodiment, before resource allocation is performed for each resource demander from a sub-resource pool corresponding to each resource demander, the amount of resources requested to be allocated by each resource demander is checked, and resource allocation is performed only after the checking is passed.
As shown in fig. 3, the resource allocation method may include the steps of:
It should be noted that the implementation manner of step 201 is the same as that of step 101 in the above embodiment, and is not described herein again.
And step 204, determining that the received approval result agreeing to allocate the resource to the resource demand side is received.
In this embodiment, the preset resource quantity threshold is set according to an actual service requirement, and the preset resource quantity thresholds corresponding to different resource demanders may be the same threshold or different thresholds.
In this embodiment, the amount of resources requested to be allocated by any resource demander is monitored, and if it is determined that the amount of resources requested to be allocated by the resource demander is not greater than the preset threshold value of the amount of resources, it indicates that the amount of resources requested to be allocated by the resource demander is not large, and at this time, the resources may be directly allocated to the resource demander. Otherwise, if the quantity of the resources requested to be allocated by the resource demander is judged to be larger than the preset threshold value of the quantity of the resources, the quantity of the resources requested to be allocated by the resource demander is large, an approval mechanism needs to be introduced, and the resources are allocated to the resource demander only when the approval is passed.
In this embodiment, the amount of resources requested to be allocated by each resource demander is checked, and after the checking is passed, resource allocation is performed for each resource demander from its own sub-resource pool.
In a practical situation, a situation may arise where the amount of resources in the resource demander's own sub-resource pool may be insufficient, leading to a situation that may have a number of factors. For example, the resource demander may allocate resources from its sub-resource pool several times, resulting in insufficient amount of resources in its sub-resource pool. For another example, the resource demander temporarily changes the resource usage plan, the number of resources requested by a resource request initiated at a certain time is large, and after a certain time of resource allocation, the number of resources in its own sub-resource pool may be insufficient.
Therefore, in order to ensure that the resource demander can allocate resources each time as much as possible, the number of resources in the sub-resource pool corresponding to each resource demander can be monitored, and when the condition that the sub-resource pool with insufficient resources appears is monitored, the resource shortage early warning can be carried out, so that the resource allocation strategy can be adjusted quickly.
And step 206, under the condition that the first sub-resource pool with insufficient resources appears, estimating whether the other sub-resource pools have the resources which can be allocated or not according to historical resource use information and/or resource use plan information of the resource demander corresponding to the other sub-resource pools.
It should be noted that the implementation manner of step 206 is the same as that of step 103 in the above embodiment, and is not described herein again.
And step 207, selecting a second sub-resource pool with the adjustable resources from the other sub-resource pools, and controlling a first resource demander corresponding to the first sub-resource pool to use the adjustable resources in the second sub-resource pool.
It should be noted that the implementation manner of step 207 is the same as that of step 104 in the above embodiment, and is not described herein again.
The resource allocation method provided by the embodiment of the application allocates the corresponding sub-resource pools to each resource demander; monitoring the quantity of resources requested to be allocated by each resource demander, introducing an approval mechanism when the quantity of the resources requested to be allocated by the resource demander is more, and requesting the resources from a sub-resource pool of each resource demander only when approval is passed; and when the resources in the sub-resource pool of each resource demand party are insufficient, the resources can be requested from other sub-resource pools with the adjustable resources. Therefore, each resource demander has the own sub-resource pool, so that each resource demander can be ensured to distribute resources, the technical problem of unreasonable resource distribution caused by sequentially distributing the requested resources to each resource demander according to the sequence of the resource requesting time is effectively solved, and more reasonable resource distribution is realized. Meanwhile, the method also supports the request of any resource demander for resources from other sub-resource pools, and ensures that the resources can be allocated when the sub-resource pool of any resource demander is insufficient, so that the resources are allocated more reasonably. Meanwhile, the quantity of the resources requested to be allocated by any resource demander is monitored, an approval mechanism is introduced when the quantity of the resources requested to be allocated by the resource demander is monitored to be large, and the resources are allocated to the resource demander only after approval is passed. Therefore, the situation that the quantity of resources requested by one time is too large can be prevented as much as possible, the resource waste is avoided as much as possible, and the reasonable use of the resources is facilitated.
It should be noted that the execution subjects of the steps of the methods provided in the above embodiments may be the same device, or different devices may be used as the execution subjects of the methods. For example, the execution subjects of steps 101 to 104 may be device a; for another example, the execution subject of steps 101 and 103 may be device a, and the execution subject of step 104 may be device B; and so on.
In addition, in some of the flows described in the above embodiments and the drawings, a plurality of operations are included in a specific order, but it should be clearly understood that the operations may be executed out of the order presented herein or in parallel, and the sequence numbers of the operations, such as 101, 102, etc., are merely used for distinguishing different operations, and the sequence numbers do not represent any execution order per se. Additionally, the flows may include more or fewer operations, and the operations may be performed sequentially or in parallel. It should be noted that, the descriptions of "first", "second", etc. in this document are used for distinguishing different messages, devices, modules, etc., and do not represent a sequential order, nor limit the types of "first" and "second" to be different.
Fig. 4 is a schematic structural diagram of a resource allocation apparatus according to an exemplary embodiment of the present application. As shown in fig. 4, the apparatus includes: the method comprises the following steps: memory 11, processor 12 and communication component 13.
The memory 11 is used for storing a computer program and may be configured to store other various data to support operations on the processor. Examples of such data include instructions for any application or method operating on the processor, contact data, phonebook data, messages, pictures, videos, and so forth.
The memory 11 may be implemented by any type or combination of volatile or non-volatile memory devices, such as Static Random Access Memory (SRAM), electrically erasable programmable read-only memory (EEPROM), erasable programmable read-only memory (EPROM), programmable read-only memory (PROM), read-only memory (ROM), magnetic memory, flash memory, magnetic or optical disks.
A processor 12, coupled to the memory 11, for executing the computer program in the memory 11 for:
performing initial allocation on resources in the resource pool to obtain a sub-resource pool corresponding to each resource demand party;
responding to a resource request initiated by each resource demander through the communication assembly, and performing resource allocation on each resource demander from a sub-resource pool corresponding to each resource demander; and
under the condition that the first sub-resource pool with insufficient resources exists, whether the other sub-resource pools have the resources which can be allocated or not is estimated according to historical resource use information and/or resource use plan information of resource demanders corresponding to the other sub-resource pools;
and selecting a second sub-resource pool with the available adjustable resources from other sub-resource pools, and controlling a first resource demander corresponding to the first sub-resource pool to use the adjustable resources in the second sub-resource pool.
Further, when the processor 12 selects the second sub-resource pool in which the tunable and dialable resource exists, it is specifically configured to:
selecting the first N sub-resource pools with the adjustable dialing resources from other sub-resource pools according to the sequence of the number of the adjustable dialing resources from large to small, wherein N is a positive integer;
sending a resource allocation and approval request to a target approver, wherein the target approver is an approver of the first N sub-resource pools with the adjustable and approvable resources;
and if an approval result of agreeing to resource allocation returned by the target approving party is received, determining the sub-resource pool corresponding to the target approving party as a second sub-resource pool with the resource which can be allocated.
Further, if there are multiple second sub-resource pools, the processor 12 is specifically configured to: and controlling the first resource demander corresponding to the first sub-resource pool to respectively use the adjustable resources in each second sub-resource pool.
Further, before allocating the resources for the resource demanders, the processor 12 is further configured to:
aiming at any one resource demander in all resource demanders, judging whether the quantity of resources requested to be allocated by the resource demander is larger than a preset threshold value of the quantity of the resources;
if the quantity of the resources requested to be allocated by the resource demander is judged to be larger than a preset threshold value of the quantity of the resources, the quantity of the resources requested to be allocated by the resource demander is examined and approved;
it is determined that an approval result is received that agrees to allocate the resource to the resource requiring party.
Further, when determining the sub-resource pool corresponding to each resource demander, the processor 12 is specifically configured to:
and performing initial allocation on the resources in the resource pool according to the resource use plan information of each resource demand party to obtain a sub-resource pool corresponding to each resource demand party.
The apparatus shown in fig. 4 can perform the method of the embodiment shown in fig. 1 or fig. 3, and the related description of the embodiment shown in fig. 1 or fig. 3 can be referred to for the part not described in detail in this embodiment. The implementation process and technical effect of the technical solution refer to the description in the embodiment shown in fig. 1 or fig. 3, and are not described herein again.
Further, as shown in fig. 4, the apparatus further includes: display 14, power supply 15, audio 16, and other components. Only some of the components are schematically shown in fig. 4, and it is not meant that the processor includes only the components shown in fig. 4. In addition, the components shown by the dashed boxes in fig. 4 are optional components, not necessary components, and the specific implementation of the resource allocation apparatus may be determined. If the resource allocation apparatus is implemented as a terminal device such as a notebook computer, a tablet, a mobile phone, etc., the resource allocation apparatus may include components shown by dashed boxes in fig. 4; if the resource allocation apparatus is implemented as a server device such as a conventional server, a cloud server or a server array, the components shown by the dashed boxes in fig. 4 are not included.
Accordingly, the present application further provides a computer readable storage medium storing a computer program, where the computer program is capable of implementing the steps that can be executed by a processor in the foregoing method embodiments when executed.
The communication component of fig. 4 described above is configured to facilitate communication between the device in which the communication component is located and other devices in a wired or wireless manner. The device where the communication component is located can access a wireless network based on a communication standard, such as a WiFi, a 2G, 3G, 4G/LTE, 5G and other mobile communication networks, or a combination thereof. In an exemplary embodiment, the communication component receives a broadcast signal or broadcast related information from an external broadcast management system via a broadcast channel. In one exemplary embodiment, the communication component further includes a Near Field Communication (NFC) module to facilitate short-range communications. For example, the NFC module may be implemented based on Radio Frequency Identification (RFID) technology, infrared data association (IrDA) technology, Ultra Wideband (UWB) technology, Bluetooth (BT) technology, and other technologies.
The display in fig. 4 described above includes a screen, which may include a Liquid Crystal Display (LCD) and a Touch Panel (TP). If the screen includes a touch panel, the screen may be implemented as a touch screen to receive an input signal from a user. The touch panel includes one or more touch sensors to sense touch, slide, and gestures on the touch panel. The touch sensor may not only sense the boundary of a touch or slide action, but also detect the duration and pressure associated with the touch or slide operation.
The power supply assembly of fig. 4 described above provides power to the various components of the device in which the power supply assembly is located. The power components may include a power management system, one or more power supplies, and other components associated with generating, managing, and distributing power for the device in which the power component is located.
The audio component of fig. 4 described above may be configured to output and/or input an audio signal. For example, the audio component includes a Microphone (MIC) configured to receive an external audio signal when the device in which the audio component is located is in an operational mode, such as a call mode, a recording mode, and a voice recognition mode. The received audio signal may further be stored in a memory or transmitted via a communication component. In some embodiments, the audio assembly further comprises a speaker for outputting audio signals.
As will be appreciated by one skilled in the art, embodiments of the present application may be provided as a method, system, or computer program product. Accordingly, the present application may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present application may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.
The present application is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the application. It will be understood that each flow and/or block of the flow diagrams and/or block diagrams, and combinations of flows and/or blocks in the flow diagrams and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
In a typical configuration, a computing device includes one or more processors (CPUs), input/output interfaces, network interfaces, and memory.
The memory may include forms of volatile memory in a computer readable medium, Random Access Memory (RAM) and/or non-volatile memory, such as Read Only Memory (ROM) or flash memory (flash RAM). Memory is an example of a computer-readable medium.
Computer-readable media, including both non-transitory and non-transitory, removable and non-removable media, may implement information storage by any method or technology. The information may be computer readable instructions, data structures, modules of a program, or other data. Examples of computer storage media include, but are not limited to, phase change memory (PRAM), Static Random Access Memory (SRAM), Dynamic Random Access Memory (DRAM), other types of Random Access Memory (RAM), Read Only Memory (ROM), Electrically Erasable Programmable Read Only Memory (EEPROM), flash memory or other memory technology, compact disc read only memory (CD-ROM), Digital Versatile Discs (DVD) or other optical storage, magnetic cassettes, magnetic tape magnetic disk storage or other magnetic storage devices, or any other non-transmission medium that can be used to store information that can be accessed by a computing device. As defined herein, a computer readable medium does not include a transitory computer readable medium such as a modulated data signal and a carrier wave.
It should also be noted that the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising an … …" does not exclude the presence of other like elements in a process, method, article, or apparatus that comprises the element.
The above description is only an example of the present application and is not intended to limit the present application. Various modifications and changes may occur to those skilled in the art. Any modification, equivalent replacement, improvement, etc. made within the spirit and principle of the present application should be included in the scope of the claims of the present application.
Claims (10)
1. A method for resource allocation, comprising:
performing initial allocation on resources in the resource pool to obtain a sub-resource pool corresponding to each resource demand party;
responding to a resource request initiated by each resource demander, and performing resource allocation on each resource demander from a sub-resource pool corresponding to each resource demander; and
under the condition that the first sub-resource pool with insufficient resources exists, whether the other sub-resource pools have the resources which can be allocated or not is estimated according to historical resource use information and/or resource use plan information of resource demanders corresponding to the other sub-resource pools;
and selecting a second sub-resource pool with the available adjustable resources from other sub-resource pools, and controlling a first resource demander corresponding to the first sub-resource pool to use the adjustable resources in the second sub-resource pool.
2. The method of claim 1, wherein selecting the second sub-resource pool from the other sub-resource pools for which the callable resource exists comprises:
selecting the first N sub-resource pools with the adjustable dialing resources from other sub-resource pools according to the sequence of the number of the adjustable dialing resources from large to small, wherein N is a positive integer;
sending a resource allocation and approval request to a target approver, wherein the target approver is an approver of the first N sub-resource pools with the adjustable and approvable resources;
and if an approval result of agreeing to resource allocation returned by the target approving party is received, determining the sub-resource pool corresponding to the target approving party as a second sub-resource pool with the resource which can be allocated.
3. The method of claim 2, wherein if there are a plurality of second sub-resource pools, controlling the first resource demander corresponding to the first sub-resource pool to use the tunable resources in the second sub-resource pool comprises:
and controlling the first resource demander corresponding to the first sub-resource pool to respectively use the adjustable resources in each second sub-resource pool.
4. The method according to claim 1, further comprising, before allocating resources for each resource demander from a sub-resource pool corresponding to each resource demander:
aiming at any one resource demander in all resource demanders, judging whether the quantity of resources requested to be allocated by the resource demander is larger than a preset threshold value of the quantity of the resources;
if the quantity of the resources requested to be allocated by the resource demander is judged to be larger than a preset threshold value of the quantity of the resources, the quantity of the resources requested to be allocated by the resource demander is examined and approved;
it is determined that an approval result is received that agrees to allocate the resource to the resource requiring party.
5. The method of claim 1, wherein initially allocating the resources in the resource pool to obtain the sub-resource pool corresponding to each resource demander comprises:
and performing initial allocation on the resources in the resource pool according to the resource use plan information of each resource demand party to obtain a sub-resource pool corresponding to each resource demand party.
6. A resource allocation apparatus, comprising: a memory, a processor, and a communications component;
the memory for storing a computer program;
the processor, coupled with the memory, to execute the computer program to:
performing initial allocation on resources in the resource pool to obtain a sub-resource pool corresponding to each resource demand party;
responding to a resource request initiated by each resource demander through the communication assembly, and performing resource allocation on each resource demander from a sub-resource pool corresponding to each resource demander; and
under the condition that the first sub-resource pool with insufficient resources exists, whether the other sub-resource pools have the resources which can be allocated or not is estimated according to historical resource use information and/or resource use plan information of resource demanders corresponding to the other sub-resource pools;
and selecting a second sub-resource pool with the available adjustable resources from other sub-resource pools, and controlling a first resource demander corresponding to the first sub-resource pool to use the adjustable resources in the second sub-resource pool.
7. The apparatus of claim 6, wherein the processor, when selecting that the second sub-resource pool exists for the tunable dial resource, is specifically configured to:
selecting the first N sub-resource pools with the adjustable dialing resources from other sub-resource pools according to the sequence of the number of the adjustable dialing resources from large to small, wherein N is a positive integer;
sending a resource allocation and approval request to a target approver, wherein the target approver is an approver of the first N sub-resource pools with the adjustable and approvable resources;
and if an approval result of agreeing to resource allocation returned by the target approving party is received, determining the sub-resource pool corresponding to the target approving party as a second sub-resource pool with the resource which can be allocated.
8. The apparatus of claim 6, wherein the processor, prior to allocating resources for the resource consumers, is further configured to:
aiming at any one resource demander in all resource demanders, judging whether the quantity of resources requested to be allocated by the resource demander is larger than a preset threshold value of the quantity of the resources;
if the quantity of the resources requested to be allocated by the resource demander is judged to be larger than a preset threshold value of the quantity of the resources, the quantity of the resources requested to be allocated by the resource demander is examined and approved;
it is determined that an approval result is received that agrees to allocate the resource to the resource requiring party.
9. The apparatus of claim 6, wherein the processor, when determining the sub-resource pool corresponding to each resource demander, is specifically configured to:
and performing initial allocation on the resources in the resource pool according to the resource use plan information of each resource demand party to obtain a sub-resource pool corresponding to each resource demand party.
10. A computer-readable storage medium, in which a computer program is stored which, when being executed by a processor, causes the processor to carry out the steps of the method according to any one of claims 1 to 5.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010917654.6A CN112149964A (en) | 2020-09-03 | 2020-09-03 | Resource allocation method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010917654.6A CN112149964A (en) | 2020-09-03 | 2020-09-03 | Resource allocation method and device |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN112149964A true CN112149964A (en) | 2020-12-29 |
Family
ID=73889618
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010917654.6A Pending CN112149964A (en) | 2020-09-03 | 2020-09-03 | Resource allocation method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112149964A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114866547A (en) * | 2022-04-20 | 2022-08-05 | 中国银联股份有限公司 | Virtual resource allocation method, device, equipment and storage medium |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104079503A (en) * | 2013-03-27 | 2014-10-01 | 华为技术有限公司 | Method and device of distributing resources |
| JP2017142838A (en) * | 2017-04-06 | 2017-08-17 | 華為技術有限公司Ｈｕａｗｅｉ Ｔｅｃｈｎｏｌｏｇｉｅｓ Ｃｏ．，Ｌｔｄ． | Resource allocation method of central processing unit and calculation node |
| CN107515785A (en) * | 2016-06-16 | 2017-12-26 | 大唐移动通信设备有限公司 | A kind of EMS memory management process and device |
-
2020
- 2020-09-03 CN CN202010917654.6A patent/CN112149964A/en active Pending
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104079503A (en) * | 2013-03-27 | 2014-10-01 | 华为技术有限公司 | Method and device of distributing resources |
| CN107515785A (en) * | 2016-06-16 | 2017-12-26 | 大唐移动通信设备有限公司 | A kind of EMS memory management process and device |
| JP2017142838A (en) * | 2017-04-06 | 2017-08-17 | 華為技術有限公司Ｈｕａｗｅｉ Ｔｅｃｈｎｏｌｏｇｉｅｓ Ｃｏ．，Ｌｔｄ． | Resource allocation method of central processing unit and calculation node |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114866547A (en) * | 2022-04-20 | 2022-08-05 | 中国银联股份有限公司 | Virtual resource allocation method, device, equipment and storage medium |
| CN114866547B (en) * | 2022-04-20 | 2023-09-29 | 中国银联股份有限公司 | Virtual resource allocation method, device, equipment and storage medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US11146502B2 (en) | Method and apparatus for allocating resource | |
| CN106201661B (en) | Method and apparatus for elastic telescopic cluster virtual machine | |
| CN110399213B (en) | Method, device, electronic equipment and medium for determining resource demand of application program | |
| CN110908774B (en) | Resource scheduling method, equipment, system and storage medium | |
| US20150244645A1 (en) | Intelligent infrastructure capacity management | |
| CN111724091A (en) | Order distribution method, server side equipment and storage medium | |
| CN114072767B (en) | Resource scheduling, application and pricing method, equipment, system and storage medium | |
| CN112565317B (en) | Hybrid cloud system, data processing method and device thereof, and storage medium | |
| CN111754149A (en) | Driver scheduling method, device and storage medium | |
| CN104301257A (en) | Resource distribution method, device and equipment | |
| CN114155026A (en) | Resource allocation method, device, server and storage medium | |
| CN110875947A (en) | Data processing method and edge node equipment | |
| CN112149964A (en) | Resource allocation method and device | |
| CN109753353B (en) | Virtual machine resource allocation method and device and electronic equipment | |
| CN112419040A (en) | Credit anti-fraud identification method, credit anti-fraud identification device and storage medium | |
| CN107979843A (en) | A kind of Wi-Fi hotspot connection processing method, equipment and medium in terminal | |
| CN112114804A (en) | Application program generation method, device and system | |
| CN114385647B (en) | Alliance link-out block method, alliance link-out block device, electronic equipment and medium | |
| CN112395103B (en) | Method and device for sending delay message and storage medium | |
| CN112308600B (en) | Business circle dividing method and device and storage medium | |
| CN113301076B (en) | Flow control method, distributed system, device and storage medium | |
| CN115033369A (en) | Thread scheduling method, device and equipment based on task processing | |
| CN110187987B (en) | Method and apparatus for processing requests | |
| CN114205306A (en) | Flow identification method, equipment and storage medium | |
| CN114254841A (en) | Resource limit processing method, computing device, user device and server |
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 |