CN117391338A - Resource allocation method, device and equipment - Google Patents
Resource allocation method, device and equipment Download PDFInfo
- Publication number
- CN117391338A CN117391338A CN202311249170.9A CN202311249170A CN117391338A CN 117391338 A CN117391338 A CN 117391338A CN 202311249170 A CN202311249170 A CN 202311249170A CN 117391338 A CN117391338 A CN 117391338A
- Authority
- CN
- China
- Prior art keywords
- resource
- provider
- resources
- received
- yielding
- 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 45
- 238000000034 method Methods 0.000 title claims abstract description 44
- 238000004364 calculation method Methods 0.000 claims abstract description 46
- 238000004590 computer program Methods 0.000 claims description 5
- 238000010586 diagram Methods 0.000 description 10
- 230000008901 benefit Effects 0.000 description 7
- 230000008569 process Effects 0.000 description 5
- 238000006243 chemical reaction Methods 0.000 description 4
- 230000001360 synchronised effect Effects 0.000 description 3
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 230000003287 optical effect Effects 0.000 description 2
- 241000008225 Pogonichthys macrolepidotus Species 0.000 description 1
- 230000006978 adaptation Effects 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000005540 biological transmission Effects 0.000 description 1
- 238000005266 casting Methods 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 238000004883 computer application Methods 0.000 description 1
- 230000001419 dependent effect Effects 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 230000006870 function Effects 0.000 description 1
- PCHJSUWPFVWCPO-UHFFFAOYSA-N gold Chemical compound [Au] PCHJSUWPFVWCPO-UHFFFAOYSA-N 0.000 description 1
- 239000010931 gold Substances 0.000 description 1
- 229910052737 gold Inorganic materials 0.000 description 1
- 230000010365 information processing Effects 0.000 description 1
- 230000000750 progressive effect Effects 0.000 description 1
- 230000000284 resting effect Effects 0.000 description 1
- 230000003068 static effect Effects 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- 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
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/46—Multiprogramming arrangements
- G06F9/50—Allocation of resources, e.g. of the central processing unit [CPU]
- G06F9/5005—Allocation of resources, e.g. of the central processing unit [CPU] to service a request
- G06F9/5027—Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resource being a machine, e.g. CPUs, Servers, Terminals
-
- 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
- G06Q40/00—Finance; Insurance; Tax strategies; Processing of corporate or income taxes
- G06Q40/04—Trading; Exchange, e.g. stocks, commodities, derivatives or currency exchange
-
- 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
- G06Q40/00—Finance; Insurance; Tax strategies; Processing of corporate or income taxes
- G06Q40/06—Asset management; Financial planning or analysis
Landscapes
- Engineering & Computer Science (AREA)
- Business, Economics & Management (AREA)
- Human Resources & Organizations (AREA)
- Theoretical Computer Science (AREA)
- Development Economics (AREA)
- Economics (AREA)
- Finance (AREA)
- Physics & Mathematics (AREA)
- Accounting & Taxation (AREA)
- Strategic Management (AREA)
- General Physics & Mathematics (AREA)
- Entrepreneurship & Innovation (AREA)
- Marketing (AREA)
- General Business, Economics & Management (AREA)
- Operations Research (AREA)
- Game Theory and Decision Science (AREA)
- Technology Law (AREA)
- Software Systems (AREA)
- Tourism & Hospitality (AREA)
- Quality & Reliability (AREA)
- Educational Administration (AREA)
- General Engineering & Computer Science (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The embodiment of the specification provides a resource allocation method, a device and equipment, when a borrowing resource is executed and transferred, the embodiment of the specification assigns a sorting identifier of a yielding resource provider to a sorting identifier of a transfered resource provider, and assigns a global received resource of the yielding resource provider to a global received resource of the transfered resource provider, so when a returning total resource provided by a resource demand provider is allocated to the resource provider, resource allocation calculation is performed according to the returning total resource, the global received resource of each resource provider and a resource share ratio, if it is determined that a tail difference resource exists according to a calculation result, because the sorting identifier is used for indicating the sequence of the tail difference resource allocated to the resource provider, the resource provider to be allocated with the tail difference resource can be determined according to the sequence determined by the sorting identifier, and the returning total resource is allocated to each resource provider in combination with the calculation result, thereby improving the allocation accuracy.
Description
The present application is a divisional application of patent application with application date 2018, 12 months and 12 days, application number 201811519340X and invention creation name of "resource allocation method, device and equipment".
Technical Field
The present disclosure relates to the field of information processing, and in particular, to a method, an apparatus, and a device for allocating resources.
Background
Resource allocation is a common concept in the technical field of computer application, and may refer to resource allocation between multiple devices (such as allocation of processing resources and allocation of storage resources between different nodes), or resource allocation between multiple users. In these application scenarios, "resources" are often limited, while some parties have idle resources, and some parties have far greater demands for resources than existing resources. The resource providers with idle resources can provide resource lending resources with different amounts to the resource demander, and the resource demander returns return resources to each resource provider after reaching a certain period. Taking the cloud computing platform as an example, the central processing node can be used as a resource demand party, the other processing nodes can be used as resource providers, the central processing node can borrow computing resources of the other processing nodes, and the borrowed computing resources are returned in time or the cost for using the computing resources is paid.
In practical applications, there may be a discrepancy between the resource providing deadline of the resource provider and the resource demand deadline of the resource demander, so that in order not to affect the total required resources required by the resource demander during the resource demand period, the resource provided by the resource provider with the resource providing deadline earlier than the resource demand deadline can be supplemented by other resource providers, and it can be understood that the asset provider transfers the lease right to the assignee asset provider. And limited by the limitation of the minimum unit of the resources, when the return total resources provided by the resource requiring party are allocated to the resource provider, the return total resources may be inexhaustible to generate tail-end resources, and when tail-end resources are allocated to the assigned resource provider and other resource providers, the situation that tail-end resources are unreasonably allocated may occur, so how to reasonably allocate the return total resources to the resource provider is particularly important.
Disclosure of Invention
In order to overcome the problems in the related art, the present specification provides a resource allocation method, apparatus and device.
According to a first aspect of embodiments of the present disclosure, there is provided a resource allocation method, in which a required total resource of resource demander is formed by borrowed resources provided by resource providers, and unique ordering identifiers are respectively configured for each resource provider that first forms the required total resource, where the ordering identifiers are used to indicate an order in which the resource providers are allocated tail-end resources, and the method includes:
before the expiration time of the resource demand occupied by the resource demander arrives, if a borrowing resource is executed to transfer, assigning the sorting identifier of the yielding resource provider to the sorting identifier of the yielding resource provider, and assigning the global received resource of the yielding resource provider to the global received resource of the yielding resource provider, wherein the global received resource of the yielding resource provider is: a global received resource of the resource sponsor in transfer relationship with the yielding resource provider, a sum of currently received resources of the yielding resource provider;
and when the preset return resource condition is met, carrying out resource allocation calculation according to the total return resource, the global received resource of each resource provider and the resource share ratio, if the tail difference resource is judged to exist according to the calculation result, determining the resource provider to be allocated with the tail difference resource according to the sequence determined by the sorting identification, and determining the return resource to be allocated to each resource provider by combining the calculation result, wherein the resource share ratio is the ratio of the borrowed resource to the total required resource.
In one embodiment, the ranking identification is generated based on the resource share ratio of the resource provider and a resource identification that is determined based on the resource provider's resource provisioning time and is used to identify the lended resource provided by the resource provider.
In one embodiment, the lending resource and the return resource belong to the same type of resource, and the sum of the return resources received by the resource provider is greater than the lending resource provided to the resource demander for the same resource provider.
In one embodiment, the resource demander returns the resource to the resource provider at least twice.
In one embodiment, the ranking identity and global received resource information are recorded in a resource record of a resource provider, the resource record further comprising: the resource provider has a resource identification and a currently received resource, the currently received resource being presented upon receipt of a resource query instruction, the resource identification being determined based on a resource providing time of the resource provider and being used to identify a borrowed resource provided by the resource provider.
According to a second aspect of embodiments of the present specification, there is provided a resource allocation apparatus, in which a required total resource of resource demanders is constituted by lended resources provided by resource providers, and unique sorting identifications are respectively configured for each resource provider that first constitutes the required total resource, the sorting identifications being used to indicate an order in which the resource providers are allocated tail-biting resources, the apparatus comprising:
The data assignment module is used for: before the expiration time of the resource demand occupied by the resource demander arrives, if a borrowing resource is executed to transfer, assigning the sorting identifier of the yielding resource provider to the sorting identifier of the yielding resource provider, and assigning the global received resource of the yielding resource provider to the global received resource of the yielding resource provider, wherein the global received resource of the yielding resource provider is: a global received resource of the resource sponsor in transfer relationship with the yielding resource provider, a sum of currently received resources of the yielding resource provider;
the allocation processing module is used for: and when the preset return resource condition is met, carrying out resource allocation calculation according to the total return resource, the global received resource of each resource provider and the resource share ratio, if the tail difference resource is judged to exist according to the calculation result, determining the resource provider to be allocated with the tail difference resource according to the sequence determined by the sorting identification, and determining the return resource to be allocated to each resource provider by combining the calculation result, wherein the resource share ratio is the ratio of the borrowed resource to the total required resource.
In one embodiment, the ranking identification is generated based on the resource share ratio of the resource provider and a resource identification that is determined based on the resource provider's resource provisioning time and is used to identify the lended resource provided by the resource provider.
In one embodiment, the lending resource and the return resource belong to the same type of resource, and the sum of the return resources received by the resource provider is greater than the lending resource provided to the resource demander for the same resource provider.
In one embodiment, the resource demander returns the resource to the resource provider at least twice.
According to a third aspect of embodiments of the present specification, there is provided a computer device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, wherein the processor implements the any one of the resource allocation methods when executing the program.
The technical scheme provided by the embodiment of the specification can comprise the following beneficial effects:
in the embodiment of the present disclosure, when a borrowing resource is subjected to a transfer operation, a ranking identifier of a lending resource provider is assigned to a ranking identifier of a transferee resource provider, and a global received resource of the lending resource provider is assigned to a global received resource of the transferee resource provider. It is to be understood that both the foregoing general description and the following detailed description are exemplary and explanatory only and are not restrictive of the disclosure.
Drawings
The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments consistent with the specification and together with the description, serve to explain the principles of the specification.
Fig. 1A is a flow chart illustrating a resource allocation method according to an exemplary embodiment of the present disclosure.
Fig. 1B is a schematic diagram of a resource transfer according to an exemplary embodiment of the present description.
FIG. 2 is a schematic illustration of an asset record according to an exemplary embodiment of the present description.
FIG. 3 is a timing diagram of an asset allocation method according to an exemplary embodiment of the present description.
Fig. 4 is a hardware configuration diagram of a computer device in which the resource allocation apparatus of the present specification is located.
Fig. 5 is a block diagram of a resource allocation apparatus according to an exemplary embodiment of the present specification.
Detailed Description
Reference will now be made in detail to exemplary embodiments, examples of which are illustrated in the accompanying drawings. When the following description refers to the accompanying drawings, the same numbers in different drawings refer to the same or similar elements, unless otherwise indicated. The implementations described in the following exemplary examples do not represent all implementations consistent with the present specification. Rather, they are merely examples of apparatus and methods consistent with some aspects of the present description as detailed in the accompanying claims.
The terminology used in the description presented herein is for the purpose of describing particular embodiments only and is not intended to be limiting of the description. As used in this specification and the appended claims, the singular forms "a," "an," and "the" are intended to include the plural forms as well, unless the context clearly indicates otherwise. It should also be understood that the term "and/or" as used herein refers to and encompasses any or all possible combinations of one or more of the associated listed items.
It should be understood that although the terms first, second, third, etc. may be used in this specification to describe various information, these information should not be limited to these terms. These terms are only used to distinguish one type of information from another. For example, the first information may also be referred to as second information, and similarly, the second information may also be referred to as first information, without departing from the scope of the present description. The word "if" as used herein may be interpreted as "at … …" or "at … …" or "responsive to a determination", depending on the context.
In this specification, a party providing a resource is defined as a resource provider, a party requiring the resource is defined as a resource demander, a resource provided by the resource provider is defined as a loan resource, a resource required by the resource demander is defined as a total required resource, a resource returned by the resource demander to the resource provider is defined as a returned resource, and a sum of the resources returned to the resource provider each time is defined as a returned total resource.
In practical applications, many resources have minimum units, so that when the total return resources are allocated to each resource provider, the situation that data is not divided may occur, for example, 1 minimum unit of resources is expected to be divided into multiple resource providers, and in view of the fact that the minimum unit cannot be divided, the minimum unit of resources can be used as tail-end resources. The tail-end resources can be allocated to the resource providers in turn according to the resource identifiers, however, the applicant finds that the resource identifiers are borrowed resources which are generated by increasing with the service and are used for uniquely identifying the resource providers, when transfer operation occurs, new resource identifiers are configured for the assigned resource providers, and the newly configured resource identifiers are necessarily after the resource identifiers of the assigned resource providers are issued, so that the sequence of the assigned resource providers and the assigned tail-end resources of the assigned resource providers are inconsistent, and the situation that tail-end resource allocation is unreasonable occurs, and further inaccurate resource allocation is caused.
In view of this, the embodiment of the present disclosure provides a scheme capable of reasonably distributing tail-difference resources, so that no matter how many transfer operations occur during implementation, return resources obtained by resource providers at each stage are consistent with those of no transfer operation, and fairness and accuracy of resource distribution are guaranteed.
The resource allocation scheme of the present specification is exemplified below with reference to the accompanying drawings.
As shown in fig. 1A, which is a flowchart of a resource allocation method according to an exemplary embodiment of the present disclosure, a required total resource of a resource demander is formed by borrowed resources provided by resource providers, and each resource provider that first forms the required total resource is configured with a unique ordering identifier, where the ordering identifier is used to indicate an order in which the resource providers are allocated tail-end resources, and the method includes:
in step 102, before the expiration time of the resource demand occupied by the resource demander arrives, if a transfer operation is performed on a borrowed resource, assigning a ranking identifier of the yielding resource provider to a ranking identifier of the yielding resource provider, and assigning a global received resource of the yielding resource provider to a global received resource of the yielding resource provider, where the global received resource of the yielding resource provider is: a global received resource of the resource sponsor in transfer relationship with the yielding resource provider, a sum of currently received resources of the yielding resource provider;
in step 104, when the preset return resource condition is satisfied, performing resource allocation calculation according to the total return resource, the global received resource of each resource provider, and the resource share ratio, if it is determined that there is a tail difference resource according to the calculation result, determining the resource provider to be allocated with the tail difference resource according to the order determined by the sorting identifier, and determining the return resource to be allocated to each resource provider in combination with the calculation result, where the resource share ratio is the ratio of the borrowed resource to the total required resource.
In this embodiment, a unique ranking identity is configured separately for each resource provider that first constitutes the total required resource. For ease of understanding, each resource that first constitutes the total resources required may be referred to as an initial resource, and the resource provider to which the initial resource corresponds may be referred to as an initial resource provider. A unique ranking identifier is configured separately for each initial resource provider. The ordering identifier is used to indicate an order in which the resource provider is allocated tail-biting resources. The ranking identity may be determined based on an attribute value of a specified attribute of the resource provider, which may be dependent on the business requirements. The order in which resource providers are allocated bad resources may also reflect sideways the likelihood that resource providers are allocated bad resources, with the earlier ordered resource providers being more likely to be allocated bad resources.
In one embodiment, the resource share ratio and the resource identification may be used as an indicator of the order in which the resource providers are allocated bad resources. Accordingly, the ranking identification is generated based on the resource share ratio of the resource provider and the resource identification, which is determined based on the resource providing time of the resource provider and is used to identify the borrowed resource provided by the resource provider. The resource identifier can uniquely identify the loaned resource provided by the resource provider, and can be the identifier of the service (the loaned resource provided by the resource provider is used as a service), so that the resource identifiers corresponding to different resource providers are different, and the resource identifiers corresponding to the loaned resource provided by the same resource provider at different times are also different. The resource providing time may also be understood as the time of generation of the service that the resource provider provides the borrowed resource. The sorting identifier in this embodiment is generated based on the ratio of the resource shares of the resource providers and the resource identifier, so that the resource providers with large resource shares can be arranged before the resource providers with small resource shares, the order of the resource providers with large resource shares being allocated with the tail-drop resources is realized, and the probability of the resource providers with large resource shares being allocated with the tail-drop resources is larger than the probability of the resource providers with small resource shares being allocated with the tail-drop resources before the order of the resource providers with small resource shares being allocated with the tail-drop resources. The sequence of the allocated tail-drop resources of the resource providers with the same share ratio is determined by the resource identification, for example, the sequence of the allocated tail-drop resources of the resource providers with early resource providing time is arranged before the sequence of the allocated tail-drop resources of the resource providers with late resource providing time, so that the sequence of the allocated tail-drop resources of the resource providers is ordered from two dimensions, and the rationality of tail-drop resource allocation is improved.
In practical applications, there may be a case that the resource supply deadline of the resource provider is inconsistent with the resource demand deadline of the resource demander, so that in order not to affect the total required resources required by the resource demander during the resource demand, the resources currently provided by the resource provider whose resource supply deadline expires need to be supplemented by other resource providers. For ease of understanding, a resource provider whose resource supply deadline expires may be defined as an out-let resource provider, and other resource providers that pick up are defined as an out-let asset provider. While the number of assigned asset providers may be one or more. As shown in fig. 1B, a schematic diagram of resource transfer is shown in this specification according to an exemplary embodiment. In this diagram, assuming the resource demander is R, the initial resource provider is P a P supply b P supply c Meanwhile, it is assumed that P is supplied in the demand period of the resource demand side a Lease rights transfer to Provisioning P a1 For P b Lease rights transfer to Provisioning P b1 For P b1 At some point in time transfer of lease rights to supply P b2.1 And supply P b2.2 . As can be seen, at supply P b1 In other words, it acts as an assigned resource provider in a first transfer operation and as an assigned resource provider in a second transfer operation. As resource demander, it may be possible to return the resource in one pass or in multiple passes, so that the let-off resource provider may or may not obtain the return resource before transfer, and if the return resource is of the same type as the borrowed resource and the return resource contains a partial borrowed resource, this indicates that over time the demand for the resource by the resource demander will decrease, so that in this example the borrowed resource that the let-off resource provider needs to provide is smaller than the resource that the let-off resource provider first provides to the resource demander A source. Accordingly, the borrowed resource provided by the transferee resource provider, whether or not the lending resource provider is the initial resource provider, may be understood as a child of the initial resource. When the lending resource provider is an initial resource provider, lending resources provided by the lending resource provider as initial resources; when the lending resource provider is not the initial resource provider, the lending resource provided by the lending resource provider may be understood as a child of the initial resource. As shown in fig. 1B, for P b1 The loan resource provided may be for P b The sub-resource of the lended resource (which may be referred to as the original resource-b) is provided. P supply b2.1 And supply P b2.2 The provided lended resource may also be understood as a child of the original resource. That is, it can be considered as P b1 Lending resources, P b2.1 Lending resource supplies and P b2.2 The provided lended resource is attributed to the original resource-b.
Because the sorting identifier can be used for indicating the order of allocating the tail-end difference resources to the resource providers, the sorting identifier of the yielding resource provider can be assigned to (synchronized to) the sorting identifier of the assigned resource provider for the two resource providers which are in transfer, namely, the sorting identifier of the yielding resource provider is used as the sorting identifier of the assigned resource provider, so that each resource provider belonging to the same initial resource has the same sorting identifier, the sorting identifier can be understood as a global sorting identifier, and is used for indicating the order of allocating the tail-end difference resources to the resource provider, and therefore, each resource provider belonging to the same initial resource can enjoy the same tail-end difference allocation order, and reasonable tail-end difference allocation is realized. Still taking FIG. 1B as an example, for P a And P a1 With the same ordering identifier for P b P supply b1 、P b2.1 And supply P b2.2 With the same ordering identifier. Therefore, by limiting each resource provider belonging to the same initial resource to have the same sorting identifier, the sequence error of the assigned tail-difference resource of the assigned resource provider can be avoided, and the accuracy of tail-difference resource assignment is improved.
After transfer operation, inThe current received resources of the assigned resource provider are zero, but in order to ensure that the assigned resource provider can enjoy the same treatment as the let resource provider, a global received resource field is added, and the global received resource field is used for recording the sum of the received resources of all resource investors with transfer relationship, so that when the returned total resources provided by the resource demander are distributed to all resource providers, the returned resources returned to the resource provider are calculated according to the returned total resources, the global received resources of each resource provider and the resource share ratio. Thus, embodiments of the present description also assign (synchronize) the global received resource of the yielding resource provider to the global received resource of the assigned resource provider, i.e., take the global received resource of the yielding resource provider as the global received resource of the assigned resource provider. The global received resources of the yielding resource provider are: the method comprises the steps of providing a global received resource of a resource investor having a transfer relationship with a yielding resource provider, and a sum of currently received resources of the yielding resource provider, wherein the currently received resources are the sum of returned resources of the yielding resource provider for a resource demand. It will be appreciated that if the resource provider is not allowed to transfer prior to this transfer operation (e.g., supply P in FIG. 1B) a Or supply P b ) The global received resource is equal to the current received resource. If the resource provider is given a transfer prior to this transfer operation (e.g., supply P in FIG. 1B) b1 ) Then the global received resource is equal to the supply P b Currently received resources and P for it b1 Is the sum of currently received resources. P supply b In transferring rights to a donor P b1 At the time, synchronizing own global received resources to P b1 . P supply b1 The global received resource of (c) is updated with its current received resource.
In one embodiment, the resource demander may return the return resource to the respective resource provider at once. In another embodiment, the resource demander returns the resource to the resource provider at least twice, and further, the resource demander may also return the resource at an agreed time period.
The preset return resource condition may be that the preset return time is reached, or that a return request initiated by the resource demander is received. For example, some resource demanders may apply for an advanced return of resources when they do not currently need resources, such as by sending a return request to effect an advanced return of resources. It can be appreciated that the preset return resource condition may be other conditions, configured according to the service requirement, as long as the trigger condition of step 104 is executed.
After the preset return resource condition is met, resource allocation calculation can be performed, specifically, the resource allocation calculation can be performed according to the total return resource, the global received resource of each resource provider and the resource share ratio, if it is determined in the calculation process that tail difference resources exist, if a minimum unit needs to be allocated to a plurality of resource providers, the tail difference resources can be allocated.
The total returned resources can be the sum of returned resources of each resource provider in the current time of the resource demand side. A resource provider is a party that provides resources to the resource demander. The global received resources of the resource provider are: and the sum of the global received resources of the resource investors with the resource provider in the transfer relationship and the current received resources of the same resource provider. The share ratio of the resource is the ratio of the borrowed resource to the total required resource. In the embodiment, the resource allocation calculation is not performed through the current received resources of the resource provider, but is performed through the global received resources, and the assigned resource provider and the yielding resource provider are taken as a whole, so that the accuracy of resource allocation is improved. After finding out that the tail-biting resource exists, the method can directly determine how to allocate the tail-biting resource according to the sequence determined by the sequence identification. For example, the resource providers to be allocated with tail-end resources are determined according to the order determined by the sorting identifier, and the return resources to be allocated to each resource provider are determined in combination with the calculation result, and further, the operation of allocating the return resources to each resource provider may be performed.
As can be seen from the above embodiments, for the initial resource, no matter how many times the transfer operation occurs, the global sequence identifier is used as the split context reference information to perform the calculation logic processing when the resource is returned to the resource provider for each time of resource demand, so that the fairness and accuracy of the resource allocation can be improved.
The resources returned to the resource provider are defined as return resources. With respect to lending resources and return resources, the resources may be of different types, e.g., lending resources to computing resources and return resources to lease fees. In another example, the lending resource and the return resource belong to the same type of resource. For example, lending resources to storage resources, returning resources remain as storage resources, which may be understood as freeing. And lending the resource to the asset and returning the resource to the asset. Further, for the same resource provider, the sum of the return resources received by the resource provider is greater than the borrowed resources provided to the resource demander. In addition to the lending resources (which may be some or all, and may be determined according to the number of times of return by the resource demander), there may be additional resources (such as the propagation resources), so that the sum of the return resources received by the resource provider is greater than the lending resources provided to the resource demander.
In practice, the user may have a need to view the resources received by the resource provider, and for this reason, in one embodiment, the ranking identifier and the global received resource information are recorded in a resource record of the resource provider, where the resource record further includes: the resource provider has a resource identification and a currently received resource, the currently received resource being presented upon receipt of a resource query instruction, the resource identification being determined based on a resource providing time of the resource provider and being used to identify a borrowed resource provided by the resource provider. The embodiment can facilitate the user to inquire the received resources by recording the resource identification of the resource provider and the current received resources.
The various technical features of the above embodiments may be arbitrarily combined as long as there is no conflict or contradiction between the features, but are not described in detail, and therefore, the arbitrary combination of the various technical features of the above embodiments is also within the scope of the disclosure of the present specification.
The embodiment of the present disclosure may be applied in various application scenarios, and the following describes the scheme of the present application with reference to some specific application scenarios.
Example 1
Taking the cloud computing platform as an example, the central processing node can be used as a resource demand party, the other processing nodes can be used as resource providers, the central processing node can borrow computing resources of the other processing nodes, the borrowed computing resources can be returned in time, and even the cost for using the computing resources can be paid.
Example 2
Taking the cloud storage platform as an example, the central storage node can be used as a resource demand party, other storage nodes can be used as resource providers, the central storage node can borrow the storage resources of other storage nodes, and the borrowed storage resources can be returned in time, and even the cost of using the storage resources can be paid.
Example 3:
the resource allocation scheme can also be applied to financial asset allocation to improve asset allocation accuracy. The resource may be an asset, the resource provider may be an asset provider, and the resource demander may be an asset demander. In the process of distributing the returning total asset (total asset to be split) to each asset provider, the minimum unit (RMB: min., gold: mg) of the asset is needed, but in the scene of splitting according to the share proportion of the asset, the share proportion of different asset providers in one asset distribution scheme is in the case of decimal, so that the result of multiplying the benefit by the split target proportion may be in the form of decimal, the result of the split calculation multiplication needs to adopt a downward rounding precision scheme, and the calculation result of the total asset to be split and each asset provider is added up to form a difference, namely the split tail difference. And when the investment of the asset provider expires, the invested unexpired right is priced and then can be transferred to other asset providers, so that the equivalent right residual principal and the corresponding interest are obtained, and the current right liability relationship of the expired liquidity funds is obtained.
Based on the business characteristics of short-term borrowing and follow-up borrowing, a large amount of advanced repayment can be encountered, but the asset investors often invest standard financial products with fixed term interest rate and fixed deposit repayment. Part or all of the principal payouts received by the asset provider in the financial period need to be re-invested as soon as possible on the same day, and one or more borrowing assets corresponding to the same day can be thrown to the borrowing assets, so that the principal payouts can be automatically re-thrown after the principal payouts continue daily. Because the existence of automatic re-casting can lead to the mismatch of the deadlines of the financial products of the asset provider and the financial products of the asset demander, the corresponding investment of the financial products of the asset provider is not actually expired when the financial products of the asset provider expire, and therefore, the asset provider needs other asset providers to pay the remaining principal of the asset and the corresponding interest of the principal to obtain the principal withdrawal on the expiration date, and meanwhile, the remaining creditor is transferred to the paying party.
It follows that multiple creditor transfers may occur during the life cycle of an investment asset until the financing demand expires. When the profit distribution has tail difference, the received profit of each investment asset is preferentially considered, if the received profit is the same, the distribution is carried out from large to small according to the investment share, and under the extreme condition, the received profit and the investment share of two assets are the same, the distribution is carried out according to the asset identification sequence. But in the event of a creditor transfer, a new asset identification occurs such that the assignee's asset identification does not coincide with the leaving asset provider's asset identification, the assignee's received asset being 0. Fairness and continuity of tail-off distribution after debt conversion cannot be guaranteed, and therefore the benefits of the debt conversion asset cannot be completely equivalent to those of the situation that debt conversion does not occur.
By applying the resource allocation scheme provided by the specification, the method can be used for generating and distributing the equity transfer asset conversion and the tail difference, which are completely equivalent to the asset benefits under the scene of no occurrence of the equity transfer, no matter how many times of equity transfer operation occur in the process, the sum of benefits obtained by investors in each stage is consistent with the situation of no occurrence of the equity transfer, and the benefit distribution fairness of each investor is ensured.
First, a global received asset field and a sort identification field (which may also be referred to as a global sort identification field) are added to the asset record. A demand master asset of an asset demander is constituted by borrowed assets provided by asset providers, each asset provider constituting the demand master asset for the first time being respectively configured with a unique ordering identifier for indicating an order in which the asset providers are assigned a tail-stock asset, the method comprising:
before the expiration time of the asset demand occupied by the asset demander arrives, if a borrowing asset is transferred, assigning the sorting identifier of the lending asset provider to the sorting identifier of the transferee asset provider, and assigning the global received asset of the lending asset provider to the global received asset of the transferee asset provider, wherein the global received asset of the lending asset provider is: a global received asset of the asset sponsor in transfer relationship with the let-off asset provider, a sum of currently received assets of the let-off asset provider;
And when the preset return asset condition is met, carrying out asset allocation calculation according to the total return asset, the global received asset of each asset provider and the asset share ratio, if the tail difference asset is judged to exist according to the calculation result, determining the asset provider to be allocated with the tail difference asset according to the sequence determined by the sorting identification, and determining the return asset to be allocated to each asset provider by combining the calculation result, wherein the asset share ratio is the ratio of the borrowed asset to the total demand asset.
The global received asset field may include, among other things, a global received original asset (e.g., principal) and a global received resting asset (e.g., interest). As shown in fig. 2, an asset record schematic diagram is shown in this specification according to an exemplary embodiment, in which an asset Identification (ID), an asset account, a received principal_current, a received interest_current, a received principal_global, a received interest_global, and an asset global order identification may be included. When financing demand is matched and recruited successfully to generate borrowed assets for the first time, sorting is carried out according to the two dimensions of the asset share ratio and the asset identification of the current asset provider, sorting marks (ORDERs) are obtained and are persisted on asset records, when the right transfer is carried out, assets required by the assigned asset provider are determined according to the received assets of the assigned asset provider, and the asset records of the assigned asset provider are generated, the sorting identifications (also called as asset global sequence identifications) of the assigned asset provider are synchronized to the asset records of the assigned asset provider. Considering that the newly generated asset after the right transfer is zero in the fields of the received profit (act_int) and the received principal (act_prin) of the asset for the assigned asset provider, if the tail-end differential allocation is performed according to the received profit and the received principal, the phenomenon of unfair tail-end differential allocation is caused in the global profit allocation process. Therefore, in addition to the requirement of meeting the exhibition, the present embodiment includes fields such as the current received principal and the current received interest in the asset record, and the fields such as the global received interest (uni_act_int) and the global received principal (uni_act_prin) in the asset record, which are used for recording the continuity state of the asset with the debt transfer in the whole life cycle, the newly added global field is copied from the existing asset record as it is when the debt transfer new asset is generated, and the same operation needs to be performed on the relevant profit amount field and the global relevant profit amount field of the current asset at the same time in the process of doing business by the asset record.
As shown in fig. 3, a timing diagram of an asset allocation method is shown in accordance with an exemplary embodiment of the present description. The asset allocation method can be applied to a server as an asset allocation computing component. When a certain service needs to perform asset allocation, an asset allocation request can be sent to an asset allocation computing component, the asset allocation computing component checks parameters carried by the asset allocation request, and after the parameters pass the check, an asset record set corresponding to the request is obtained from an asset data source, wherein the asset record set comprises asset records of all asset providers corresponding to asset demanders. The asset allocation calculation component can perform interest allocation calculation according to the global received interest of the asset, the interest to be split this time and the proportion of the asset, and can perform principal allocation calculation according to the global received principal of the asset, the principal to be split this time and the proportion of the asset. When determining that the tail-stock asset (possibly principal tail-stock asset or interest tail-stock asset) exists according to the calculation result, determining asset providers of the tail-stock asset to be distributed according to the sequence determined by the sorting identification, and obtaining the asset to be distributed of each asset provider by combining the calculation result and feeding back the result.
For an example illustration, for a 1000-ary borrowing requirement, four investors A, B, C, D respectively invest 100, 300, and corresponding holding asset identification A, B, C, D, and the global received benefits are the same as the current received benefits given that A, B, C, D does not perform bond transfer operations based on borrower interest repayment operations. The earnings received by each investor are shown in the following table:
assuming that investor B invests due, transferring the unexpired bond of invested to investor B1, the ranking identity, global received interest and global received principal of investor B are synchronized into the asset record of investor B1 so that the next time the asset allocation is performed, the ranking identity, global received interest and global received principal can be combined for allocation. For example, principal allocation calculation is performed according to the principal returned at this time, the global received principal of each asset provider, and the asset share ratio, if it is determined that there is a bad tail asset according to the calculation result, it is assumed that if the investor B still exists, the bad tail asset should be allocated to the investor B, and the investor B exits now, and the bad tail asset is allocated to B1 instead of the investor C according to the ranking identifier.
It can be seen that, in the completion life cycle of a credit service, for a single investor asset, no matter how many creditor transfer operations have occurred, the global asset attribute and the global asset sequence identifier are used as splitting context reference information to perform calculation logic processing when each borrower pays for revenue distribution. Therefore, the method can simultaneously meet the income display requirement of the liability transfer asset and can also ensure the fairness of income distribution in the life cycle of the liability transfer asset.
Corresponding to the embodiment of the resource allocation method, the present disclosure also provides an embodiment of the resource allocation device and the electronic device to which the resource allocation device is applied.
The embodiment of the resource allocation device can be applied to computer equipment. The apparatus embodiments may be implemented by software, or may be implemented by hardware or a combination of hardware and software. Taking software implementation as an example, the device in a logic sense is formed by reading corresponding computer program instructions in a nonvolatile memory into a memory by a processor of a computer device where the device is located for operation. In terms of hardware, as shown in fig. 4, a hardware structure diagram of a computer device where the resource allocation apparatus is located in the present disclosure is shown in fig. 4, and in addition to the processor 410, the network interface 420, the memory 430, and the nonvolatile memory 440 shown in fig. 4, the computer device where the resource allocation apparatus 431 is located in the embodiment generally may further include other hardware according to the actual function of the device, which is not described herein.
As shown in fig. 5, which is a block diagram of a resource allocation apparatus according to an exemplary embodiment of the present disclosure, a demand total resource of a resource demander is formed by borrowed resources provided by resource providers, and each resource provider that first forms the demand total resource is configured with a unique ordering identifier, where the ordering identifier is used to indicate an order in which the resource providers are allocated tail-end resources, and the apparatus includes:
a data assignment module 52 for: before the expiration time of the resource demand occupied by the resource demander arrives, if a borrowing resource is executed to transfer, assigning the sorting identifier of the yielding resource provider to the sorting identifier of the yielding resource provider, and assigning the global received resource of the yielding resource provider to the global received resource of the yielding resource provider, wherein the global received resource of the yielding resource provider is: a global received resource of the resource sponsor in transfer relationship with the yielding resource provider, a sum of currently received resources of the yielding resource provider;
a deployment processing module 54 for: and when the preset return resource condition is met, carrying out resource allocation calculation according to the total return resource, the global received resource of each resource provider and the resource share ratio, if the tail difference resource is judged to exist according to the calculation result, determining the resource provider to be allocated with the tail difference resource according to the sequence determined by the sorting identification, and determining the return resource to be allocated to each resource provider by combining the calculation result, wherein the resource share ratio is the ratio of the borrowed resource to the total required resource.
In one embodiment, the ranking identification is generated based on the resource share ratio of the resource provider and a resource identification that is determined based on the resource provider's resource provisioning time and is used to identify the lended resource provided by the resource provider.
In one embodiment, the lending resource and the return resource belong to the same type of resource, and the sum of the return resources received by the resource provider is greater than the lending resource provided to the resource demander for the same resource provider.
In one embodiment, the resource demander returns the resource to the resource provider at least twice.
For the device embodiments, reference is made to the description of the method embodiments for the relevant points, since they essentially correspond to the method embodiments. The apparatus embodiments described above are merely illustrative, wherein the modules illustrated as separate components may or may not be physically separate, and the components shown as modules may or may not be physical, i.e., may be located in one place, or may be distributed over a plurality of network modules. Some or all of the modules may be selected according to actual needs to achieve the purposes of the present description. Those of ordinary skill in the art will understand and implement the present invention without undue burden.
Accordingly, the present disclosure also provides a computer device, including a memory, a processor, and a computer program stored in the memory and executable on the processor, where a total required resource of a resource demander is formed by lended resources provided by resource providers, and each resource provider that first forms the total required resource is configured with a unique ordering identifier, where the ordering identifier is used to indicate an order in which the resource providers are allocated tail-end resources, and when the processor executes the program, the processor implements the following method:
before the expiration time of the resource demand occupied by the resource demander arrives, if a borrowing resource is executed to transfer, assigning the sorting identifier of the yielding resource provider to the sorting identifier of the yielding resource provider, and assigning the global received resource of the yielding resource provider to the global received resource of the yielding resource provider, wherein the global received resource of the yielding resource provider is: a global received resource of the resource sponsor in transfer relationship with the yielding resource provider, a sum of currently received resources of the yielding resource provider;
and when the preset return resource condition is met, carrying out resource allocation calculation according to the total return resource, the global received resource of each resource provider and the resource share ratio, if the tail difference resource is judged to exist according to the calculation result, determining the resource provider to be allocated with the tail difference resource according to the sequence determined by the sorting identification, and determining the return resource to be allocated to each resource provider by combining the calculation result, wherein the resource share ratio is the ratio of the borrowed resource to the total required resource.
In this specification, each embodiment is described in a progressive manner, and identical and similar parts of each embodiment are all referred to each other, and each embodiment mainly describes differences from other embodiments. In particular, for the apparatus embodiments, since they are substantially similar to the method embodiments, the description is relatively simple, and reference is made to the description of the method embodiments in part.
Correspondingly, the present disclosure further provides a computer storage medium, where a program instruction is stored in the storage medium, a total demand resource of a resource demand party is formed by borrowed resources provided by resource providers, and unique sorting identifiers are configured for each resource provider that first forms the total demand resource, where the sorting identifiers are used to indicate an order in which the resource providers are allocated tail-end resources, and the program instruction includes:
before the expiration time of the resource demand occupied by the resource demander arrives, if a borrowing resource is executed to transfer, assigning the sorting identifier of the yielding resource provider to the sorting identifier of the yielding resource provider, and assigning the global received resource of the yielding resource provider to the global received resource of the yielding resource provider, wherein the global received resource of the yielding resource provider is: a global received resource of the resource sponsor in transfer relationship with the yielding resource provider, a sum of currently received resources of the yielding resource provider;
And when the preset return resource condition is met, carrying out resource allocation calculation according to the total return resource, the global received resource of each resource provider and the resource share ratio, if the tail difference resource is judged to exist according to the calculation result, determining the resource provider to be allocated with the tail difference resource according to the sequence determined by the sorting identification, and determining the return resource to be allocated to each resource provider by combining the calculation result, wherein the resource share ratio is the ratio of the borrowed resource to the total required resource.
Embodiments of the present description may take the form of a computer program product embodied on one or more storage media (including, but not limited to, disk storage, CD-ROM, optical storage, etc.) having program code embodied therein. Computer-usable storage media include both permanent and non-permanent, removable and non-removable media, and information storage may be implemented by any method or technology. The information may be computer readable instructions, data structures, modules of a program, or other data. Examples of storage media for a computer 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 Disks (DVD) or other optical storage, magnetic cassettes, magnetic tape magnetic disk storage or other magnetic storage devices, or any other non-transmission medium, may be used to store information that may be accessed by the computing device.
Other embodiments of the present description will be apparent to those skilled in the art from consideration of the specification and practice of the invention disclosed herein. This specification is intended to cover any variations, uses, or adaptations of the specification following, in general, the principles of the specification and including such departures from the present disclosure as come within known or customary practice within the art to which the specification pertains. It is intended that the specification and examples be considered as exemplary only, with a true scope and spirit of the specification being indicated by the following claims.
It is to be understood that the present description is not limited to the precise arrangements and instrumentalities shown in the drawings, which have been described above, and that various modifications and changes may be made without departing from the scope thereof. The scope of the present description is limited only by the appended claims.
The foregoing description of the preferred embodiments is provided for the purpose of illustration only, and is not intended to limit the scope of the disclosure, since any modifications, equivalents, improvements, etc. that fall within the spirit and principles of the disclosure are intended to be included within the scope of the disclosure.
Claims (10)
1. A resource allocation method, in which a total required resource of a resource requiring party is formed by borrowed resources provided by resource providers, and unique sorting identifiers are respectively configured for each resource provider that first forms the total required resource, where the sorting identifiers are used to indicate an order in which the resource providers are allocated tail-end resources, the method includes:
Before the expiration time of the resource demand occupied by the resource demander arrives, if a borrowing resource is executed to transfer, assigning the sorting identifier of the yielding resource provider to the sorting identifier of the yielding resource provider, and assigning the global received resource of the yielding resource provider to the global received resource of the yielding resource provider, wherein the global received resource of the yielding resource provider is: a global received resource of the resource sponsor in transfer relationship with the yielding resource provider, a sum of currently received resources of the yielding resource provider;
and when the preset return resource condition is met, carrying out resource allocation calculation according to the total return resource, the global received resource of each resource provider and the resource share ratio, if the tail difference resource is judged to exist according to the calculation result, determining the resource provider to be allocated with the tail difference resource according to the sequence determined by the sorting identification, and determining the return resource to be allocated to each resource provider by combining the calculation result, wherein the resource share ratio is the ratio of the borrowed resource to the total required resource.
2. The method of claim 1, the ranking identification generated based on a resource share ratio of a resource provider and a resource identification determined based on a resource provisioning time of the resource provider and used to identify lended resources provided by the resource provider.
3. The method of claim 1, the lending resource and the return resource belonging to the same type of resource, a sum of the return resources received by the resource provider being greater for the same resource provider than the lending resource provided to the resource demander.
4. The method of claim 1, the resource demander returning resources to a resource provider at least twice.
5. The method of any of claims 1 to 4, the ranking identity and global received resource information being recorded in a resource record of a resource provider, the resource record further comprising: the resource provider has a resource identification and a currently received resource, the currently received resource being presented upon receipt of a resource query instruction, the resource identification being determined based on a resource providing time of the resource provider and being used to identify a borrowed resource provided by the resource provider.
6. The method of any of claims 1-4, the resource demander and the resource provider each being a processing node of a cloud computing platform, the borrowed resource and the total required resource being computing resources on the processing node.
7. The method of any one of claims 1 to 4, the preset return resource conditions comprising at least one of:
The preset return time is reached;
a return request initiated by the resource demander is received.
8. The method of any of claims 1 to 4, wherein the resource allocation method is performed by an asset allocation computing component of the server upon receiving an asset allocation request sent by a service requiring asset allocation.
9. A resource allocation apparatus, a demand total resource of a resource demander being constituted by borrowed resources provided by resource providers, unique sort identifications being respectively configured for each resource provider constituting the demand total resource for the first time, the sort identifications being used to indicate an order in which the resource providers are allocated tail-biting resources, the apparatus comprising:
the data assignment module is used for: before the expiration time of the resource demand occupied by the resource demander arrives, if a borrowing resource is executed to transfer, assigning the sorting identifier of the yielding resource provider to the sorting identifier of the yielding resource provider, and assigning the global received resource of the yielding resource provider to the global received resource of the yielding resource provider, wherein the global received resource of the yielding resource provider is: a global received resource of the resource sponsor in transfer relationship with the yielding resource provider, a sum of currently received resources of the yielding resource provider;
The allocation processing module is used for: and when the preset return resource condition is met, carrying out resource allocation calculation according to the total return resource, the global received resource of each resource provider and the resource share ratio, if the tail difference resource is judged to exist according to the calculation result, determining the resource provider to be allocated with the tail difference resource according to the sequence determined by the sorting identification, and determining the return resource to be allocated to each resource provider by combining the calculation result, wherein the resource share ratio is the ratio of the borrowed resource to the total required resource.
10. A computer device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, wherein the processor implements the method of any one of claims 1 to 8 when the program is executed by the processor.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311249170.9A CN117391338A (en) | 2018-12-12 | 2018-12-12 | Resource allocation method, device and equipment |
Applications Claiming Priority (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811519340.XA CN110033154B (en) | 2018-12-12 | 2018-12-12 | Resource allocation method, device and equipment |
| CN202311249170.9A CN117391338A (en) | 2018-12-12 | 2018-12-12 | Resource allocation method, device and equipment |
Related Parent Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811519340.XA Division CN110033154B (en) | 2018-12-12 | 2018-12-12 | Resource allocation method, device and equipment |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN117391338A true CN117391338A (en) | 2024-01-12 |
Family
ID=67235321
Family Applications (2)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202311249170.9A Pending CN117391338A (en) | 2018-12-12 | 2018-12-12 | Resource allocation method, device and equipment |
| CN201811519340.XA Active CN110033154B (en) | 2018-12-12 | 2018-12-12 | Resource allocation method, device and equipment |
Family Applications After (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811519340.XA Active CN110033154B (en) | 2018-12-12 | 2018-12-12 | Resource allocation method, device and equipment |
Country Status (1)
| Country | Link |
|---|---|
| CN (2) | CN117391338A (en) |
Families Citing this family (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110633294B (en) * | 2019-09-20 | 2022-04-05 | 中国银行股份有限公司 | Data processing method, device and storage medium |
| CN112581245A (en) * | 2020-12-15 | 2021-03-30 | 中国建设银行股份有限公司 | Resource processing method, device and equipment |
| CN117372166B (en) * | 2023-10-26 | 2024-03-08 | 北京开科唯识技术股份有限公司 | Efficient tail-end distribution processing method, device and storage medium |
Family Cites Families (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101271550A (en) * | 2008-05-09 | 2008-09-24 | 金蝶软件（中国）有限公司 | Data distribution method and device in application system |
| CN107123051B (en) * | 2016-02-25 | 2020-09-04 | 阿里巴巴集团控股有限公司 | Resource synchronization method and device |
| CN107239865B (en) * | 2016-03-28 | 2020-12-22 | 创新先进技术有限公司 | Method, device and system for scheduling internet information resources |
-
2018
- 2018-12-12 CN CN202311249170.9A patent/CN117391338A/en active Pending
- 2018-12-12 CN CN201811519340.XA patent/CN110033154B/en active Active
Also Published As
| Publication number | Publication date |
|---|---|
| CN110033154A (en) | 2019-07-19 |
| CN110033154B (en) | 2023-10-20 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US20210006506A1 (en) | Allocating virtual resource based on block chain | |
| CN109242681B (en) | Asset data storage method, device, equipment and system | |
| TW202105276A (en) | Allocating virtual resource based on block chain | |
| CN110033154B (en) | Resource allocation method, device and equipment | |
| CN109933593B (en) | Asset data recording method, device and equipment | |
| CN112200571B (en) | Resource distribution method and device based on block chain and electronic equipment | |
| KR102254809B1 (en) | Distributed computing resources sharing system and computing apparatus thereof providing reward based on block chain | |
| US11049115B2 (en) | Blockchain-based bill write-off method, apparatus, electronic device, and storage medium | |
| CN110020948B (en) | Asset tracing method and device based on block chain and electronic equipment | |
| CN110910230A (en) | Accounting method, accounting system and storage medium | |
| CN112200568B (en) | Block chain based account creation method and device and electronic equipment | |
| CN113421156A (en) | Asset management method and device based on block chain and electronic equipment | |
| CN112200567A (en) | Resource management method and device based on block chain and electronic equipment | |
| CN112200572A (en) | Resource distribution method and device based on block chain and electronic equipment | |
| CN111984677B (en) | Resource data checking method, device, computer equipment and storage medium | |
| CN113762940A (en) | Asset management method and device based on block chain and electronic equipment | |
| CN107018158B (en) | Method and device for screening internet resources | |
| KR20210113405A (en) | Media distribution system using blockchain and its operation method | |
| CN116523670A (en) | Credential management method, device, equipment and storage medium | |
| US20230073883A1 (en) | Multi-blockchain token rebalancer | |
| US11348167B2 (en) | Method and storage medium for private edge-station auction house | |
| CN114022136A (en) | Method, equipment and system for computing power transaction | |
| CN114820184A (en) | Non-homogeneous evidence-based commodity transaction system and equipment | |
| CN112200570A (en) | Resource distribution method and device based on block chain and electronic equipment | |
| CN115456772A (en) | Intelligent contract creating method and device |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination |