CN109766186B - Reserved resource allocation method, device, system and readable storage medium - Google Patents
Reserved resource allocation method, device, system and readable storage medium Download PDFInfo
- Publication number
- CN109766186B CN109766186B CN201910003555.4A CN201910003555A CN109766186B CN 109766186 B CN109766186 B CN 109766186B CN 201910003555 A CN201910003555 A CN 201910003555A CN 109766186 B CN109766186 B CN 109766186B
- Authority
- CN
- China
- Prior art keywords
- resource
- reservation request
- reservation
- priority
- preemptible
- 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
- 238000000034 method Methods 0.000 title claims abstract description 54
- 238000013468 resource allocation Methods 0.000 title claims abstract description 39
- 238000011156 evaluation Methods 0.000 claims description 32
- 238000004590 computer program Methods 0.000 claims description 15
- 238000012545 processing Methods 0.000 claims description 13
- 230000000977 initiatory effect Effects 0.000 claims description 8
- 230000008569 process Effects 0.000 description 11
- 238000010586 diagram Methods 0.000 description 5
- 238000004891 communication Methods 0.000 description 3
- 238000004364 calculation method Methods 0.000 description 2
- 230000004069 differentiation Effects 0.000 description 2
- 230000004044 response Effects 0.000 description 2
- 238000013500 data storage Methods 0.000 description 1
- 238000001514 detection method Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 230000006870 function Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
- 238000012546 transfer Methods 0.000 description 1
Images
Landscapes
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention provides a reservation resource allocation method, a device, a system and a readable storage medium, wherein a new reservation request is received, and the new reservation request comprises reservation occupation time and a prepayment proportion; when no idle resource is determined, determining a preemptible target resource and a first priority of a prior reservation request corresponding to the target resource; acquiring a second priority of the new reservation request according to the reservation occupation time and the prepayment proportion; when the second priority is higher than the first priority, the target resource is allocated to the new reservation request, the priority is determined by using reservation occupied time and a prepayment proportion, the resource can be flexibly allocated according to the demand condition of the reservation request, and the differentiated demand of a user is met.
Description
Technical Field
The present invention relates to data processing technologies, and in particular, to a reservation resource allocation method, apparatus, system, and readable storage medium.
Background
With the diversification of resources and increasingly rich differentiation requirements, resources in use can be reserved besides the allocation implementation of the resources, so that the connection of the use time sequence is more compact, and the use efficiency of the resources is improved. The resources can be understood as physical resources such as vehicles, elevators, offices, printer equipment and the like, and can also be understood as virtual resources such as server resource blocks, network resources and the like. Due to the limited resources, the reservation of the resources needs to be reasonably distributed to improve the utilization efficiency of the resources.
In a conventional reserved resource allocation method, a resource that is not reserved currently is allocated to a user when a reservation request of the user is received, and the resource that is not reserved currently is, for example, an idle resource or an unreserved resource that is to be released.
The existing reservation resource allocation method cannot adjust resource allocation according to the demand difference of users.
Disclosure of Invention
The invention provides a reserved resource allocation method, a reserved resource allocation device, a reserved resource allocation system and a readable storage medium, which can flexibly allocate resources according to the demand condition of a reservation request, meet the differentiated demand of a user and improve the flexibility of reserved resource allocation.
According to a first aspect of the present invention, there is provided a reserved resource allocation method, including:
receiving a new reservation request, wherein the new reservation request comprises reservation occupation time and a prepayment proportion;
when no idle resource is determined, determining a preemptible target resource and a first priority of a prior reservation request corresponding to the target resource;
acquiring a second priority of the new reservation request according to the reservation occupation time and the prepayment proportion;
allocating the target resource to the new reservation request upon determining that the second priority is higher than the first priority.
Optionally, in a possible implementation manner of the first aspect, the determining a preemptible target resource when it is determined that there is no idle resource includes:
when no idle resource is determined, determining the preemptible reservation resource according to the preemptible prior reservation request;
acquiring a first priority of each preemptible prior reservation request;
and taking the preemptable reserved resource corresponding to the lowest first priority as a target resource.
Optionally, in another possible implementation manner of the first aspect, before determining the preemptible reserved resource according to the preemptible prior reservation request, the method further includes:
acquiring a prior reservation request corresponding to the allocated reservation resource;
acquiring the prepayment proportion of each prior reservation request according to the prior reservation request corresponding to the allocated reservation resource;
and determining the prior reservation request with the prepayment proportion smaller than a preset preemption threshold value as a preemptible prior reservation request.
Optionally, in yet another possible implementation manner of the first aspect, the obtaining the first priority of each preemptible advance reservation request includes:
and determining the first priority of each preemptible prior reservation request according to the reservation occupation time and the prepayment proportion of each preemptible prior reservation request.
Optionally, in another possible implementation manner of the first aspect, the obtaining the second priority of the new subscription request according to the subscription occupancy time and the prepaid proportion includes:
determining a first evaluation value according to the time difference between the reservation occupation time and the initiation time of the new reservation request;
determining a second evaluation value according to the prepayment proportion;
determining a first weight of the first evaluation value and a second weight of the second evaluation value according to a resource type corresponding to the new reservation request;
and weighting and summing the first evaluation value and the second evaluation value to obtain the second priority.
Optionally, in yet another possible implementation manner of the first aspect, the new reservation request further includes a resource type;
the determining that there is no idle resource includes:
acquiring all available resources with the same type as the resources;
and if the available resources are reserved within the reserved occupation time, determining that no idle resources exist.
Optionally, in yet another possible implementation manner of the first aspect, after the determining that the second priority is higher than the first priority, allocating the target resource to the new reservation request, the method further includes:
acquiring other preemptible reserved resources except the target resource;
determining the other preemptible reserved resources which are lower than the second priority in the first priority and correspond to the other preemptible reserved resources as exchangeable reserved resources;
acquiring a resource quality value of each exchangeable reserved resource and a resource quality value of the target resource;
and if the resource quality value of at least one exchangeable reservation resource is higher than the resource quality value of the target resource, allocating the exchangeable reservation resource with the highest resource quality value to the new reservation request, and allocating the target resource to a previous reservation request corresponding to the exchangeable reservation resource with the highest resource quality value.
According to a second aspect of the present invention, there is provided a reserved resource allocation apparatus comprising:
the reservation receiving module is used for receiving a new reservation request, and the new reservation request comprises reservation occupied time and a prepayment proportion;
the first processing module is used for determining the preemptible target resource and the first priority of the prior reservation request corresponding to the target resource when no idle resource is determined;
the second processing module is used for acquiring a second priority of the new reservation request according to the reservation occupation time and the prepayment proportion;
an allocation module configured to allocate the target resource to the new reservation request when it is determined that the second priority is higher than the first priority.
According to a third aspect of the present invention, there is provided a reservation resource allocation system comprising: a memory, a processor and a computer program, the computer program being stored in the memory, the processor running the computer program to perform the reservation resource allocation method according to the first aspect of the present invention and various possible designs of the first aspect of the present invention.
According to a fourth aspect of the present invention, there is provided a readable storage medium, in which a computer program is stored, which, when being executed by a processor, is adapted to implement the reservation resource allocation method according to the first aspect of the present invention and various possible designs of the first aspect of the present invention.
The invention provides a reservation resource allocation method, a device, a system and a readable storage medium, wherein a new reservation request is received, and the new reservation request comprises reservation occupied time and a prepayment proportion; when no idle resource is determined, determining a preemptible target resource and a first priority of a prior reservation request corresponding to the target resource; acquiring a second priority of the new reservation request according to the reservation occupation time and the prepayment proportion; when the second priority is higher than the first priority, the target resource is allocated to the new reservation request, the priority is determined by using reservation occupied time and a prepayment proportion, the resource can be flexibly allocated according to the demand condition of the reservation request, and the differentiated demand of a user is met.
Drawings
Fig. 1 is a schematic diagram of an application scenario provided in an embodiment of the present invention;
fig. 2 is a schematic flow chart of a reserved resource allocation method according to an embodiment of the present invention;
fig. 3 is a schematic structural diagram of a reserved resource allocation apparatus according to an embodiment of the present invention;
fig. 4 is a schematic hardware structure diagram of a reserved resource allocation system according to an embodiment of the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the embodiments of the present invention clearer, the technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, 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 invention.
The terms "first," "second," "third," "fourth," and the like in the description and in the claims, as well as in the drawings, if any, are used for distinguishing between similar elements and not necessarily for describing a particular sequential or chronological order. It is to be understood that the data so used is interchangeable under appropriate circumstances such that the embodiments of the invention described herein are capable of operation in sequences other than those illustrated or described herein.
It should be understood that, in various embodiments of the present invention, the sequence numbers of the processes do not mean the execution sequence, and the execution sequence of the processes should be determined by the functions and the internal logic of the processes, and should not constitute any limitation on the implementation process of the embodiments of the present invention.
It should be understood that in the present application, "comprising" and "having" and any variations thereof, are intended to cover a non-exclusive inclusion, such that a process, method, system, article, or apparatus that comprises a list of steps or elements is not necessarily limited to those steps or elements expressly listed, but may include other steps or elements not expressly listed or inherent to such process, method, article, or apparatus.
It should be understood that, in the present invention, "a plurality" means two or more. "and/or" is merely an association describing an associated object, meaning that three relationships may exist, for example, and/or B, may mean: a exists alone, A and B exist simultaneously, and B exists alone. The character "/" generally indicates that the former and latter associated objects are in an "or" relationship. "comprises A, B and C" and "comprises A, B, C" means that all three of A, B, C comprise, "comprises A, B or C" means that one of A, B, C comprises, "comprises A, B and/or C" means that any 1 or any 2 or 3 of A, B, C comprises.
It should be understood that in the present invention, "B corresponding to a", "a corresponds to B", or "B corresponds to a" means that B is associated with a, and B can be determined from a. Determining B from a does not mean determining B from a alone, but may be determined from a and/or other information. And the matching of A and B means that the similarity of A and B is greater than or equal to a preset threshold value.
As used herein, "if" may be interpreted as "at … …" or "when … …" or "in response to a determination" or "in response to a detection", depending on the context.
The technical solution of the present invention will be described in detail below with specific examples. The following several specific embodiments may be combined with each other, and details of the same or similar concepts or processes may not be repeated in some embodiments.
Fig. 1 is a schematic view of an application scenario provided in an embodiment of the present invention. Fig. 1 shows a vehicle reservation scenario using a reservation resource allocation method, in which a user makes a vehicle reservation by interacting a terminal 1 with a server 2 before a time required for using a vehicle comes, and can make a reservation for the vehicle by paying a smaller amount of money than a full amount, and then making a full amount on the day of starting use or after use. The execution subject of the reserved resource allocation method may be the terminal 1 and/or the server 2. For example, in various possible implementations, the terminal 1 may acquire the allocation data of the reserved resource in advance, and then separately execute the reserved resource allocation method in the following embodiments; the server 2 may update the allocation data of the reserved resource in real time according to the operation of each terminal 2, and then individually execute the reserved resource allocation method in each of the following embodiments; the terminal 1 may execute a part of the steps of the reserved resource allocation method, and the server 2 may execute other steps to realize the joint execution of the terminal 1 and the server 2. One or more terminals 1 may be provided, and one or more servers 2 may be provided. Through various implementation modes of the reservation resource allocation method, reservation resources corresponding to the prior reservation request and the new reservation request can be flexibly adjusted, overall arrangement of each reservation resource in the system is realized, linkage of reservation can be effectively improved, and differentiation requirements of different users are met.
Referring to fig. 2, which is a flowchart illustrating a reserved resource allocation method according to an embodiment of the present invention, an execution main body of the method shown in fig. 2 may be a software and/or hardware device. The method comprises the following steps of S101 to S104:
s101, receiving a new reservation request, wherein the new reservation request comprises reservation occupation time and a prepayment proportion.
It is understood that the user initiates a new reservation request at the terminal by entering the reservation occupancy time and the prepaid monetary amount. Taking the execution main body as the server 2 in fig. 1 as an example, the server 2 receives a new reservation request sent by the terminal, and analyzes the new reservation request to obtain the reservation occupation time and the prepaid proportion, and also can obtain information such as the initiation time of the request, the resource type to be reserved, and the like. For example, the user initiates a reservation on friday, renting a 3L capacity truck on saturday for a full payment of 200 dollars in prepaid amount.
S102, when no idle resource is determined, determining a target resource which can be preempted and a first priority of a prior reservation request corresponding to the target resource.
Specifically, the server may determine the preemptible reserved resource according to the preemptible prior reservation request when determining that there is no free resource. For example, all the original 3L capacity trucks are reserved by the server, i.e. allocated to the previous reservation request, but the prepaid amount of 5 trucks is less than 30%, and the 5 trucks are determined to be available for preemption as the reserved resource. The server then obtains a first priority for each of the preemptible prior reservation requests. And taking the preemptable reserved resource corresponding to the lowest first priority as a target resource. It is understood that the truck with the lowest priority is selected from the above-mentioned 5 trucks as the target resource. The first priority can be determined according to the user level, the reservation occupation time and the prepayment proportion in the corresponding prior reservation request, or the combination of the user information and the prior reservation request.
Optionally, the process of obtaining the first priority of each preemptible advance reservation request may be: and determining the first priority of each preemptible prior reservation request according to the reservation occupation time and the prepayment proportion of each preemptible prior reservation request.
Specifically, the first evaluation value of each preemptible prior reservation request is determined according to a time difference between the reservation occupation time of each preemptible prior reservation request and the initiation time of the preemptible prior reservation request; determining a second evaluation value of the preemptible prior reservation request according to the prepayment proportion of the preemptible prior reservation request; and determining a first weight of a first evaluation value and a second weight of a second evaluation value for the preemptible prior reservation request according to the resource type corresponding to each preemptible prior reservation request. And weighting and summing the first evaluation value and the second evaluation value of each preemptible prior reservation request to obtain the first priority of each preemptible prior reservation request. The first weight and the second weight may be determined according to resource type, such as a reservation request for a hospital emergency vehicle, and the first weight for the time difference should be higher than the second weight for the prepaid proportion, the smaller the time difference, the more urgent the demand for emergency vehicle volume is, the less preemptable the demand is, and the larger the time difference, the more urgent the emergency vehicle reservation, which may be a non-urgent condition, is, the preemptable the demand for emergency vehicle reservation.
Before determining the preemptible reservation resource according to the preemptible prior reservation request, the method may further include a process of determining the preemptible prior reservation request: the server acquires a prior reservation request corresponding to the allocated reservation resource; acquiring the prepayment proportion of each prior reservation request according to the prior reservation request corresponding to the allocated reservation resource; and determining the prior reservation request with the prepayment proportion smaller than a preset preemption threshold value as a preemptible prior reservation request. The threshold value may be a preset fixed value or may be determined according to the resource type of the reserved resource.
Optionally, the new reservation request may further include a resource type. The process of determining that there is no idle resource may specifically be: acquiring all available resources with the same type as the resources; and if the available resources are reserved within the reserved occupation time, determining that no idle resources exist.
S103, acquiring a second priority of the new reservation request according to the reservation occupation time and the prepayment proportion.
Specifically, the server may determine the first evaluation value according to a time difference between the reservation occupation time and the initiation time of the new reservation request; determining a second evaluation value according to the prepayment proportion; determining a first weight of the first evaluation value and a second weight of the second evaluation value according to a resource type corresponding to the new reservation request; and weighting and summing the first evaluation value and the second evaluation value to obtain the second priority. The calculation method of the second priority can be the same as the calculation method of the first priority, and the fairness of priority comparison is embodied. The prepaid ratio is at least 0, and no upper limit may be set at most, and for example, a higher second evaluation value may be set for a previous reservation request or a new reservation request with a prepaid ratio of 200%. It is understood that the user may increase the likelihood of preemption of premium resources by multiple payments. The smaller the time difference is, the more urgent it can be understood that the higher the first evaluation value is determined, but for non-urgent resources, the first weight thereof may be set lower than the second weight.
S104, when the second priority is higher than the first priority, the target resource is allocated to the new reservation request.
Optionally, after allocating the target resource to the new reservation request, a notification for adjusting reservation request information, for example, suggesting to modify reservation occupancy time, may be sent to an initiating user of a previous reservation request originally corresponding to the target resource.
For example, user a and user B may both need to rent a truck for moving on the day of 12 months and 12 days. The moving time of subscriber B may vary so that a truck is reserved for 10% of the prepaid fee at 12 month 1, not exceeding the preset threshold of 90%, the truck is a reserved resource that can be preempted, and the first priority is the lowest of all reserved resources allocated at 12 month 12. User a, when viewing on day 11, month 12, finds that no free vehicles are available for reservation on day 12, month 12, and therefore user a has prepaid 110% of the reservation fee in the reservation request initiated. The time difference between the reservation occupation time and the initiation time of the user A is smaller than the preset 24 hours, the prepayment proportion exceeds the preset 90 percent, and the priority is higher. Comparing the priority of the reservation request initiated by the user A with the priority of the prior reservation request initiated by the user B, judging that the priority of the reservation request initiated by the user A is higher, and then allocating the truck originally allocated to the user B to the user A. And informing the user A that the freight car resource is preempted, and informing the user B to adjust the reserved occupation time or the pre-payment proportion.
Optionally, after allocating the target resource to the new reservation request when the second priority is determined to be higher than the first priority, the method may further include a process of reserving resource exchange, and specifically, the server may obtain other preemptible reserved resources except the target resource; determining the other preemptible reserved resources which are lower than the second priority in the first priority and correspond to the other preemptible reserved resources as exchangeable reserved resources; acquiring a resource quality value of each exchangeable reserved resource and a resource quality value of the target resource; and if the resource quality value of at least one exchangeable reservation resource is higher than the resource quality value of the target resource, allocating the exchangeable reservation resource with the highest resource quality value to the new reservation request, and allocating the target resource to a previous reservation request corresponding to the exchangeable reservation resource with the highest resource quality value.
In the method for allocating reserved resources provided by the embodiment, a new reservation request is received, where the new reservation request includes reservation occupied time and prepaid proportion; when no idle resource is determined, determining a preemptible target resource and a first priority of a prior reservation request corresponding to the target resource; acquiring a second priority of the new reservation request according to the reservation occupation time and the prepayment proportion; when the second priority is higher than the first priority, the target resource is allocated to the new reservation request, the priority is determined by using reservation occupied time and a prepayment proportion, the resource can be flexibly allocated according to the demand condition of the reservation request, and the differentiated demand of a user is met.
Referring to fig. 3, which is a schematic structural diagram of a reserved resource allocation apparatus according to an embodiment of the present invention, the reserved resource allocation apparatus 30 shown in fig. 3 mainly includes:
a reservation receiving module 31, configured to receive a new reservation request, where the new reservation request includes a reservation occupation time and a prepaid ratio;
a first processing module 32, configured to determine, when it is determined that there is no idle resource, a preemptible target resource and a first priority of a previous reservation request corresponding to the target resource;
a second processing module 33, configured to obtain a second priority of the new reservation request according to the reservation occupied time and the prepaid ratio;
an allocating module 34, configured to allocate the target resource to the new reservation request when it is determined that the second priority is higher than the first priority.
The reserved resource allocation apparatus in the embodiment shown in fig. 3 can be correspondingly used to perform the steps in the method embodiment shown in fig. 2, and the implementation principle and the technical effect are similar, which are not described herein again.
Optionally, the first processing module 32 is specifically configured to:
when no idle resource is determined, determining the preemptible reservation resource according to the preemptible prior reservation request; acquiring a first priority of each preemptible prior reservation request; and taking the preemptable reserved resource corresponding to the lowest first priority as a target resource.
Optionally, the first processing module 32 is further configured to, before the determining the preemptible reserved resource according to the preemptible prior reservation request:
acquiring a prior reservation request corresponding to the allocated reservation resource; acquiring the prepayment proportion of each prior reservation request according to the prior reservation request corresponding to the allocated reservation resource; and determining the prior reservation request with the prepayment proportion smaller than a preset preemption threshold value as a preemptible prior reservation request.
Optionally, the first processing module 32 is configured to:
and determining the first priority of each preemptible prior reservation request according to the reservation occupation time and the prepayment proportion of each preemptible prior reservation request.
Optionally, the second processing module 33 is configured to:
determining a first evaluation value according to the time difference between the reservation occupation time and the initiation time of the new reservation request; determining a second evaluation value according to the prepayment proportion; determining a first weight of the first evaluation value and a second weight of the second evaluation value according to a resource type corresponding to the new reservation request; and weighting and summing the first evaluation value and the second evaluation value to obtain the second priority.
Optionally, the new reservation request further includes a resource type. The first processing module 32 is configured to:
acquiring all available resources with the same type as the resources; and if the available resources are reserved within the reserved occupation time, determining that no idle resources exist.
Optionally, after the allocating the target resource to the new reservation request when the determining that the second priority is higher than the first priority, the allocating module 34 is further configured to:
acquiring other preemptible reserved resources except the target resource; determining the other preemptible reserved resources which are lower than the second priority in the first priority and correspond to the other preemptible reserved resources as exchangeable reserved resources; acquiring a resource quality value of each exchangeable reserved resource and a resource quality value of the target resource; and if the resource quality value of at least one exchangeable reservation resource is higher than the resource quality value of the target resource, allocating the exchangeable reservation resource with the highest resource quality value to the new reservation request, and allocating the target resource to a previous reservation request corresponding to the exchangeable reservation resource with the highest resource quality value.
Referring to fig. 4, which is a schematic diagram of a hardware structure of a reserved resource allocation system according to an embodiment of the present invention, the reserved resource allocation system 40 includes: a processor 41, memory 42 and computer programs; wherein
A memory 42 for storing the computer program, which may also be a flash memory (flash). The computer program is, for example, an application program, a functional module, or the like that implements the above method.
A processor 41 for executing the computer program stored by the memory to implement the steps of the above method. Reference may be made in particular to the description relating to the preceding method embodiment.
Alternatively, the memory 42 may be separate or integrated with the processor 41.
When the memory 42 is a device independent from the processor 41, the reservation resource allocation system 40 may further include:
a bus 43 for connecting the memory 42 and the processor 41.
The present invention also provides a readable storage medium, in which a computer program is stored, which, when being executed by a processor, is adapted to implement the methods provided by the various embodiments described above.
The readable storage medium may be a computer storage medium or a communication medium. Communication media includes any medium that facilitates transfer of a computer program from one place to another. Computer storage media may be any available media that can be accessed by a general purpose or special purpose computer. For example, a readable storage medium is coupled to the processor such that the processor can read information from, and write information to, the readable storage medium. Of course, the readable storage medium may also be an integral part of the processor. The processor and the readable storage medium may reside in an Application Specific Integrated Circuits (ASIC). Additionally, the ASIC may reside in user equipment. Of course, the processor and the readable storage medium may also reside as discrete components in a communication device. The readable storage medium may be a read-only memory (ROM), a random-access memory (RAM), a CD-ROM, a magnetic tape, a floppy disk, an optical data storage device, and the like.
The present invention also provides a program product comprising execution instructions stored in a readable storage medium. The at least one processor of the device may read the execution instructions from the readable storage medium, and the execution of the execution instructions by the at least one processor causes the device to implement the methods provided by the various embodiments described above.
In the above embodiment of the reservation resource allocation system, it should be understood that the Processor may be a Central Processing Unit (CPU), other general purpose processors, a Digital Signal Processor (DSP), an Application Specific Integrated Circuit (ASIC), etc. A general purpose processor may be a microprocessor or the processor may be any conventional processor or the like. The steps of a method disclosed in connection with the present invention may be embodied directly in a hardware processor, or in a combination of the hardware and software modules within the processor.
Finally, it should be noted that: the above embodiments are only used to illustrate the technical solution of the present invention, and not to limit the same; while the invention has been described in detail and with reference to the foregoing embodiments, it will be understood by those skilled in the art that: the technical solutions described in the foregoing embodiments may still be modified, or some or all of the technical features may be equivalently replaced; and the modifications or the substitutions do not make the essence of the corresponding technical solutions depart from the scope of the technical solutions of the embodiments of the present invention.
Claims (9)
1. A reserved resource allocation method, comprising:
receiving a new reservation request, wherein the new reservation request comprises reservation occupation time and a prepayment proportion;
when no idle resource is determined, determining a preemptible target resource and a first priority of a prior reservation request corresponding to the target resource;
acquiring a second priority of the new reservation request according to the reservation occupation time and the prepayment proportion;
upon determining that the second priority is higher than the first priority, allocating the target resource to the new reservation request;
after the allocating the target resource to the new reservation request when the second priority is determined to be higher than the first priority, further comprising:
acquiring other preemptible reserved resources except the target resource;
determining the other preemptible reserved resources which are lower than the second priority in the first priority and correspond to the other preemptible reserved resources as exchangeable reserved resources;
acquiring a resource quality value of each exchangeable reserved resource and a resource quality value of the target resource;
and if the resource quality value of at least one exchangeable reservation resource is higher than the resource quality value of the target resource, allocating the exchangeable reservation resource with the highest resource quality value to the new reservation request, and allocating the target resource to a previous reservation request corresponding to the exchangeable reservation resource with the highest resource quality value.
2. The method of claim 1, wherein determining the preemptible target resource when no free resources are determined comprises:
when no idle resource is determined, determining the preemptible reservation resource according to the preemptible prior reservation request;
acquiring a first priority of each preemptible prior reservation request;
and taking the preemptable reserved resource corresponding to the lowest first priority as a target resource.
3. The method of claim 2, further comprising, prior to said determining preemptible reserved resources from a preemptible prior reservation request:
acquiring a prior reservation request corresponding to the allocated reservation resource;
acquiring the prepayment proportion of each prior reservation request according to the prior reservation request corresponding to the allocated reservation resource;
and determining the prior reservation request with the prepayment proportion smaller than a preset preemption threshold value as a preemptible prior reservation request.
4. The method of claim 2, wherein obtaining a first priority for each of the preemptible prior reservation requests comprises:
and determining the first priority of each preemptible prior reservation request according to the reservation occupation time and the prepayment proportion of each preemptible prior reservation request.
5. The method of any of claims 1 to 4, wherein said obtaining a second priority of said new reservation request based on said reserved airtime and said prepaid proportion comprises:
determining a first evaluation value according to the time difference between the reservation occupation time and the initiation time of the new reservation request;
determining a second evaluation value according to the prepayment proportion;
determining a first weight of the first evaluation value and a second weight of the second evaluation value according to a resource type corresponding to the new reservation request;
and weighting and summing the first evaluation value and the second evaluation value to obtain the second priority.
6. The method of claim 1, wherein the new reservation request further comprises a resource type;
the determining that there is no idle resource includes:
acquiring all available resources with the same type as the resources;
and if the available resources are reserved within the reserved occupation time, determining that no idle resources exist.
7. A reserved resource allocation apparatus, comprising:
the reservation receiving module is used for receiving a new reservation request, and the new reservation request comprises reservation occupied time and a prepayment proportion;
the first processing module is used for determining the preemptible target resource and the first priority of the prior reservation request corresponding to the target resource when no idle resource is determined;
the second processing module is used for acquiring a second priority of the new reservation request according to the reservation occupation time and the prepayment proportion;
an allocation module configured to allocate the target resource to the new reservation request when it is determined that the second priority is higher than the first priority;
the allocation module, upon the determination that the second priority is higher than the first priority, is further to, after allocating the target resource to the new reservation request:
acquiring other preemptible reserved resources except the target resource;
determining the other preemptible reserved resources which are lower than the second priority in the first priority and correspond to the other preemptible reserved resources as exchangeable reserved resources;
acquiring a resource quality value of each exchangeable reserved resource and a resource quality value of the target resource;
and if the resource quality value of at least one exchangeable reservation resource is higher than the resource quality value of the target resource, allocating the exchangeable reservation resource with the highest resource quality value to the new reservation request, and allocating the target resource to a previous reservation request corresponding to the exchangeable reservation resource with the highest resource quality value.
8. A reservation resource allocation system, comprising: a memory, a processor, and a computer program, the computer program being stored in the memory, the processor running the computer program to perform the reservation resource allocation method of any of claims 1 to 6.
9. A readable storage medium, in which a computer program is stored, the computer program being configured to, when executed by a processor, implement the reservation resource allocation method according to any one of claims 1 to 6.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910003555.4A CN109766186B (en) | 2019-01-03 | 2019-01-03 | Reserved resource allocation method, device, system and readable storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910003555.4A CN109766186B (en) | 2019-01-03 | 2019-01-03 | Reserved resource allocation method, device, system and readable storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109766186A CN109766186A (en) | 2019-05-17 |
| CN109766186B true CN109766186B (en) | 2021-05-18 |
Family
ID=66453635
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910003555.4A Active CN109766186B (en) | 2019-01-03 | 2019-01-03 | Reserved resource allocation method, device, system and readable storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109766186B (en) |
Families Citing this family (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110334823B (en) * | 2019-06-17 | 2022-04-05 | 北京大米科技有限公司 | Reservation method, reservation device, electronic equipment and medium |
| CN110659802B (en) * | 2019-08-21 | 2022-08-30 | 孔祥天瑞 | Cage car distribution method and device, computer equipment and storage medium |
| CN111324459A (en) * | 2020-02-19 | 2020-06-23 | 北京思特奇信息技术股份有限公司 | Calendar-based resource scheduling method and device, electronic equipment and storage medium |
| CN111898868A (en) * | 2020-07-06 | 2020-11-06 | 上海泛微网络科技股份有限公司 | Resource occupation display method and device |
| CN113435968B (en) * | 2021-06-23 | 2024-02-02 | 南京领行科技股份有限公司 | Network appointment vehicle dispatching method and device, electronic equipment and storage medium |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1577311A (en) * | 2003-06-27 | 2005-02-09 | 株式会社东芝 | Method and system for performing real-time operation using processors |
| CN101460966A (en) * | 2006-04-26 | 2009-06-17 | 维瑞蒂有限责任公司 | Order processing apparatus and method |
| CN102402461A (en) * | 2011-12-08 | 2012-04-04 | 曙光信息产业(北京)有限公司 | Balanced scheduling method based on operation scale |
| CN104427617A (en) * | 2013-08-19 | 2015-03-18 | 电信科学技术研究院 | Resource indication and determination method and device |
| CN108399462A (en) * | 2018-03-13 | 2018-08-14 | 魏会风 | A kind of shared vehicle reservation system based on Internet of Things |
Family Cites Families (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8398489B2 (en) * | 2007-04-05 | 2013-03-19 | Cfph, Llc | Sorting games of chance |
| CN105847891A (en) * | 2016-03-31 | 2016-08-10 | 乐视控股（北京）有限公司 | Resource preemption method and device |
| CN108629611A (en) * | 2017-03-24 | 2018-10-09 | 北京京东尚科信息技术有限公司 | Method and apparatus for distributing resource |
| CN107733689A (en) * | 2017-09-15 | 2018-02-23 | 西南电子技术研究所（中国电子科技集团公司第十研究所） | Dynamic weighting polling dispatching strategy process based on priority |
| CN108023931A (en) * | 2017-10-26 | 2018-05-11 | 北京航天智造科技发展有限公司 | A kind of Service Source auto-allocation method and system |
| CN108595264A (en) * | 2018-04-10 | 2018-09-28 | 平安科技（深圳）有限公司 | Refresh tasks distribution method, electronic equipment and computer readable storage medium |
-
2019
- 2019-01-03 CN CN201910003555.4A patent/CN109766186B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1577311A (en) * | 2003-06-27 | 2005-02-09 | 株式会社东芝 | Method and system for performing real-time operation using processors |
| CN101460966A (en) * | 2006-04-26 | 2009-06-17 | 维瑞蒂有限责任公司 | Order processing apparatus and method |
| CN102402461A (en) * | 2011-12-08 | 2012-04-04 | 曙光信息产业(北京)有限公司 | Balanced scheduling method based on operation scale |
| CN104427617A (en) * | 2013-08-19 | 2015-03-18 | 电信科学技术研究院 | Resource indication and determination method and device |
| CN108399462A (en) * | 2018-03-13 | 2018-08-14 | 魏会风 | A kind of shared vehicle reservation system based on Internet of Things |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109766186A (en) | 2019-05-17 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109766186B (en) | Reserved resource allocation method, device, system and readable storage medium | |
| EP3644264A1 (en) | Diagnostic device rental method, server, and storage medium | |
| US20140256284A1 (en) | Implementing a dynamic cloud spectrum database as a mechanism for cataloging and controlling spectrum availability | |
| CN107844843B (en) | Order processing method and server | |
| CN108306874B (en) | Service interface access current limiting method and device | |
| US20070041401A1 (en) | Priority control system and priority control method | |
| CN108629910B (en) | Shared vehicle using method and device and server | |
| CN108389271A (en) | Parking charge method, apparatus, computer installation and computer readable storage medium | |
| CN111861097B (en) | Information processing method and device | |
| CN109903030A (en) | It is a kind of for the charging method of cloud host, cloud host and storage medium | |
| CN106685671B (en) | Method and device for realizing directional traffic card and traffic service platform | |
| CN111988388B (en) | Flow distribution method, device, electronic equipment and storage medium | |
| CN110826741A (en) | Network taxi booking and invoice issuing method, system and device | |
| CN110084897B (en) | Charging method, system, device and computer readable storage medium | |
| KR101910882B1 (en) | Allocation service method for prepayment of taxi | |
| CN110826943A (en) | Method and related equipment for judging whether bus allocation is needed or not and determining bus allocation number | |
| CN111861612B (en) | Resource allocation method, device, equipment and medium | |
| CN106936602B (en) | Network charging method and device based on Internet of things equipment | |
| CN114493236A (en) | Service vehicle assignment method, service vehicle assignment device, service vehicle assignment apparatus, service vehicle assignment medium, and program product | |
| US11093363B2 (en) | Information processing apparatus for allocating bandwidth based on priority and non-transitory computer readable medium | |
| CN103326870A (en) | Ticket recalculating device and method for on-line charging | |
| CN111258747A (en) | Service efficiency control method and device | |
| CN115834712B (en) | Gateway resource scheduling method for connection-oriented service | |
| CN111489220B (en) | Method for improving capacity of target area, dispatch method, device and server | |
| CN113766442B (en) | Telephone traffic resource sharing method and device, computing equipment and storage medium |
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 |