Resource mapping method and system
By splitting resource blocks into atomic units and combining virtual channels and dynamic precision calculations, the problem of insufficient responsiveness caused by excessively large resource allocation granularity is solved, realizing the personalized and refined requirements of high-frequency resource allocation and improving system responsiveness.
Patent Information
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- PERSAGY TECHNOLOGY CO LTD
- Filing Date
- 2026-03-03
- Publication Date
- 2026-06-09
Smart Images

Figure CN122173279A_ABST
Abstract
Description
Technical Field
[0001] This invention relates to the field of data processing technology, specifically to the field of resource management and allocation, and particularly to a resource mapping method and system. Background Technology
[0002] Existing resource allocation systems, especially those allocating various anticipated resources, are based on a static resource allocation method. Typically, the resource blocks to be allocated at a specific time period are first stored as a whole. Then, the allocation parameters, such as the allocation order and allocation ratio of each allocation entity for the resource block, are stored as static data. When the allocation time arrives, the resource blocks are allocated among the allocation entities based on this static data.
[0003] In the process of developing this invention, the inventors discovered that existing resource allocation systems have the following defects: the granularity of resource allocation in the resource allocation system is too large, which leads to a correspondingly long resource allocation cycle. This results in insufficient response capability of the resource allocation system in scenarios with high-frequency resource allocation requests, with obvious response latency, and it cannot meet people's growing demand for personalized and refined resource allocation. Summary of the Invention
[0004] This invention provides a resource mapping method and system to offer a new approach to resource mapping, meeting people's personalized and refined resource allocation needs.
[0005] According to one aspect of the present invention, a resource mapping method is provided, comprising: When a new expected resource block is detected to be injected into the underlying resource pool, the supply time span and expected total supply of the expected resource block are extracted. Based on the supply time span and the expected total supply, the expected resource block is divided into multiple resource atomic units, where the unit description information of the resource atomic unit defines the expected supply of resources under the set time unit. When a target resource acquisition request is detected, the target resource demand and target resource conversion window period that match the target resource acquisition request are obtained; Based on the target resource demand and the target resource conversion window, at least one target resource atom unit is obtained from the unmapped resource atom units in the underlying resource pool and mapped to the requester of the target resource acquisition request.
[0006] According to another aspect of the present invention, a resource mapping apparatus is also provided, comprising: The first key information extraction module is used to extract the supply time span and expected total supply of the expected resource block when a new expected resource block is detected to be injected into the underlying resource pool. The atomic unit splitting module is used to split the expected resource block into multiple resource atomic units according to the supply time span and the expected total supply. The unit description information of the resource atomic unit defines the expected supply of resources under the set time unit. The second key information acquisition module is used to acquire the target resource demand and target resource conversion window period that match the target resource acquisition request when a target resource acquisition request is detected. The atomic unit mapping module is used to obtain at least one target resource atomic unit from the currently unmapped resource atomic units in the underlying resource pool and map it to the requester of the target resource acquisition request, based on the target resource demand and the target resource conversion window.
[0007] According to another aspect of the present invention, a resource mapping system is also provided, including: a sensor, an underlying resource pool, a dynamic actuarial engine, a virtual ledger, and a smart contract executor; wherein, the sensor is connected to the underlying resource pool, the underlying resource pool is connected to the dynamic actuarial engine, the dynamic actuarial engine is connected to the virtual ledger, and the virtual ledger is connected to the smart contract executor. Sensors are used to inject new expected resource blocks into the underlying resource pool or send local failure information matching the expected resource blocks when resource changes are detected. The underlying resource pool is used to store expected resource blocks; A dynamic actuarial engine is used to execute the resource mapping method as described in any one of the embodiments of the present invention; A virtual ledger is used to update records in real time with the expected amount of resources for each requester during the matched resource conversion window. The smart contract executor is used to allocate the expected amount of resources recorded in the virtual ledger that matches the target requester's resource conversion window when the current system time reaches the end time.
[0008] According to another aspect of the present invention, an electronic device is also provided, the electronic device comprising: At least one processor; and A memory communicatively connected to the at least one processor; wherein, The memory stores a computer program that can be executed by the at least one processor, the computer program being executed by the at least one processor to enable the at least one processor to perform the resource mapping method according to any embodiment of the present invention.
[0009] According to another aspect of the present invention, a computer-readable storage medium is also provided, the computer-readable storage medium storing computer instructions for causing a processor to execute and implement the resource mapping method described in any embodiment of the present invention.
[0010] According to another aspect of the present invention, a computer program product is also provided, including a computer program that, when executed by a processor, implements the steps of the resource mapping method as described in any embodiment of the present invention.
[0011] The technical solution of this invention, when detecting the injection of a new expected resource block into the underlying resource pool, extracts the supply time span and expected total supply of the expected resource block; based on the supply time span and expected total supply, the expected resource block is divided into multiple resource atomic units; when detecting a target resource acquisition request, the target resource demand and target resource conversion window period matching the target resource acquisition request are obtained; according to the target resource demand and target resource conversion window period, at least one target resource atomic unit is mapped to the requester of the target resource acquisition request from each resource atomic unit currently in an unmapped state in the underlying resource pool. This technical means can divide resource allocation units into the smallest granularity, thereby enabling the allocation of expected resources at a finer time scale. It can effectively improve the response capability of the resource allocation system in high-frequency resource allocation scenarios, while meeting people's growing personalized and refined resource allocation needs, and providing a unified data processing foundation for the dynamic mapping and recombination of resource atomic units in the time dimension.
[0012] It should be understood that the description in this section is not intended to identify key or essential features of the embodiments of the present invention, nor is it intended to limit the scope of the invention. Other features of the invention will become readily apparent from the following description. Attached Figure Description
[0013] To more clearly illustrate the technical solutions in the embodiments of the present invention, the accompanying drawings used in the description of the embodiments will be briefly introduced below. Obviously, the accompanying drawings described below are only some embodiments of the present invention. For those skilled in the art, other drawings can be obtained based on these drawings without creative effort.
[0014] Figure 1 This is a flowchart of a resource mapping method provided according to an embodiment of the present invention; Figure 2 This is a flowchart of another resource mapping method provided according to an embodiment of the present invention; Figure 3This is a trend chart showing the change in resource exchange rate as the percentage of virtual channel plans are completed, applicable to an embodiment of the present invention. Figure 4 This is a flowchart of another resource mapping method provided according to an embodiment of the present invention; Figure 5 This is a flowchart of yet another resource mapping method provided by an embodiment of the present invention; Figure 6 This is a schematic diagram of the structure of a resource mapping device according to an embodiment of the present invention; Figure 7 This is a schematic diagram of the structure of a resource mapping system provided according to an embodiment of the present invention; Figure 8 This is a schematic diagram of the structure of an electronic device that implements an embodiment of the present invention. Detailed Implementation
[0015] To enable those skilled in the art to better understand the present invention, the technical solutions of the present invention will be clearly and completely described below with reference to the accompanying drawings of the embodiments of the present invention. Obviously, the described embodiments are only some embodiments of the present invention, and not all embodiments. Based on the embodiments of the present invention, all other embodiments obtained by those skilled in the art without creative effort should fall within the scope of protection of the present invention.
[0016] It should be noted that the terms "first," "second," etc., in the specification, claims, and accompanying drawings of this invention are used to distinguish similar objects and are not necessarily used to describe a specific order or sequence. It should be understood that such data can be interchanged where appropriate so that the embodiments of the invention described herein can be implemented in orders other than those illustrated or described herein. Furthermore, the terms "comprising" and "having," and any variations thereof, are intended to cover non-exclusive inclusion; for example, a process, method, system, product, or apparatus that comprises a series of steps or units is not necessarily limited to those steps or units explicitly listed, but may include other steps or units not explicitly listed or inherent to such processes, methods, products, or apparatus.
[0017] Figure 1 This is a flowchart illustrating a resource mapping method provided in an embodiment of the present invention. This embodiment is applicable to situations where expected resource blocks that are allowed to be allocated within a set future time period are divided into multiple resource atomic units, and each resource atomic unit is mapped to a resource requester as the smallest mapping unit. This method can be executed by a resource mapping device, which can be implemented in hardware and / or software, and is generally configured in a server or server cluster with data security processing capabilities. Figure 1 As shown, the method includes: S110. When a new expected resource block is detected to be injected into the underlying resource pool, extract the supply time span and expected total supply of the expected resource block.
[0018] The underlying resource pool stores various anticipated resource blocks that will be available for use in the future. This underlying resource pool can be pre-connected to preset sensors or a resource supply system to inject anticipated resource blocks detected by the sensors or generated by the resource supply system in real time into the underlying resource pool.
[0019] In this context, a projected resource block can be understood as the total amount of resources (i.e., the projected total supply) that a resource supply system can provide (or generate) within a preset future time interval (i.e., the supply time span). For example, in an AI computing power supply scenario, this projected resource block can be understood as the total AI computing power that an AI computing power supply system can release in the next 24 hours; or in a new energy power supply scenario, this projected resource block can be understood as the total power supply that a preset energy storage power station can provide in the next 48 hours; or in a network bandwidth resource scheduling scenario, this projected resource block can be understood as the maximum available bandwidth that a certain communication link can provide during future peak periods (e.g., from 6 pm to 10 pm); or in a real estate financial product purchase scenario, this projected resource block can be understood as the total rent that a property office building can generate in the next month, quarter, or year, etc. This embodiment does not impose any limitations on this.
[0020] Correspondingly, the expected total supply can be further understood as the total amount of resources that can be provided within the supply time span (the next day, month, or year, etc.).
[0021] S120. Based on the supply time span and the expected total supply, the expected resource block is divided into multiple resource atomic units, wherein the unit description information of the resource atomic unit defines the expected supply of resources under the set time unit.
[0022] In this embodiment, to address the problem of excessively large resource allocation granularity in existing resource allocation systems, which leads to correspondingly long allocation cycles for expected resources, a creative lean approach to splitting expected resource blocks is proposed. Specifically, expected resource blocks can be split along both the time and resource quantity dimensions to obtain resource atomic units as the smallest unit of resource allocation.
[0023] In an optional implementation of this embodiment, dividing the expected resource block into multiple resource atomic units based on the supply time span and the expected total supply may include: S1201, Obtain the minimum resource supply time span and the minimum resource allocation amount.
[0024] The minimum resource supply time span can be understood as the time atomic unit that breaks down the expected resource block in the time dimension. For example, the minimum resource supply time span can be 1 second, 1 minute, 1 hour, or 1 day, etc. The minimum resource supply time span can be preset according to the specific resource allocation scenario, and this embodiment does not impose any restrictions on it.
[0025] In a specific example, regarding the purchase of real estate financial products, since property rent is generally collected monthly or quarterly, the purchase cycle of existing real estate financial products is often measured in months or years. However, through the more granular expected resource block splitting method described above, users can even purchase the real estate financial product in hours or days. In another specific example, regarding AI computing power supply scenarios, the minimum resource supply time span can be understood as the smallest time unit in which the AI computing power supply system can produce computing power resources that can be used once. This minimum resource supply time span can be determined based on the average execution time of each computing power task.
[0026] The minimum resource allocation can be understood as the atomic unit of resource quantity in the expected resource block, broken down in terms of resource quantity. This minimum resource allocation can be understood as the minimum amount of resources that can be independently allocated to a single user. Taking the purchase scenario of real estate financial products as an example, this minimum resource allocation can be calculated as the interest value obtained by multiplying the minimum interest-bearing period by the preset interest rate and the preset resource subscription amount. Furthermore, for AI computing power supply scenarios, this minimum resource allocation can be understood as the minimum computing power resources required to execute a single minimum computing power task.
[0027] S1202. According to the minimum resource supply time span, the expected resource block is divided into multiple initial resource partitioning units, wherein each initial resource partitioning unit has a set initial resource quantity.
[0028] As mentioned earlier, the expected resource block defines the total amount of resources that can be provided within a given supply time span. Therefore, this total amount of resources (the expected total supply) can be broken down within that supply time span. For example, assuming the expected resource block represents the total electricity supply N expected to be provided (or expected to be supplied) within the next 48 hours, and the minimum resource supply time span is 1 hour, the expected resource block can be divided into 48 initial resource allocation units that can expect to provide N / 48 units of electricity within a specific 1-hour period in the future. As another example, assuming the expected resource block represents the total rent M expected to be generated within the next year, and the minimum resource supply time span is 1 month, the expected resource block can be divided into 12 initial resource allocation units that can expect to provide M / 12 units of rent within a specific 1-month period in the future, and so on.
[0029] Of course, it is understandable that, in addition to directly using the minimum resource supply time span to split the expected resource block into the smallest time granularity, one can also use an integer multiple of the minimum resource supply time span, such as 2 or 3 times, to split the expected resource block into an integer multiple of the minimum time granularity, in order to meet the resource allocation needs under different requirements or different usage scenarios.
[0030] S1203. According to the minimum resource allocation, each initial resource partitioning unit is further divided based on the initial resource amount to obtain the multiple resource atomic units.
[0031] Similarly, under this minimum resource allocation, each initial resource partitioning unit can be further subdivided based on the initial resource amount to obtain the multiple resource atomic units.
[0032] Furthermore, assuming that the initial resource allocation unit is expected to generate 1000 joules of power supply in the next hour from 11:00 on February 9, 2026 to 12:00 on February 9, 2026, and the minimum resource allocation is 10 joules, then the initial resource allocation unit can be divided into 100 resource atomic units, each expected to provide 10 joules of power supply in the aforementioned next hour.
[0033] Understandably, in addition to directly using the minimum resource allocation amount to split the initial resource partition unit at the minimum resource granularity, one can also use integer multiples of the minimum resource allocation amount, such as 2 or 3 times, to split the initial resource partition unit at integer multiples of the minimum resource granularity, in order to meet the resource allocation requirements under different needs or different usage scenarios.
[0034] Accordingly, the set time unit defined in the unit description information is an integer multiple of the minimum resource supply time span, and the resource quantity defined in the unit description information is an integer multiple of the minimum resource allocation quantity.
[0035] In this embodiment, the atomic partitioning method of the new expected resource block can be determined by recording the data in a table in the underlying resource pool. That is, the information of the above-mentioned multiple resource atomic units is stored, instead of directly changing the data structure of the expected resource block in the underlying resource pool.
[0036] Furthermore, each resource atom unit can be defined by matching unit description information. The unit description information of a resource atom unit specifically defines the preset amount of resources that the resource atom unit is expected to provide within a preset future time period.
[0037] S130. When a target resource acquisition request is detected, obtain the target resource demand and target resource conversion window period that match the target resource acquisition request.
[0038] In this embodiment, the target resource acquisition request can be understood as a request to acquire a set amount of resources (i.e., the target resource demand) from the underlying resource pool after a set waiting time (i.e., the target resource conversion window period) starting from the current system time.
[0039] In a specific example, regarding the purchase of real estate financial products, the request for acquiring the target resource could be initiated by the requesting party, who would purchase the specified real estate financial product starting from the request date, hold it for a total of 3 days, and expect to receive interest after the 3rd day. In another specific example, regarding the supply of AI computing power, the request for acquiring the target resource could be initiated by the requesting party, starting from the current system time, expecting to use a specified amount of AI computing power 2 hours later.
[0040] Correspondingly, the target resource conversion window period can be understood as the waiting time interval for obtaining the target resource demand from the underlying resource pool. The starting point of this target resource conversion window period is the initiation time A of the target resource acquisition request, and the ending point of this target resource conversion window period is the sum of the initiation time A and the preset waiting time (which can also be understood as the duration of the time window).
[0041] S140. Based on the target resource demand and the target resource conversion window, among the resource atomic units currently in an unmapped state in the underlying resource pool, obtain at least one target resource atomic unit and map it to the requester of the target resource acquisition request.
[0042] Understandably, the resource atomic units split from the underlying resource pool have two states: a mapped state and an unmapped state. A resource atomic unit in the mapped state can be understood as a resource that has been allocated to a specified requester (or directly as a resource acquisition request), while a resource atomic unit in the unmapped state can be understood as a resource that is not currently mapped to any requester (or resource acquisition request) and can be used to establish a mapping relationship with a new resource acquisition requester.
[0043] Understandably, since a request for the target resource expects to be allocated the required amount of resources after the target resource conversion window is reached, it is most appropriate to provide the resource atomic units produced within that conversion window to the requester. Resource atomic units produced before the conversion window should be preferentially allocated to other requesters whose conversion windows are earlier than the target resource conversion window. Resource atomic units produced after the conversion window cannot be provided to the requester.
[0044] Furthermore, since each resource atom unit can provide a preset amount of resources within a set time unit, it is also necessary to ensure that the total expected supply provided by each target resource atom unit is compatible with the target resource demand.
[0045] Furthermore, a pre-maintained table can be used to record the specific resource atomic units mapped (or allocated) to each resource acquisition request in the underlying resource pool. For example, a correspondence can be established between the resource acquisition request, the requester matching the resource acquisition request, and the identity information of each resource atomic unit mapped to that requester.
[0046] In an optional implementation of this embodiment, according to the target resource demand and the target resource conversion window period, obtaining at least one target resource atom unit from the resource atom units currently in an unmapped state in the underlying resource pool may include: S1401. In the underlying resource pool, among the resource atomic units that are currently in an unmapped state, obtain the candidate resource atomic units that are located within the target resource conversion window period as defined in the unit description information.
[0047] In this embodiment, when a requester seeking to acquire a target resource allocates or maps one or more resource atomic units from the underlying resource pool, it is first necessary to consider using resource atomic units that are not currently mapped to other resource acquisition requests. Secondly, the expected resource supply time for each of the aforementioned unmapped resource atomic units must fall within the target resource conversion window. By meeting these two conditions, one or more alternative resource atomic units can be obtained from the underlying resource pool.
[0048] Of course, it is understandable that there may be situations where it is impossible to obtain alternative resource atomic units that meet the above two limiting conditions. This means that no resource atomic units can be allocated for the target resource acquisition request. In this case, the processing of the target resource acquisition request can be abandoned, and a resource mapping failure response can be sent back to the requester of the target resource acquisition request so that the requester can regenerate a new resource acquisition request with an adjusted resource conversion window.
[0049] S1402. Check whether the sum of the resource quantities defined in the unit description information of each candidate resource atomic unit is greater than or equal to the target resource requirement: if yes, execute S1403; otherwise, execute S1404.
[0050] It is understandable that when the number of candidate resource atomic units is greater than or equal to 1, two situations may occur: one is that the total amount of resources that can be expected to be provided by all candidate resource atomic units is greater than or equal to the target resource requirement, and the other is that the total amount of resources that can be expected to be provided by all candidate resource atomic units is less than the target resource requirement.
[0051] S1403. Among the candidate resource atomic units, obtain at least one target resource atomic unit whose total resource quantity matches the target resource requirement.
[0052] When the first scenario occurs, it is sufficient to find the target resource atomic unit whose total resource quantity matches the target resource requirement from among all candidate resource atomic units. Optionally, one or more target resource atomic units that meet the target resource requirement can be selected from among all candidate resource atomic units according to the set time unit defined in the unit description information of the candidate resource atomic units, following the time extension order from front to back.
[0053] S1404. Abandon processing the target resource acquisition request and send a resource mapping failure response to the requester of the target resource acquisition request, so that the requester can regenerate a new resource acquisition request that adjusts the resource demand and / or the resource conversion window.
[0054] When the second scenario occurs, it indicates that the current stock of atomic resource units in the underlying resource pool, under the combined effects of time and resource quantity, cannot meet the resource acquisition requirements of the target resource acquisition request. In this case, it is necessary to abandon processing the target resource acquisition request and send a resource mapping failure response to the requester. This allows the requester to resend a new resource acquisition request that can be allocated the expected resources by adjusting only the resource demand, only the resource conversion window, or both the resource demand and the resource conversion window.
[0055] In a specific example, still within the scenario of purchasing real estate financial products, suppose the monthly interest rate offered for real estate financial product A is B. User C wants to purchase real estate financial product A for Z yuan over 30 months. User C expects to receive 30*B*Z in interest after 30 months. Based on this requirement, user C triggers a corresponding target resource acquisition request. At this point, if the unmapped resource atoms in the underlying resource pool cannot meet the required interest rate of 30*B*Z, the system can automatically request user C to shorten the 30-month purchase period or renegotiate a new monthly interest rate lower than B. This guides user C to successfully send a new resource acquisition request that meets their resource needs within the available resource resources of the underlying resource pool.
[0056] Furthermore, after the current system time actually reaches the end of the target resource conversion window, each target resource atomic unit that has been mapped to the requester of the target resource acquisition request in the underlying resource pool needs to be actually allocated to the requester, and these target resource atomic units need to be completely removed from the underlying resource pool.
[0057] The technical solution of this invention, when detecting the injection of a new expected resource block into the underlying resource pool, extracts the supply time span and expected total supply of the expected resource block; based on the supply time span and expected total supply, the expected resource block is divided into multiple resource atomic units; when detecting a target resource acquisition request, the target resource demand and target resource conversion window period matching the target resource acquisition request are obtained; according to the target resource demand and target resource conversion window period, at least one target resource atomic unit is mapped to the requester of the target resource acquisition request from each resource atomic unit currently in an unmapped state in the underlying resource pool. This technical means can divide resource allocation units into the smallest granularity, thereby enabling the allocation of expected resources at a finer time scale. It can effectively improve the response capability of the resource allocation system in high-frequency resource allocation scenarios, while meeting people's growing personalized and refined resource allocation needs, and providing a unified data processing foundation for the dynamic mapping and recombination of resource atomic units in the time dimension.
[0058] Figure 2 The flowchart below shows another resource mapping method provided by an embodiment of the present invention. This embodiment is based on the above embodiments and is optimized. In this embodiment, different virtual channels corresponding to different resource allocation levels are introduced, and the virtual channels are mapped to resource acquisition requests and resource atomic units in the underlying resource pool. By monitoring the resource occupancy of each resource acquisition request in each virtual channel in real time, the resource allocation parameters are dynamically adjusted.
[0059] Correspondingly, such as Figure 2 As shown, the method may include: S210. When a new expected resource block is detected to be injected into the underlying resource pool, extract the supply time span and expected total supply of the expected resource block.
[0060] S220. Based on the supply time span and the expected total supply, the expected resource block is divided into multiple resource atomic units, wherein the unit description information of the resource atomic unit defines the expected supply of resources under the set time unit.
[0061] S230. When a target resource acquisition request is detected, the target resource allocation level that matches the target resource acquisition request is obtained, and the target resource acquisition request is added to the target virtual channel that matches the target resource acquisition request.
[0062] Multiple virtual channels are pre-built, with different virtual channels corresponding to different resource allocation levels.
[0063] In this embodiment, to further expand the application scenarios of the resource allocation system, the concept of virtual channels is introduced. Specifically, this embodiment pre-constructs multiple virtual channels, with different virtual channels corresponding to different resource allocation levels. Furthermore, each resource acquisition request carries a resource allocation level; by parsing the target resource acquisition request, the target resource allocation level corresponding to the request can be obtained. Then, the target resource acquisition request can be added to the matching target virtual channel.
[0064] In other words, different virtual channels are used to store resource acquisition requests of different resource allocation levels.
[0065] S240. Obtain the target resource demand and target resource conversion window period that match the target resource acquisition request.
[0066] In some resource supply scenarios of this embodiment, such as the aforementioned AI computing power supply scenario or new energy power supply scenario, the target resource acquisition request can directly carry the target resource demand and the target resource conversion window period.
[0067] In other resource supply scenarios, such as the purchase of real estate financial products, the aforementioned target resource demand may need to be calculated specifically. Specifically, for a real estate financial product offering three risk levels (also known as resource allocation levels), a user can choose to purchase product X1 at risk level 1, product X2 at risk level 2, or product X3 at risk level 3. Different risk levels have different interest rates (also known as resource exchange rates). Therefore, the target resource demand can be calculated based on the amount of the financial product the user wants to subscribe to, the desired resource conversion window, and the interest rate matching the risk level of the financial product.
[0068] For example, in a specific scenario of cloud shared storage resource supply, a user can exchange computing resources for cloud shared storage resources. The more computing resources a user can provide, the more cloud shared storage resources they can obtain. There is a preset exchange rate between these two types of resources; for example, one standard unit of computing resources can be exchanged for ten standard units of cloud shared storage. Therefore, the target resource demand can be calculated based on the quantity of computing resources provided by the user and the exchange rate between computing resources and cloud shared storage resources.
[0069] Accordingly, in an optional implementation of this embodiment, when a target resource acquisition request is detected, acquiring the target resource demand and target resource conversion window period matching the target resource acquisition request may include: S2401. When a target resource acquisition request is detected, the target exchange base resource and the target resource conversion window period are obtained from the target resource acquisition request.
[0070] As in the previous example, the aforementioned target exchange base resources can be understood as resources used to calculate the target resource demand based on the resource exchange rate. This can be compared to the computing resources in the previous example or the amount of the subscribed financial product. That is, in addition to directly including the target resource demand in the target resource acquisition request, the request can also include the amount of other resources used to exchange for resources in the underlying resource pool, which are the target exchange base resources.
[0071] As mentioned earlier, the target resource conversion window period is used to limit the specific resource exchange waiting time. That is, starting from the start time of the target resource conversion window period, after the window duration of the target resource conversion window period, when the end time of the target resource conversion window period is reached, the corresponding resources in the underlying resource pool are requested.
[0072] S2402. Based on the target exchange base resources and the current target resource exchange rate of the target virtual channel, calculate the target resource demand that matches the target resource acquisition request.
[0073] Different virtual channels correspond to different resource exchange rates. The higher the resource allocation level of a virtual channel, the lower the resource exchange rate corresponding to that virtual channel.
[0074] Specifically, the product between the target exchange base resource and the target resource exchange rate can be calculated, and this product can be used as the target resource demand quantity that matches the target resource acquisition request.
[0075] In this embodiment, when the amount of resources in the underlying resource pool is limited or insufficient, these resources will be preferentially mapped to resource acquisition requests with higher resource allocation levels. Correspondingly, resource acquisition requests with higher resource allocation levels will be matched with lower resource exchange rates as a balance.
[0076] In other words, for different resource acquisition requests carrying the same basic exchange resources, the higher the resource allocation level in a resource acquisition request, the lower the resource exchange rate allocated to it, and thus the less total resources are allocated or mapped to that resource acquisition request.
[0077] Continuing the previous example, if a user purchases a real estate investment product with a higher risk level, that product will carry higher risk along with a higher interest rate. In other words, if the rental income from the real estate is insufficient to cover all the interest payments for the purchaser, the lower-risk, lower-interest real estate investment product will be prioritized for redemption.
[0078] For example, when users choose to exchange computing resources for shared cloud storage resources, they can select different exchange rates. A higher exchange rate means that the same amount of computing resources can be exchanged for more shared cloud storage resources. When there is a shortage of shared cloud storage resources, the limited resources may be allocated to users with lower exchange rates to meet the needs of more users.
[0079] S250. Based on the target resource demand and the target resource conversion window, among the resource atomic units currently in an unmapped state in the underlying resource pool, obtain at least one target resource atomic unit and map it to the requester of the target resource acquisition request.
[0080] Understandably, if it is not possible to successfully obtain the target resource atomic unit that meets the requirements of the target resource acquisition request from the underlying resource pool, then while abandoning the resource mapping of the target resource acquisition request, it is also necessary to remove the target resource acquisition request from the matching target virtual channel.
[0081] S260. Establish the mapping relationship between each target resource atomic unit and the target virtual channel; and define the mapped state of the current target resource atomic unit in the unit description information of the current target resource atomic unit.
[0082] In this embodiment, in addition to establishing a mapping relationship between resource atomic units and requesters of resource acquisition requests, a mapping relationship between resource atomic units and matching virtual channels is further established.
[0083] Accordingly, in an optional implementation of this embodiment, establishing the mapping relationship between each target resource atomic unit and the target virtual channel may include: S2601. Obtain the unit identifier of the current target resource atomic unit and the channel identifier of the target virtual channel.
[0084] S2602. Based on the target resource conversion window period, obtain the mapping effective time and mapping invalidation time.
[0085] The effective time of the mapping can be the starting point of the target resource conversion window, and the expiration time of the mapping can be the ending point of the target resource conversion window.
[0086] S2603. Based on the obtained unit identifier, channel identifier, mapping effective time, and mapping invalidation time, construct a target mapping entry that matches the current target resource atomic unit.
[0087] S2604. Append the target mapping table entry to the currently maintained virtual channel mapping table to establish the mapping relationship between the current target mapping table entry and the target virtual channel.
[0088] The above settings achieve the effect of assigning logical pointers of different resource atoms to different virtual channels simply by modifying the virtual channel mapping table, without moving the actual resource atoms in the underlying resource pool. The implementation is simple and requires almost no modification to the underlying logical architecture.
[0089] S270. Monitor in real time the total amount of basic resources exchanged in each resource acquisition request of each virtual channel, and the percentage of the planned completion of the resource exchange plan for each virtual channel.
[0090] In this embodiment, to scientifically and dynamically adjust the number of resource acquisition requests directed to each virtual channel, or in other words, the number of resources requested, a concept of a resource exchange plan corresponding to each virtual channel is further introduced. The resource exchange plan can be understood as the upper limit of all basic resources that a virtual channel can accept for exchange. When the total amount of basic resources exchanged in all resource acquisition requests within a virtual channel reaches this upper limit, that virtual channel will no longer accept new resource acquisition requests.
[0091] Furthermore, in order to dynamically update the interest levels of different requesters for different resource allocation levels based on the total amount of basic resources introduced into each virtual channel, a method for dynamically updating the resource exchange rate of virtual channels is proposed. Specifically, the total amount of basic resources to be exchanged in each resource acquisition request of each virtual channel is monitored, as well as the percentage of the planned completion of the resource exchange plan for each virtual channel.
[0092] In a specific example, if there are currently resource acquisition request 1 and resource acquisition request 2 in a virtual channel A, the basic resource for exchange corresponding to resource acquisition request 1 is M1, the basic resource for exchange corresponding to resource acquisition request 2 is M2, and the planned amount of resource exchange corresponding to virtual channel A is N, then the percentage of the plan completion corresponding to virtual channel A is (M1+M2) / N.
[0093] S280. If the planned completion rate of any virtual channel is found to exceed the preset percentage threshold, the monitored virtual channel is identified as the target adjustment virtual channel, and the current resource exchange rate of the target adjustment virtual channel is updated according to the preset non-linear resource exchange rate adjustment strategy.
[0094] Optionally, the aforementioned preset percentage threshold can be selected as 0.8 based on the Pareto principle.
[0095] In an optional implementation of this embodiment, updating the current resource exchange rate of the target adjustment virtual channel according to a preset nonlinear resource exchange rate adjustment strategy may include: According to the formula: The current resource exchange rate of the virtual channel for the target is calculated. The new resource exchange rate obtained after the update ; in, U is a preset sensitivity coefficient associated with the resource mapping scenario, U is the percentage of the target virtual channel that is planned to be completed, and A is a preset percentage threshold.
[0096] In this embodiment, considering the continuous differentiability of the exponential function across the entire domain, which is beneficial for high-frequency numerical simulations and precise predictions in computer systems, the inventors introduced the exponential function as the main update function in the nonlinear resource exchange rate adjustment strategy. Specifically, the resource exchange rate changes with the percentage of virtual channel plan completion as follows: Figure 3 As shown.
[0097] Furthermore, the Related to resource mapping scenarios, let's take the purchase of real estate financial products as an example. For stable-return real estate such as office buildings, we can... A slightly lower adjustment could be made for real estate with volatile returns, such as retail properties. The adjustment should be slightly higher to improve the universality of the aforementioned nonlinear resource exchange rate adjustment strategy.
[0098] The technical solution of this invention introduces different virtual channels to store resource acquisition requests with different resource allocation levels and different resource exchange rates. It can dynamically adjust the resource exchange rate of each virtual channel based on the occupancy of the resource exchange plan of the virtual channel according to the basic resources exchanged by each resource acquisition request. After the resource allocation system completes the fixed storage of allocation parameters, it can automatically update the allocation parameters according to the actual situation without introducing manual intervention, thereby improving the real-time response capability of the resource allocation system and significantly reducing response latency.
[0099] Figure 4 This is a flowchart of another resource mapping method provided by an embodiment of the present invention. This embodiment is based on and optimized from the above embodiments. In this embodiment, the process of dynamically reorganizing and remapping each resource atomic unit that has already completed virtual channel mapping is specifically defined. Correspondingly, as... Figure 4 The method may specifically include: S410. When a new expected resource block is detected to be injected into the underlying resource pool, extract the supply time span and expected total supply of the expected resource block.
[0100] S420. Based on the supply time span and the expected total supply, the expected resource block is divided into multiple resource atomic units, wherein the unit description information of the resource atomic unit defines the expected supply of resources under the set time unit.
[0101] S430. When a target resource acquisition request is detected, obtain the target resource demand and target resource conversion window period that match the target resource acquisition request.
[0102] S440. Based on the target resource demand and the target resource conversion window, among the resource atomic units currently in an unmapped state in the underlying resource pool, obtain at least one target resource atomic unit and map it to the requester of the target resource acquisition request.
[0103] S450. When a local failure information matching the expected resource block is detected, obtain the failure time window matching the local failure information, and the supply of failed resources within the failure time window.
[0104] Since the expected resource block defines the total expected supply over a given time span, allocating or mapping the expected resource block is equivalent to pre-allocating resources expected to be generated within a future time period. Consequently, it is highly likely that resources expected to be supplied within a certain time window of the expected resource block may become unavailable.
[0105] For example, if the expected resource block represents the total AI computing power that an AI computing power supply system can release within the next 24 hours (supply time span), as time progresses, there might be a situation where equipment maintenance is required on the AI computing power cluster during the 12th hour of the aforementioned supply time span, preventing the provision of AI computing power to the outside world during that hour. Similarly, if the expected resource block represents the total power supply that a pre-set energy storage station can provide within the next 48 hours, as time progresses, there might be a situation where power equipment fails during the 10th-12th hours of the aforementioned supply time span, preventing the provision of power to the outside world. Furthermore, in a scenario where the expected resource block represents the purchase scenario of a real estate financial product, setting the expected rental income of an office building in 2027, there might be a situation where, due to force majeure, the office building fails to collect rent in February 2027.
[0106] When any of the above situations occur, a local failure information matching the expected resource block will be generated accordingly. Based on this local failure information, it can be determined in which time period (i.e., failure time window) how much of the expected resource block (failed resource supply) cannot actually be generated and provided to the requester of the resource acquisition request.
[0107] S460. In the underlying resource pool, identify each failed resource atomic unit that matches the failed resource supply under the failure time window.
[0108] In the process of splitting the expected resource block into multiple resource atomic units, each resource atomic unit corresponds to a set time unit. Therefore, each resource atomic unit whose set time unit defined in the unit description information is located under the failure time window can be identified as a failed resource atomic unit.
[0109] As mentioned above, since the solutions in the various embodiments of the present invention implement the advance allocation of resources, there may be situations where failed resource atomic units located in the failure time window of the expected resource block have already been mapped to one or more resource acquisition requests. In this case, since these failed resource atomic units have not actually been generated, the mapping relationship established for these failed resource atomic units needs to be cleared, and these failed resource atomic units need to be removed from the underlying resource pool.
[0110] S470. After releasing the mapping relationship between each failed resource atom unit in the mapping state and the matching virtual channel, remove all failed resource atom units from the underlying resource pool.
[0111] In an optional implementation of this embodiment, releasing the mapping relationship between each failed resource atom unit in the mapping state and the matching virtual channel may include: The virtual channel mapping table is searched based on the unit identifier of each failed resource atomic unit, and the found mapping table entries are deleted from the virtual channel mapping table to release the mapping relationship between each failed resource atomic unit and the matching virtual channel.
[0112] Of course, it is understandable that, in addition to removing the mapping relationship between the failed resource atomic unit and the virtual channel, it is also necessary to further remove the mapping relationship between the failed resource atomic unit and the requester that sent the resource acquisition request, so as to remove the resource allocation relationship between the two.
[0113] S480. Obtain the missing resource amount of each virtual channel after the mapping relationship is removed, and use the resource atomic units in the underlying resource pool that are currently in an unmapped state to complete the missing resource amount of each virtual channel in order of resource allocation level from high to low.
[0114] Understandably, each failed resource atom unit in the underlying resource pool also has two states: a mapped state and an unmapped state. A failed resource atom unit in the mapped state will cause a loss of resource quantity within the virtual channel after the mapping relationship with the virtual channel is broken, that is, a missing resource quantity will be generated.
[0115] In a specific example, suppose the resource quantity defined in the unit description information of resource atomic unit 1 is m. This resource atomic unit 1 has a pre-established mapping relationship with virtual channel 1 to allocate resource atomic unit 1 to a resource acquisition request in virtual channel 1. When resource atomic unit 1 becomes a failed resource atomic unit, it is necessary to unmap resource atomic unit 1 from virtual channel 1. At this time, a missing resource quantity m appears in virtual channel 1.
[0116] At this point, to avoid resource shortages in each virtual channel, the simplest approach is to use the currently unmapped resource atoms in the underlying resource pool to fill in the missing resources for each virtual channel. As mentioned earlier, because different virtual channels have different resource allocation levels, when resources are insufficient, priority should be given to virtual channels with higher resource allocation levels. Therefore, the missing resource completion operation must be performed in descending order of resource allocation level. The specific method for completing missing resources is similar to the resource mapping method described above, and will not be elaborated upon here.
[0117] Based on the above embodiments, after using the resource atoms currently in an unmapped state in the underlying resource pool to complete the missing resource amounts for each virtual channel, the method may further include: The resource atomic units that are currently in an unmapped state and are being completed will be mapped to the requester of the resource acquisition request that matches the completed virtual channel.
[0118] It is understandable that if a resource atom unit 2 that is in an unmapped state in the underlying resource pool is mapped to the set virtual channel 2, it is equivalent to re-establishing the mapping relationship between the resource atom unit and a resource acquisition request in the virtual channel 2 that has been pre-mapped with a failed resource atom unit, so as to complete the missing resource amount for the requester of the resource acquisition request.
[0119] Based on the above embodiments, multiple virtual channels may include a first virtual channel, a second virtual channel, and a third virtual channel. The resource allocation level of the first virtual channel (also known as a priority channel) is higher than that of the second virtual channel (also known as a neutral channel), and the resource allocation level of the second virtual channel is higher than that of the third virtual channel (also known as an aggressive channel).
[0120] Accordingly, after using the currently unmapped resource atomic units in the underlying resource pool to complete the missing resource amounts for each virtual channel in descending order of resource allocation level, the process may also include: If all unmapped resource atomic units in the underlying resource pool are mapped to the first virtual channel, and the first virtual channel still has a target missing resource quantity, then the target missing resource quantity in the first virtual channel is filled by using each resource atomic unit that has established a mapping relationship with the second or third virtual channel in the order of resource allocation level from low to high.
[0121] In this embodiment, considering that the resource exchange rate in the first virtual channel is the lowest, the resource acquisition needs in the first virtual channel need to be prioritized. Therefore, if all unmapped resource atoms in the underlying resource pool are mapped to the first virtual channel, there will still be a resource shortage in the first virtual channel. It is necessary to continue to obtain mapped resource atoms from the second or third virtual channel, unmap them from the second or third virtual channel, and remap them to the first virtual channel.
[0122] Optionally, following the resource allocation level from low to high, the resource atomic units that have established a mapping relationship with the second or third virtual channel are used to complete the target missing resource amount in the first virtual channel. This may include: S4801. Obtain the third virtual channel as the current completion channel.
[0123] Understandably, since the resource allocation level of the third virtual channel is the lowest or the resource exchange rate is the highest, it is necessary to prioritize the use of the resource atomic units mapped in the third virtual channel to complete the target missing resource amount of the first virtual channel.
[0124] S4802. Among the resource atomic units that have a mapping relationship with the current completion channel, obtain the currently mapped resource atomic unit.
[0125] In this embodiment, one resource atom unit can be randomly selected from each resource atom unit that has a mapping relationship with the current completion channel, and used as the current mapped resource atom unit. Alternatively, the resource atom unit with the latest end time in the set time unit defined in the unit description information can be selected from each resource atom unit that has a mapping relationship with the current completion channel, and used as the current mapped resource atom unit. This embodiment does not impose any restrictions on this.
[0126] S4803. After removing the mapping relationship between the current mapped resource atomic unit and the current completion channel, re-establish the mapping relationship between the current mapped resource atomic unit and the first virtual channel.
[0127] In this embodiment, after obtaining the current mapping table entry of the current mapping resource atomic unit in the virtual channel mapping table, the channel identifier in the current mapping table entry can be modified from the channel identifier of the current completed channel to the channel identifier of the first virtual channel to realize the remapping of the virtual channel.
[0128] In other words, through the above method, the technical effect of dynamically reorganizing and remapping each resource atomic unit between virtual channels according to the resource allocation level of the virtual channel is achieved when a resource failure event occurs.
[0129] S4804. Check whether the target missing resource quantity of the first virtual channel can be completed after the resource quantity of the current mapped resource atomic unit is added to the first virtual channel: if yes, then execute S4805; otherwise, execute S4806.
[0130] S4805, End the completion process.
[0131] S4806. Check if the partial end unbinding condition matching the current completion channel is met: if yes, execute S4807; otherwise, return to execute S4802.
[0132] Understandably, the resource atomic units mapped in the third virtual channel cannot be used indefinitely to complete the resources of the first virtual channel. When the amount of resources currently mapped in the third virtual channel is less than or equal to a preset threshold, such as 10% or 20% of the total resources, it is determined that the local termination unbinding condition matching the current completion channel is met.
[0133] S4807. After setting the second virtual channel as the new current completion channel, return to S4802 until the conditions for complete unbinding are met.
[0134] The complete unbinding condition can be to complete the missing resource amount of the first virtual channel, or the resource amount currently mapped in the second virtual channel is less than or equal to a preset threshold, etc.
[0135] Furthermore, after using the resource atomic units that have established mapping relationships with the second or third virtual channel to complete the target missing resource amount of the first virtual channel, it may also include: Each resource atom unit used in the second or third virtual channel to complete the first virtual channel is remapped to the requester of the resource acquisition request that matches in the first virtual channel.
[0136] The technical solution of this invention, through an effective feedback adjustment mechanism, can achieve dynamic reorganization and remapping of resource atomic units in different virtual channels without recalculating the entire data. While significantly reducing computational complexity and response latency, it ensures the fairness of resource allocation and effectively avoids the risk of resource allocation system overload. In addition, by updating the virtual channel mapping table, the remapping of resource atomic units between different virtual channels can be easily achieved, improving the stability of the resource allocation system under various resource partial failure scenarios and ensuring that the resource allocation system does not exceed the boundary of the total amount of underlying resources under any operating state.
[0137] Figure 5This is a flowchart of another resource mapping method provided by an embodiment of the present invention. This embodiment is based on and optimized from the above embodiments. In this embodiment, the specific resource allocation process is further defined. Accordingly, as... Figure 5 As shown, this method can specifically include: S510. When a new expected resource block is detected to be injected into the underlying resource pool, extract the supply time span and expected total supply of the expected resource block.
[0138] S520. Based on the supply time span and the expected total supply, the expected resource block is divided into multiple resource atomic units, wherein the unit description information of the resource atomic unit defines the expected supply of resources under the set time unit.
[0139] S530. When a target resource acquisition request is detected, obtain the target resource demand and target resource conversion window period that match the target resource acquisition request.
[0140] S540. Based on the target resource demand and the target resource conversion window, among the resource atomic units currently in an unmapped state in the underlying resource pool, obtain at least one target resource atomic unit and map it to the requester of the target resource acquisition request.
[0141] S550 dynamically updates the expected resource quantity for each requester within the matching resource conversion window in the virtual ledger based on the requesters bound to each resource atomic unit in the underlying resource pool.
[0142] Specifically, one requester corresponds to one resource acquisition request, and one resource acquisition request corresponds to one resource conversion window. The resource acquisition request is pre-mapped with one or more resource atomic units. Based on the above mapping relationship, the expected amount of resources of each resource acquisition requester in the matched resource conversion window period can be obtained in real time.
[0143] In this embodiment, to ensure the security and traceability of the resource mapping results, the expected amount of resources for each requester during the matched resource conversion window is recorded in a distributed manner using a virtual ledger.
[0144] S560. When the current system time is detected to have reached the end time of the resource conversion window of the target requester, the smart contract executor is triggered to allocate the expected amount of resources recorded in the virtual ledger that matches the target requester to the target requester.
[0145] S570. Locate each allocated resource atom unit in the underlying resource pool that has a mapping relationship with the target requester, release the mapping relationship between each allocated resource atom unit and the matching virtual channel, and remove each allocated resource atom unit from the underlying resource pool.
[0146] Figure 6 This is a schematic diagram of a resource mapping device provided in an embodiment of the present invention. Figure 6 As shown, the device includes: a first key information extraction module 610, an atomic unit splitting module 620, a second key information acquisition module 630, and an atomic unit mapping module 640, wherein: The first key information extraction module 610 is used to extract the supply time span and expected supply total of the expected resource block when a new expected resource block is detected to be injected into the underlying resource pool. The atomic unit splitting module 620 is used to split the expected resource block into multiple resource atomic units according to the supply time span and the expected total supply. The unit description information of the resource atomic unit defines the expected supply of resources under the set time unit. The second key information acquisition module 630 is used to acquire the target resource demand and target resource conversion window period that match the target resource acquisition request when a target resource acquisition request is detected. The atomic unit mapping module 640 is used to obtain at least one target resource atomic unit from the resource atomic units that are currently in an unmapped state in the underlying resource pool and map it to the requester of the target resource acquisition request, according to the target resource demand and the target resource conversion window period.
[0147] The technical solution of this invention, when detecting the injection of a new expected resource block into the underlying resource pool, extracts the supply time span and expected total supply of the expected resource block; based on the supply time span and expected total supply, the expected resource block is divided into multiple resource atomic units; when detecting a target resource acquisition request, the target resource demand and target resource conversion window period matching the target resource acquisition request are obtained; according to the target resource demand and target resource conversion window period, at least one target resource atomic unit is mapped to the requester of the target resource acquisition request from each resource atomic unit currently in an unmapped state in the underlying resource pool. This technical means can divide resource allocation units into the smallest granularity, thereby enabling the allocation of expected resources at a finer time scale. It can effectively improve the response capability of the resource allocation system in high-frequency resource allocation scenarios, while meeting people's growing personalized and refined resource allocation needs, and providing a unified data processing foundation for the dynamic mapping and recombination of resource atomic units in the time dimension.
[0148] Based on the above embodiments, the atomic unit splitting module 620 can be specifically used for: Obtain the minimum resource supply time span and the minimum resource allocation amount; Based on the minimum resource supply time span, the expected resource block is divided into multiple initial resource partitioning units, each with a set initial resource quantity. Based on the minimum resource allocation, each initial resource partitioning unit is further divided on the initial resource amount to obtain the multiple resource atomic units; The set time unit defined in the unit description information is an integer multiple of the minimum resource supply time span, and the resource quantity defined in the unit description information is an integer multiple of the minimum resource allocation quantity.
[0149] Based on the above embodiments, a virtual channel joining module may also be included, used for: Before obtaining the target resource demand and target resource conversion window period that match the target resource acquisition request, obtain the target resource allocation level that matches the target resource acquisition request, and add the target resource acquisition request to the target virtual channel that matches the target resource acquisition request. Among them, multiple virtual channels are pre-built, and different virtual channels correspond to different resource allocation levels; Correspondingly, it may also include a virtual channel mapping module, used for: Based on the target resource demand and conversion window, after obtaining at least one target resource atom from the currently unmapped resource atoms in the underlying resource pool and mapping it to the requester of the target resource acquisition request, a mapping relationship is established between each target resource atom and the target virtual channel; and The mapping status of the current target resource atomic unit is defined in the unit description information of the current target resource atomic unit.
[0150] Based on the above embodiments, the atomic unit mapping module 640 can be specifically used for: In the underlying resource pool, among the resource atomic units that are currently in an unmapped state, obtain the candidate resource atomic units whose set time units are located within the target resource conversion window period as defined in the unit description information; Check whether the sum of the resource quantities defined in the unit description information of each candidate resource atom unit is greater than or equal to the target resource requirement. If so, then among the candidate resource atomic units, at least one target resource atomic unit whose total resource quantity matches the target resource requirement quantity is obtained.
[0151] Based on the above embodiments, the virtual channel mapping module can be specifically used for: Obtain the unit identifier of the current target resource atomic unit and the channel identifier of the target virtual channel; Based on the target resource conversion window, obtain the mapping effective time and mapping expiration time; Based on the obtained unit identifier, channel identifier, mapping effective time, and mapping expiration time, construct a target mapping table entry that matches the current target resource atomic unit; Append the target mapping entry to the currently maintained virtual channel mapping table to establish the mapping relationship between the current target mapping entry and the target virtual channel.
[0152] Based on the above embodiments, a mapping failure feedback module may also be included, used for: After checking whether the sum of the resource quantities defined in each candidate resource atomic unit is greater than or equal to the target resource requirement, if not, the processing of the target resource acquisition request is abandoned, and a resource mapping failure response is sent back to the requester of the target resource acquisition request, so that the requester can regenerate a new resource acquisition request with adjusted resource requirements and / or resource conversion window period.
[0153] Based on the above embodiments, the second key information acquisition module 630 can be specifically used for: When a target resource acquisition request is detected, the target exchange base resource and the target resource conversion window period are obtained from the target resource acquisition request; Based on the target exchange base resources and the current target resource exchange rate of the target virtual channel, calculate the target resource demand that matches the target resource acquisition request. Different virtual channels correspond to different resource exchange rates. The higher the resource allocation level of a virtual channel, the lower the resource exchange rate corresponding to that virtual channel.
[0154] Based on the above embodiments, a resource exchange rate update module may also be included, used for: Real-time monitoring of the total amount of basic resources exchanged in each resource acquisition request of each virtual channel, and the percentage of planned completion of the resource exchange plan for each virtual channel; If the planned completion rate of any virtual channel exceeds the preset percentage threshold, the monitored virtual channel will be identified as the target adjustment virtual channel, and the current resource exchange rate of the target adjustment virtual channel will be updated according to the preset non-linear resource exchange rate adjustment strategy.
[0155] Based on the above embodiments, the resource exchange rate update module can be further used for: According to the formula: The current resource exchange rate of the virtual channel for the target is calculated. The new resource exchange rate obtained after the update ; in, U is a preset sensitivity coefficient associated with the resource mapping scenario, U is the percentage of the target virtual channel that is planned to be completed, and A is a preset percentage threshold.
[0156] Based on the above embodiments, the device further includes a dynamic reassembly module, used for: When a local failure information matching the expected resource block is detected, the failure time window matching the local failure information and the supply of failed resources within the failure time window are obtained. In the underlying resource pool, identify each failed resource atom unit that matches the supply of failed resources under the failure time window; After unmapping the mapping relationship between each failed resource atom unit in the mapping state and the matching virtual channel, remove all failed resource atom units from the underlying resource pool; After the mapping relationship is removed, obtain the missing resource amount of each virtual channel, and use the resource atomic units in the underlying resource pool that are currently in an unmapped state to complete the missing resource amount of each virtual channel in order of resource allocation level from high to low.
[0157] Based on the above embodiments, the dynamic recombination module can be specifically used for: The virtual channel mapping table is searched based on the unit identifier of each failed resource atomic unit, and the found mapping table entries are deleted from the virtual channel mapping table to release the mapping relationship between each failed resource atomic unit and the matching virtual channel.
[0158] Based on the above embodiments, the multiple virtual channels include a first virtual channel, a second virtual channel, and a third virtual channel, wherein the resource allocation level of the first virtual channel is greater than that of the second virtual channel, and the resource allocation level of the second virtual channel is greater than that of the third virtual channel. Correspondingly, the dynamic reorganization module can also be used for: If all unmapped resource atomic units in the underlying resource pool are mapped to the first virtual channel, and the first virtual channel still has a target missing resource quantity, then the target missing resource quantity in the first virtual channel is filled by using each resource atomic unit that has established a mapping relationship with the second or third virtual channel in the order of resource allocation level from low to high.
[0159] Based on the above embodiments, the dynamic recombination module can also be further used for: Obtain the third virtual channel as the current completion channel, and among the resource atomic units that have a mapping relationship with the current completion channel, obtain the currently mapped resource atomic unit; After removing the mapping relationship between the current mapped resource atomic unit and the current completion channel, the mapping relationship between the current mapped resource atomic unit and the first virtual channel is re-established; The system checks whether the target missing resource quantity of the first virtual channel can be completed after the resource quantity of the currently mapped resource atomic unit is added into the first virtual channel. If yes, the completion process ends; otherwise, return to the execution of the operation of obtaining the currently mapped resource atomic unit in each resource atomic unit that has a mapping relationship with the current completion channel. When the partial termination and unbinding conditions matching the current completion channel are met, the second virtual channel is used as the new current completion channel. Then, execution returns to each resource atomic unit that has a mapping relationship with the current completion channel to obtain the current mapped resource atomic unit until the complete termination and unbinding conditions are met.
[0160] Based on the above embodiments, a first mapping processing module may also be included, used for: After using the unmapped resource atomic units in the underlying resource pool to complete the missing resource amount of each virtual channel, the unmapped resource atomic units that performed the completion operation are mapped to the requester of the resource acquisition request that matches the completed virtual channel. Correspondingly, it may also include a second mapping processing module, used for: After using the resource atomic units that have established a mapping relationship with the second or third virtual channel to complete the target missing resource amount of the first virtual channel, the resource atomic units in the second or third virtual channel used to complete the first virtual channel are remapped to the requester of the resource acquisition request that matches in the first virtual channel.
[0161] Based on the above embodiments, a resource allocation module may also be included, used for: Based on the requesters bound to each resource atomic unit in the underlying resource pool, the expected resource quantity for each requester during the matching resource conversion window is dynamically updated in the virtual ledger in real time. When the current system time is detected to have reached the end time of the target requester's resource conversion window, the smart contract executor is triggered to allocate the expected amount of resources recorded in the virtual ledger that matches the target requester to the target requester. Locate each allocated resource atom unit in the underlying resource pool that has a mapping relationship with the target requester, remove the mapping relationship between each allocated resource atom unit and the matching virtual channel, and remove each allocated resource atom unit from the underlying resource pool.
[0162] The resource mapping apparatus provided in this embodiment of the invention can execute the resource mapping method provided in any embodiment of the invention, and has the corresponding functional modules and beneficial effects of the method execution.
[0163] The technical solution disclosed herein involves the collection, storage, use, processing, transmission, provision, and disclosure of user personal information, all of which comply with relevant laws and regulations and do not violate public order and good morals. A corresponding access point is provided for users to choose to authorize or refuse. Furthermore, a corresponding access point is provided for users to choose to agree to or refuse the automated decision-making result; if the user chooses to refuse, the process proceeds to the expert decision-making stage.
[0164] Figure 7 This is a schematic diagram of a resource mapping system provided in an embodiment of the present invention. Figure 7 As shown, the resource mapping system may specifically include: a sensor 710, an underlying resource pool 720, a dynamic actuarial engine 730, a virtual ledger 740, and a smart contract executor 750; wherein, the sensor 710 is connected to the underlying resource pool 720, the underlying resource pool 720 is connected to the dynamic actuarial engine 730, the dynamic actuarial engine 730 is connected to the virtual ledger 740, and the virtual ledger 740 is connected to the smart contract executor 750.
[0165] Sensor 710 is used to inject new expected resource blocks into the underlying resource pool 720 or send local failure information matching the expected resource blocks when a resource change is detected.
[0166] The underlying resource pool 720 is used to store expected resource blocks.
[0167] Among them, the underlying resource pool 720 serves as the data source of the entire resource mapping system. It can connect to the resource supply system (not shown in the figure) or sensor 710 in the physical world through various encrypted transmission protocols to obtain the expected resource blocks injected by the resource supply system or sensor 710 after data desensitization processing.
[0168] Optionally, the aforementioned expected resource blocks can be stored in the underlying resource pool 720 as a triple consisting of resource identifier, supply time span, and expected total supply, and can be pushed to the dynamic actuarial engine 730 in real time.
[0169] The dynamic actuarial engine 730 is used to execute the resource mapping method as described in any one of the embodiments of the present invention.
[0170] The dynamic actuarial engine 730 serves as the logical hub of the entire resource mapping system, typically operating on servers or server clusters with high-performance computing capabilities. Furthermore, the dynamic actuarial engine 730 can internally include three functional modules: an atomicity module, a priority controller, and a resource exchange rate balancer.
[0171] Specifically, the atomization module is used to split the expected resource block into multiple resource atomic units. The priority controller is used to dynamically reorganize and remap each resource atomic unit in virtual channels of different resource allocation levels when a local resource failure event of the expected resource block occurs. The resource exchange rate balancer is used to dynamically update the resource exchange rate of each virtual channel based on the total amount of basic resources exchanged in each resource acquisition request of each virtual channel as monitored in real time, and the percentage of the planned completion of the resource exchange plan of each virtual channel.
[0172] Virtual ledger 740 is used to update records in real time with the expected amount of resources for each requester during the matched resource conversion window.
[0173] The virtual ledger 740 can be implemented using distributed ledger technology. The virtual ledger 740 can receive engine control instructions sent by the dynamic actuarial engine 730 through a one-way control interface, and record the resource allocation relationship between each resource atomic unit obtained after splitting and the requester of the matching resource acquisition request.
[0174] The smart contract executor 750 is used to allocate the expected amount of resources matching the target requester, which is recorded in the virtual ledger 740, to the target requester after the end time of the target requester's resource conversion window is triggered at the current system time.
[0175] In this embodiment, the smart contract executor 750 serves as the execution layer, with one end connected to the virtual ledger 740 and the other end connected to a specific resource hosting pool (not shown in the figure). When the end time of the resource conversion window period arrives, it automatically retrieves the actual resources from the resource hosting pool based on the content recorded in the virtual ledger 740 to complete the actual resource allocation process.
[0176] In this embodiment, the various devices in the resource mapping system described above can be deployed on the same server or in a distributed cluster. This embodiment does not impose any restrictions on this.
[0177] Figure 8A schematic diagram of an electronic device 10, which can be used to implement embodiments of the present invention, is shown. The electronic device is intended to represent various forms of digital computers, such as laptop computers, desktop computers, workstations, personal digital assistants, servers, blade servers, mainframe computers, and other suitable computers. The electronic device can also represent various forms of mobile devices, such as personal digital processors, cellular phones, smartphones, wearable devices (e.g., helmets, glasses, watches, etc.), and other similar computing devices. The components shown herein, their connections and relationships, and their functions are merely illustrative and are not intended to limit the implementation of the invention described and / or claimed herein.
[0178] like Figure 8 As shown, the electronic device 10 includes at least one processor 11 and a memory, such as a read-only memory (ROM) 12 or a random access memory (RAM) 13, communicatively connected to the at least one processor 11. The memory stores computer programs executable by the at least one processor. The processor 11 can perform various appropriate actions and processes based on the computer program stored in the ROM 12 or loaded from storage unit 18 into the RAM 13. The RAM 13 can also store various programs and data required for the operation of the electronic device 10. The processor 11, ROM 12, and RAM 13 are interconnected via a bus 14. An input / output (I / O) interface 15 is also connected to the bus 14.
[0179] Multiple components in electronic device 10 are connected to I / O interface 15, including: input unit 16, such as keyboard, mouse, etc.; output unit 17, such as various types of displays, speakers, etc.; storage unit 18, such as disk, optical disk, etc.; and communication unit 19, such as network card, modem, wireless transceiver, etc. Communication unit 19 allows electronic device 10 to exchange information / data with other devices through computer networks such as the Internet and / or various telecommunications networks.
[0180] Processor 11 can be various general-purpose and / or special-purpose processing components with processing and computing capabilities. Some examples of processor 11 include, but are not limited to, central processing unit (CPU), graphics processing unit (GPU), various special-purpose artificial intelligence (AI) computing chips, various processors running machine learning model algorithms, digital signal processors (DSPs), and any suitable processor, controller, microcontroller, etc. Processor 11 performs the various methods and processes described above, such as performing the resource mapping method as described in any of the embodiments of the present invention. That is: When a new expected resource block is detected to be injected into the underlying resource pool, the supply time span and expected total supply of the expected resource block are extracted. Based on the supply time span and the expected total supply, the expected resource block is divided into multiple resource atomic units, where the unit description information of the resource atomic unit defines the expected supply of resources under the set time unit. When a target resource acquisition request is detected, the target resource demand and target resource conversion window period that match the target resource acquisition request are obtained; Based on the target resource demand and the target resource conversion window, at least one target resource atom unit is obtained from the unmapped resource atom units in the underlying resource pool and mapped to the requester of the target resource acquisition request.
[0181] In some embodiments, the resource mapping method as described in any of the embodiments of the present invention may be implemented as a computer program tangibly contained in a computer-readable storage medium, such as storage unit 18. In some embodiments, part or all of the computer program may be loaded and / or installed on electronic device 10 via ROM 12 and / or communication unit 19. When the computer program is loaded into RAM 13 and executed by processor 11, one or more steps of the resource mapping method as described above as described in any of the embodiments of the present invention may be performed. Alternatively, in other embodiments, processor 11 may be configured to perform the resource mapping method as described in any of the embodiments of the present invention by any other suitable means (e.g., by means of firmware).
[0182] Various embodiments of the systems and techniques described above herein can be implemented in digital electronic circuit systems, integrated circuit systems, field-programmable gate arrays (FPGAs), application-specific integrated circuits (ASICs), application-specific standard products (ASSPs), systems-on-a-chip (SoCs), payload-programmable logic devices (CPLDs), computer hardware, firmware, software, and / or combinations thereof. These various embodiments may include implementations in one or more computer programs that can be executed and / or interpreted on a programmable system including at least one programmable processor, which may be a dedicated or general-purpose programmable processor, capable of receiving data and instructions from a storage system, at least one input device, and at least one output device, and transmitting data and instructions to the storage system, the at least one input device, and the at least one output device.
[0183] Computer programs used to implement the methods of the present invention may be written in any combination of one or more programming languages. These computer programs may be provided to a processor of a general-purpose computer, a special-purpose computer, or other programmable data processing device, such that when executed by the processor, the computer programs cause the functions / operations specified in the flowcharts and / or block diagrams to be performed. The computer programs may be executed entirely on a machine, partially on a machine, or as a standalone software package, partially on a machine and partially on a remote machine, or entirely on a remote machine or server.
[0184] In the context of this invention, a computer-readable storage medium can be a tangible medium that may contain or store a computer program for use by or in conjunction with an instruction execution system, apparatus, or device. A computer-readable storage medium may include, but is not limited to, electronic, magnetic, optical, electromagnetic, infrared, or semiconductor systems, apparatus, or devices, or any suitable combination thereof. Alternatively, a computer-readable storage medium may be a machine-readable signal medium. More specific examples of machine-readable storage media include electrical connections based on one or more wires, portable computer disks, hard disks, random access memory (RAM), read-only memory (ROM), erasable programmable read-only memory (EPROM or flash memory), optical fibers, portable compact disk read-only memory (CD-ROM), optical storage devices, magnetic storage devices, or any suitable combination thereof.
[0185] To provide interaction with a user, the systems and techniques described herein can be implemented on an electronic device having: a display device (e.g., a CRT (cathode ray tube) or LCD (liquid crystal display) monitor) for displaying information to the user; and a keyboard and pointing device (e.g., a mouse or trackball) through which the user provides input to the electronic device. Other types of devices can also be used to provide interaction with the user; for example, feedback provided to the user can be any form of sensory feedback (e.g., visual feedback, auditory feedback, or tactile feedback); and input from the user can be received in any form (including sound input, voice input, or tactile input).
[0186] The systems and technologies described herein can be implemented in computing systems that include backend components (e.g., as data servers), or middleware components (e.g., application servers), or frontend components (e.g., user computers with graphical user interfaces or web browsers through which users can interact with implementations of the systems and technologies described herein), or any combination of such backend, middleware, or frontend components. The components of the system can be interconnected via digital data communication of any form or medium (e.g., communication networks). Examples of communication networks include local area networks (LANs), wide area networks (WANs), blockchain networks, and the Internet.
[0187] A computing system can include clients and servers. Clients and servers are generally located far apart and typically interact through communication networks. The client-server relationship is created by computer programs running on the respective computers and having a client-server relationship with each other. The server can be a cloud server, also known as a cloud computing server or cloud host, which is a hosting product within the cloud computing service system to address the shortcomings of traditional physical hosts and VPS services, such as high management difficulty and weak business scalability.
[0188] It should be understood that the various forms of processes shown above can be used, with steps reordered, added, or deleted. For example, the steps described in this invention can be executed in parallel, sequentially, or in different orders, as long as the desired result of the technical solution of this invention can be achieved, and this is not limited herein.
[0189] The specific embodiments described above do not constitute a limitation on the scope of protection of this invention. Those skilled in the art should understand that various modifications, combinations, sub-combinations, and substitutions can be made according to design requirements and other factors. Any modifications, equivalent substitutions, and improvements made within the spirit and principles of this invention should be included within the scope of protection of this invention.
Claims
1. A resource mapping method, characterized in that, include: When a new expected resource block is detected to be injected into the underlying resource pool, the supply time span and expected total supply of the expected resource block are extracted. Based on the supply time span and the expected total supply, the expected resource block is divided into multiple resource atomic units, where the unit description information of the resource atomic unit defines the expected supply of resources under the set time unit. When a target resource acquisition request is detected, the target resource demand and target resource conversion window period that match the target resource acquisition request are obtained; Based on the target resource demand and the target resource conversion window, at least one target resource atom unit is obtained from the unmapped resource atom units in the underlying resource pool and mapped to the requester of the target resource acquisition request.
2. The method according to claim 1, characterized in that, Based on the supply time span and the expected total supply, the expected resource block is divided into multiple resource atomic units, including: Obtain the minimum resource supply time span and the minimum resource allocation amount; Based on the minimum resource supply time span, the expected resource block is divided into multiple initial resource partitioning units, each with a set initial resource quantity. Based on the minimum resource allocation, each initial resource partitioning unit is further divided based on the initial resource amount to obtain the multiple resource atomic units; The set time unit defined in the unit description information is an integer multiple of the minimum resource supply time span, and the resource quantity defined in the unit description information is an integer multiple of the minimum resource allocation quantity.
3. The method according to claim 1, characterized in that, Before obtaining the target resource demand and conversion window that match the target resource acquisition request, the process also includes: Obtain the target resource allocation level that matches the target resource acquisition request, and add the target resource acquisition request to the target virtual channel that matches the target resource acquisition request; In this process, multiple virtual channels are pre-built, with different virtual channels corresponding to different resource allocation levels; After mapping at least one target resource atom unit from the currently unmapped resource atom units in the underlying resource pool to the requester of the target resource acquisition request, based on the target resource demand and target resource conversion window, the process also includes: Establish the mapping relationship between each target resource atomic unit and the target virtual channel; and The mapped state of the current target resource atomic unit is defined in the unit description information of the current target resource atomic unit.
4. The method according to claim 3, characterized in that, Upon detecting a target resource acquisition request, obtain the target resource demand and target resource conversion window that match the target resource acquisition request, including: When a target resource acquisition request is detected, the target exchange base resource and the target resource conversion window period are obtained from the target resource acquisition request; Based on the target exchange base resources and the current target resource exchange rate of the target virtual channel, calculate the target resource demand that matches the target resource acquisition request. Different virtual channels correspond to different resource exchange rates. The higher the resource allocation level of a virtual channel, the lower the resource exchange rate corresponding to that virtual channel.
5. The method according to claim 4, characterized in that, The method further includes: Real-time monitoring of the total amount of basic resources exchanged in each resource acquisition request of each virtual channel, and the percentage of planned completion of the resource exchange plan for each virtual channel; If the planned completion rate of any virtual channel exceeds the preset percentage threshold, the monitored virtual channel will be identified as the target adjustment virtual channel, and the current resource exchange rate of the target adjustment virtual channel will be updated according to the preset non-linear resource exchange rate adjustment strategy.
6. The method according to claim 3, characterized in that, The method further includes: When a local failure information matching the expected resource block is detected, the failure time window matching the local failure information and the supply of failed resources within the failure time window are obtained. In the underlying resource pool, identify each failed resource atom unit that matches the supply of failed resources under the failure time window; After unmapping the mapping relationship between each failed resource atom unit in the mapping state and the matching virtual channel, remove all failed resource atom units from the underlying resource pool; After the mapping relationship is removed, obtain the missing resource amount of each virtual channel, and use the resource atomic units in the underlying resource pool that are currently in an unmapped state to complete the missing resource amount of each virtual channel in order of resource allocation level from high to low.
7. The method according to claim 6, characterized in that, Multiple virtual channels include a first virtual channel, a second virtual channel, and a third virtual channel. The resource allocation level of the first virtual channel is higher than that of the second virtual channel, and the resource allocation level of the second virtual channel is higher than that of the third virtual channel. Following the resource allocation hierarchy from highest to lowest, the missing resource atoms in the underlying resource pool that are currently unmapped are used to complete the missing resource amounts for each virtual channel. This also includes: If all unmapped resource atomic units in the underlying resource pool are mapped to the first virtual channel, and the first virtual channel still has a target missing resource quantity, then the target missing resource quantity in the first virtual channel is filled by using each resource atomic unit that has established a mapping relationship with the second or third virtual channel in the order of resource allocation level from low to high.
8. The method according to claim 7, characterized in that, Following the resource allocation level from low to high, each resource atom unit that has established a mapping relationship with the second or third virtual channel is used to complete the target missing resource amount in the first virtual channel, including: Obtain the third virtual channel as the current completion channel, and among the resource atomic units that have a mapping relationship with the current completion channel, obtain the currently mapped resource atomic unit; After removing the mapping relationship between the current mapped resource atomic unit and the current completion channel, the mapping relationship between the current mapped resource atomic unit and the first virtual channel is re-established; The system checks whether the target missing resource quantity of the first virtual channel can be completed after the resource quantity of the currently mapped resource atomic unit is added into the first virtual channel. If yes, the completion process ends; otherwise, return to the execution of the operation of obtaining the currently mapped resource atomic unit in each resource atomic unit that has a mapping relationship with the current completion channel. When the partial termination and unbinding conditions matching the current completion channel are met, the second virtual channel is used as the new current completion channel. Then, execution returns to each resource atomic unit that has a mapping relationship with the current completion channel to obtain the current mapped resource atomic unit until the complete termination and unbinding conditions are met.
9. The method according to any one of claims 6-8, characterized in that, After using the currently unmapped resource atoms in the underlying resource pool to complete the missing resource amounts for each virtual channel, the process also includes: The resource atomic units that are currently in an unmapped state and are being completed will be mapped to the requester of the resource acquisition request that matches the completed virtual channel; After using the resource atomic units that have established mapping relationships with the second or third virtual channel to complete the target missing resource amount of the first virtual channel, the process also includes: Each resource atom unit used in the second or third virtual channel to complete the first virtual channel is remapped to the requester of the resource acquisition request that matches in the first virtual channel.
10. A resource mapping system, characterized in that, include: The system consists of sensors, an underlying resource pool, a dynamic actuarial engine, a virtual ledger, and a smart contract executor. The sensors are connected to the underlying resource pool, the underlying resource pool is connected to the dynamic actuarial engine, the dynamic actuarial engine is connected to the virtual ledger, and the virtual ledger is connected to the smart contract executor. Sensors are used to inject new expected resource blocks into the underlying resource pool or send local failure information matching the expected resource blocks when resource changes are detected. The underlying resource pool is used to store expected resource blocks; A dynamic actuarial engine is used to execute the resource mapping method as described in any one of claims 1-9; A virtual ledger is used to update records in real time with the expected amount of resources for each requester during the matched resource conversion window. The smart contract executor is used to allocate the expected amount of resources recorded in the virtual ledger that matches the target requester's resource conversion window to the target requester after the current system time reaches the end time.