CN110874331A - Storage address allocation method and device and electronic equipment - Google Patents
Storage address allocation method and device and electronic equipment Download PDFInfo
- Publication number
- CN110874331A CN110874331A CN201911012268.6A CN201911012268A CN110874331A CN 110874331 A CN110874331 A CN 110874331A CN 201911012268 A CN201911012268 A CN 201911012268A CN 110874331 A CN110874331 A CN 110874331A
- Authority
- CN
- China
- Prior art keywords
- target
- storage address
- period
- server
- demander
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F12/00—Accessing, addressing or allocating within memory systems or architectures
- G06F12/02—Addressing or allocation; Relocation
- G06F12/0223—User address space allocation, e.g. contiguous or non contiguous base addressing
- G06F12/0284—Multiple user address space allocation, e.g. using different base addresses
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q30/00—Commerce
- G06Q30/02—Marketing; Price estimation or determination; Fundraising
- G06Q30/0241—Advertisements
- G06Q30/0249—Advertisements based upon budgets or funds
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q30/00—Commerce
- G06Q30/02—Marketing; Price estimation or determination; Fundraising
- G06Q30/0241—Advertisements
- G06Q30/0277—Online advertisement
Landscapes
- Engineering & Computer Science (AREA)
- Business, Economics & Management (AREA)
- Finance (AREA)
- Strategic Management (AREA)
- Theoretical Computer Science (AREA)
- Accounting & Taxation (AREA)
- Development Economics (AREA)
- General Physics & Mathematics (AREA)
- Physics & Mathematics (AREA)
- Entrepreneurship & Innovation (AREA)
- Game Theory and Decision Science (AREA)
- Economics (AREA)
- Marketing (AREA)
- General Business, Economics & Management (AREA)
- General Engineering & Computer Science (AREA)
- Information Transfer Between Computers (AREA)
Abstract
The embodiment of the specification provides a storage address allocation method and device and electronic equipment. The method comprises the following steps: the server initiates an allocation instruction facing to a demand party aiming at the storage address in each period; receiving available computing resources, submitted by each demander, for a target storage address in a target period; determining a target demand party of a target storage address in the target period according to available computing resources submitted by each demand party; and allocating the target storage address in the target period to the target demand side.
Description
Technical Field
The embodiment of the specification relates to the technical field of internet, in particular to a storage address allocation method and device and electronic equipment.
Background
Each memory resource maps a memory address. The allocation of memory resources is the allocation of memory addresses. The allocation of the storage address generally adopts the principle of first-come first-obtained, that is, one party applying for the storage resource first can occupy the storage address preferentially, and release the occupation by the next user after use. However, in some special scenarios, the demander of the storage resource may not be used right away, but at some time in the future. However, according to the existing storage address allocation mechanism, it is not possible to guarantee that the demander can use the storage resource at a certain time in the future, and even it is not possible to guarantee that the demander can use a certain storage resource at a certain time in the future.
Disclosure of Invention
The embodiment of the specification provides a storage address allocation method and device and electronic equipment.
According to a first aspect of embodiments of the present specification, there is provided a storage address allocation method, the method including:
the server initiates an allocation instruction facing to a demand party aiming at the storage address in each period;
receiving available computing resources, submitted by each demander, for a target storage address in a target period;
determining a target demand party of a target storage address in the target period according to available computing resources submitted by each demand party;
and allocating the target storage address in the target period to the target demand side.
According to a second aspect of embodiments of the present specification, there is provided a storage address allocation method, the method including:
the method comprises the steps that a demand party responds to a storage address allocation instruction which is initiated by a server and aims at each period, and submits available computing resources aiming at a target storage address in a target period to the server; and enabling the server to determine a target demand party of the target storage address in the target period according to the available computing resources submitted by each demand party, and allocating the target storage address in the target period to the target demand party.
According to a third aspect of embodiments herein, there is provided a memory address allocation apparatus, the apparatus comprising:
the initiating unit is used for initiating a distribution instruction facing a demand party by the server aiming at the storage address in each period;
the receiving unit is used for receiving the available computing resources which are submitted by all the demanders and aim at the target storage address in the target period;
the determining unit is used for determining a target demand side of the target storage address in the target period according to the available computing resources submitted by each demand side;
and the allocation unit allocates the target storage address in the target period to the target demand side.
According to a fourth aspect of embodiments herein, there is provided a memory address allocation apparatus, the apparatus comprising:
the response unit is used for responding to the allocation instruction aiming at the storage address in each period and initiated by the server by the demand party and submitting available computing resources aiming at the target storage address in the target period to the server; and enabling the server to determine a target demand party of the target storage address in the target period according to the available computing resources submitted by each demand party, and allocating the target storage address in the target period to the target demand party.
According to a fifth aspect of embodiments herein, there is provided an electronic apparatus including:
a processor;
a memory for storing processor-executable instructions;
wherein the processor is configured as any of the above memory address allocation methods.
The embodiment of the specification provides a storage address allocation scheme, wherein a demander replaces the use right of a target storage address in a target period on a server by providing certain available computing resources; therefore, the use requirements of the demander on future storage resources can be met, and the computing resources of the demander can be effectively utilized to meet some computing requirements of the server; therefore, the utilization rate of storage resources and computing resources is improved.
Drawings
FIG. 1 is a flow chart of a method for allocating memory addresses according to an embodiment of the present disclosure;
FIG. 2 is a flow chart of a method for allocating advertisement slots according to an embodiment of the present disclosure;
FIG. 3 is a schematic diagram of the activity entry, operation audit and period sequencing phases provided by an embodiment of the present description;
FIG. 4 is a schematic illustration of the participation in the bidding, merchandise display phase provided by one embodiment of the present description;
fig. 5 is a hardware configuration diagram of a memory address allocation apparatus according to an embodiment of the present disclosure;
fig. 6 is a block diagram of a memory address allocation apparatus according to an embodiment of the present disclosure.
Detailed Description
Reference will now be made in detail to the exemplary embodiments, examples of which are illustrated in the accompanying drawings. When the following description refers to the accompanying drawings, like numbers in different drawings represent the same or similar elements unless otherwise indicated. The embodiments described in the following exemplary embodiments do not represent all embodiments consistent with the present specification. Rather, they are merely examples of apparatus and methods consistent with certain aspects of the specification, as detailed in the appended claims.
The terminology used in the description herein is for the purpose of describing particular embodiments only and is not intended to be limiting of the description. As used in this specification and the appended claims, the singular forms "a", "an", and "the" are intended to include the plural forms as well, unless the context clearly indicates otherwise. It should also be understood that the term "and/or" as used herein refers to and encompasses any and all possible combinations of one or more of the associated listed items. In the present specification, the plural may mean two or more, that is, at least two.
It should be understood that although the terms first, second, third, etc. may be used herein to describe various information, these information should not be limited to these terms. These terms are only used to distinguish one type of information from another. For example, the first information may also be referred to as second information, and similarly, the second information may also be referred to as first information, without departing from the scope of the present specification. The word "if" as used herein may be interpreted as "at … …" or "when … …" or "in response to a determination", depending on the context.
As previously mentioned, in some special scenarios, the demander of the storage resource may not be used as soon as possible, but at some time in the future. However, according to the existing storage address allocation mechanism, it is not possible to guarantee that the demander can use the storage resource at a certain time in the future, and even it is not possible to guarantee that the demander can use a certain storage resource at a certain time in the future.
For this reason, the present specification provides a storage address allocation scheme, in which a demander trades a certain available computing resource for a target storage address in a target period on a server; therefore, the use requirements of the demander on future storage resources can be met, and the computing resources of the demander can be effectively utilized to meet some computing requirements of the server; therefore, the utilization rate of storage resources and computing resources is improved.
The following description provides a storage address allocation method, which may be applied to a server, and may be described with reference to an example shown in fig. 1, and may include the steps of:
step 110: and the server initiates a demand party oriented distribution instruction for the storage address in each period.
The server may be a business server associated with the requiring party, which may provide storage services, as well as computing services, in addition to business services.
The storage service can be used for data storage of the demand side. The storage demand of the demand policy for a time period in the future can be specifically met, and the storage service can be customized not only for a time period in the future but also for one or more specific storage addresses in the time period. For example, the server may provide each storage address in each future cycle for the demander to select, and the demander selects a certain storage address in a certain future cycle for storage according to its own requirements.
The computing service may refer to a computing service provided by a server internally or externally, and after receiving a computing task, the server may perform computing by using its own computing resource. Further details regarding the computing service are provided in subsequent embodiments.
The period may refer to a time period, and the duration of the time period may be configured in advance. For example, 1 day is taken as 1 cycle. Each period may refer to a preset number of periods at the current time or after the current period. The preset number may also be pre-configured. For example, an allocation instruction is initiated for each memory address at 10 cycles in the future.
In order to meet the storage requirements of some demanders for the future time period, the server may initiate an allocation instruction for each storage address in each period after the current period to each demander.
It is worth mentioning that the demander may be a trusted demander.
In the specification, a demand party needs to provide certain computing resources to replace storage resources of a server; however, although the computing resource is provided to the server, the computing resource is still located at the demand side, that is, finally, the computing resource is still controlled by the demand side; therefore, in order to avoid the situation that the demander is out of the range and does not provide computing resources, risk identification or qualification verification needs to be performed on the demander, and a credible demander with lower risk or meeting the qualification or the preset condition is screened out. In brief, the trusted demander may refer to a demander approved by a server, and the computing resource provided by such a demander is a trusted computing resource.
Of course, in practical applications, the server may sign an authorization agreement with the demander to authorize the server to use the rights of the demander computing resources.
Step 120: and receiving available computing resources submitted by each demand party and aiming at the target storage address in the target period.
After each demand party receives an allocation instruction initiated by the server, one or more target storage addresses in one or more target periods can be selected according to the demand of each demand party, and available computing resources are provided for each target storage address. The available computing resources may refer to idle computing resources.
Specifically, the demand side submits available computing resources for the target storage address in the target period to the server in response to the allocation instruction for the storage address in each period, which is initiated by the server.
Step 130: and determining the target demand side of the target storage address in the target period according to the available computing resources submitted by each demand side.
After receiving available computing resources of target storage addresses in each target period returned by each demand side, the server needs to allocate an optimal target demand side to each storage address in each period.
Specifically, the server may count available computing resources submitted by each demand party corresponding to the target storage address in the target period; and determining the demander with the largest available computing resource as the target demander of the target storage address in the target period.
In practical applications, the following three situations may occur at any memory address in any cycle of statistics:
1. there are 1 demander choices, i.e., 1 demander provides available computing resources.
2. There are multiple demanders to choose from, i.e., there are multiple demanders to provide available computing resources.
3. There is no demander choice, i.e., no available computing resource provided by the demander.
For case 1, the server determines this unique requestor as the target requestor for the target storage address at the target cycle.
For the case 2, the server may select the requester with the largest available computing resource from the plurality of available computing resources to determine as the target requester of the target storage address in the target period.
For case 3, the server may initiate the allocation instruction to the target storage address of the target cycle to the requesting party again until each storage address in each cycle is allocated to the target requesting party.
Step 140: and allocating the target storage address in the target period to the target demand side.
After determining the target demand party corresponding to each storage address in each period, the server may allocate the storage address to the target demand party.
As described above, due to the case 3, there may be multiple rounds of allocation commands and target demanders, and the allocation may be performed after each round of target demanders are determined, instead of waiting until all storage addresses in all cycles are determined as target demanders.
In this embodiment, the demander trades the usage right of the target storage address in the target period on the server by providing certain available computing resources; therefore, the use requirement of the demander on the future storage address can be met.
In an embodiment, after acquiring the computing resources provided by the target demand party, the server may perform computing by using the available computing resources submitted by the target demand party.
In practical applications, the server may build a distributed system (distribution) with each of the demand parties. The server may send a computation task to the target demander based on the network of the distributed system, execute the computation task using the available computation resources of the target demander, and receive a computation result returned by the target demander.
Generally, the computing resources required by one computing task may be difficult to compute by using the available technical resources of one demand side, so the server may split one computing task into a plurality of sub-computing tasks according to the available computing resource amount of each target demand side without affecting the computing integrity, where the computing amount of the sub-computing tasks is less than or equal to the available computing resource amount of a single target demand side; therefore, the server can distribute the sub-calculation tasks to a plurality of target demand parties for calculation, and then summarize the calculation results of the target demand parties to obtain the final calculation result.
In this embodiment, the demander trades the usage right of the target storage address in the target period on the server by providing certain available computing resources; therefore, the use requirements of the demander on future storage addresses can be met, and the computing resources of the demander can be effectively utilized to meet some computing requirements of the server; therefore, the utilization rate of storage resources and computing resources is improved.
The above embodiments describe in detail the scheme of allocating future storage addresses to the demand side, and the scheme can be applied to other service scenarios. For example, the business of ad slot assignment on a website page or APP page; business distributed by express delivery cabinets, and the like.
The following is an example of an ad slot assignment service. On various websites or APPs, some highlighted controls are typically required to be provided for promotion or revenues. These controls may be used to display additional information. For example, an exhibition booth (control) for displaying merchandise is provided on an electronic commerce site. Such controls are commonly referred to as ad slots. The ad slots themselves may be dynamic (moving, changing according to a preset program) or static; and the content of the ad slots may likewise be dynamic or static.
The advertisement positions can be used for displaying goods by merchants, and generally, the advertisement positions are highlighted, so that the user reach rate is high, the sales volume of the goods displayed on the advertisement positions is increased, and thus, the merchant can not earn a small profit. The merchant of course needs to pay a certain exhibition fee in order to use the advertising spot. For a website operator, how to make a merchant pay more exhibition fee and influence the merchant operation becomes a problem to be solved urgently, so that the value of the advertisement position on the webpage is exerted to the maximum.
To this end, the present specification further provides an ad slot allocation method, which may be described with reference to the example shown in fig. 2, and which may be applied to a server, the method may include the steps of:
step 210: a server of the page launches a bidding instruction facing a merchant aiming at each advertisement space on the page under each period;
step 220: receiving bidding funds submitted by various merchants aiming at the target advertising position in the target period;
step 230: determining target commercial tenants of the target advertisement positions in the target period according to the bidding funds submitted by the commercial tenants;
step 240: and allocating the target advertisement space in the target period to the target merchant.
In a page ad slot scenario, a merchant may purchase the use of an ad slot in a page for some period in the future from a server.
The method mainly relates to the stages of activity registration, operation examination, periodic sequencing, participation bidding, commodity display and the like in a service advertisement space distribution scene.
The process of the above-mentioned several stages is described below in connection with fig. 3 and 4.
FIG. 3 is a diagram of activity entry, operational audit and cycle sequencing.
The activity entry stage refers to entering the bid of the ad slot by the merchant. Wherein, the merchant needs to upload the registration information through the registration tool. The entry information may include merchant information, merchandise information, and the like. Then, the server can synchronize the commodity information to the commodity management module through the data synchronization module, and the merchant can manage the commodity. The server can automatically check whether the merchant has the qualification of bidding according to the registration information. In the event that the review passes, the merchant may participate in bidding.
The period sorting stage mainly completes the collection of the advertisement positions participating in the auction and carries out the period sorting of each advertisement position according to a preset period. Meanwhile, the method can also provide a target advertisement position in a target period selected by the merchant after the merchant enters the scheduling page. Specifically, the server may sort the collected ad spots each day, count the ad spots according to the date, generate a schedule one by one in the date dimension, and generate a bid for the schedule in a linkage manner when the schedule is generated, where the bid is a basis for a merchant to perform an auction. The merchant may select a listing ahead of time in the listing pool, which may show the available ad spots for each period in the dimension of the date. For example, two periods after the current period can be selected for scheduling, and selectable items of two continuous periods are displayed, the auction reservation page can be automatically updated every day, the merchant can select the period and the advertisement space according to the needs of the merchant, and the merchant can automatically join the bidding personnel pool once the merchant selects to confirm.
Fig. 4 is a schematic diagram of participation in bidding and merchandise display.
The participation in the bidding phase mainly provides merchants to bid on the ad spots. After the bidding time expires, the server may automatically alert the merchant, who determines to participate in the bidding. After entering the bidding page, the user displays the bidding page of the target advertisement space of the target period selected by the user in advance. The merchant submits bidding funds aiming at the advertising space and completes the quotation. After bidding starts for a preset time, bidding is finished, the server counts the bidding information of all merchants participating in bidding, selects the target merchant as in the embodiment shown in fig. 1, and allocates each advertisement slot of each period to each determined target merchant.
It should be noted that the bidding system can manage the price rules of the ad slots, for example, can set various forms such as bidding or a bid. In the bidding form, the higher price is obtained; in the bite price form, the first bite price is obtained. Wherein, the auction rules can also be set. For example, a take-off value of 1000, 100 per charge, no capping; penalty rules: and completing payment within 48 hours after the auction is successful, ensuring that the money is deducted by 1000 yuan if the payment is not carried out on time, and adding the money into the blacklist of the import market after three times.
The order payment mainly needs to be paid after the order is generated for the exhibition position which has completed the auction, and 1 if the auction of the merchant succeeds, the order is generated and the payment needs to be completed within 48 hours. And when the payment is finished, waiting for the scheduled time to be on line. The period of event display for successful auction and successful payment of the goods is, for example, 7 days.
In the commodity display stage, after the successful payment of the merchants, the commodities of the target merchants are displayed on the advertisement positions according to the advertisement position distribution result in the period after the start of any period. And the commercial tenant can be reminded that the competitive advertisement space of the commercial tenant starts to display the commodity, so that the commercial tenant can check whether the competitive advertisement space display commodity is the commodity advertisement submitted at that time and whether the advertisement effect is satisfied. The merchant can also return a receipt through a feedback channel provided by the server, wherein the receipt is used for explaining the satisfaction degree, suggestion and the like of the merchant for displaying the commodity advertisement on the advertisement space.
In this embodiment, a merchant acquires the use right of a target advertisement space in a target period on a page by participating in bidding; therefore, the using requirements of commercial tenants on future advertisement positions can be met, and the bidding enthusiasm of the commercial tenants can be effectively mobilized to realize the maximization of the value of the advertisement positions.
Corresponding to the foregoing embodiments of the memory address allocation method, the present specification also provides embodiments of a memory address allocation apparatus. The device embodiments may be implemented by software, or by hardware, or by a combination of hardware and software. The software implementation is taken as an example, and as a logical device, the device is formed by reading corresponding computer business program instructions in the nonvolatile memory into the memory for operation through the processor of the device in which the device is located. In terms of hardware, as shown in fig. 5, a hardware structure diagram of a device where a storage address allocation apparatus is located in this specification is shown, except for the processor, the network interface, the memory, and the nonvolatile memory shown in fig. 5, the device where the apparatus is located in the embodiment may generally allocate an actual function according to a storage address, and may further include other hardware, which is not described again.
Referring to fig. 6, a block diagram of a storage address allocation apparatus provided in an embodiment of the present disclosure, where the apparatus corresponds to the embodiment shown in fig. 1 and is applied to a server, includes:
the initiating unit 310 initiates an allocation instruction facing to a demand party according to the storage address in each period;
a receiving unit 320, configured to receive available computing resources for a target storage address in a target period, which are submitted by each demand side;
a determining unit 330, configured to determine a target demand side of the target storage address in the target period according to the available computing resources submitted by each demand side;
and the allocating unit 340 allocates the target storage address in the target period to the target demand side.
Optionally, the determining unit 330 specifically includes:
counting available computing resources submitted by each demand party corresponding to the target storage address in the target period;
and determining the demander with the largest available computing resource as the target demander of the target storage address in the target period.
Optionally, the apparatus further comprises:
and the computing unit is used for computing by utilizing the available computing resources submitted by the target demand party.
Optionally, the computing unit specifically includes:
and sending the calculation task to the target demander, executing the calculation task by using the available calculation resources of the target demander, and receiving a calculation result returned by the target demander.
Optionally, the storage address includes an advertisement slot in a page;
the server comprises a server of the page;
the demander comprises a merchant;
the available computing resources include bid funds of the merchant.
An embodiment of the present disclosure provides a storage address allocation apparatus, applied to a demander, including:
the response unit is used for responding to the allocation instruction aiming at the storage address in each period and initiated by the server by the demand party and submitting available computing resources aiming at the target storage address in the target period to the server; and enabling the server to determine a target demand party of the target storage address in the target period according to the available computing resources submitted by each demand party, and allocating the target storage address in the target period to the target demand party.
Optionally, the determining, by the server, the target demand party of the target storage address in the target period according to the available computing resource submitted by each demand party specifically includes:
the server counts available computing resources submitted by each demand party corresponding to the target storage address in the target period; and determining the demander with the largest available computing resource as the target demander of the target storage address in the target period.
Optionally, the method further includes:
and the computing unit executes the computing task by using the available computing resources corresponding to the target storage address in the target period after allocating the target storage address in the target period and receiving the computing task sent by the server, and returns the receiving result to the server.
Optionally, the resource includes an ad slot in a page;
the server comprises a server of the page;
the demander comprises a merchant;
the available computing resources include bid funds of the merchant.
The systems, devices, modules or units illustrated in the above embodiments may be implemented by a computer chip or an entity, or by a product with certain functions. A typical implementation device is a computer, which may take the form of a personal computer, laptop computer, cellular telephone, camera phone, smart phone, personal digital assistant, media player, navigation device, email messaging device, game console, tablet computer, wearable device, or a combination of any of these devices.
The implementation process of the functions and actions of each unit in the above device is specifically described in the implementation process of the corresponding step in the above method, and is not described herein again.
For the device embodiments, since they substantially correspond to the method embodiments, reference may be made to the partial description of the method embodiments for relevant points. The above-described embodiments of the apparatus are merely illustrative, and the units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the modules can be selected according to actual needs to achieve the purpose of the solution in the specification. One of ordinary skill in the art can understand and implement it without inventive effort.
Fig. 6 above describes the internal functional modules and the structural schematic of the storage address allocation apparatus, and the substantial execution subject may be an electronic device, including:
a processor;
a memory for storing processor-executable instructions;
wherein the processor is configured to:
the server initiates an allocation instruction facing to a demand party aiming at the storage address in each period;
receiving available computing resources, submitted by each demander, for a target storage address in a target period;
determining a target demand party of a target storage address in the target period according to available computing resources submitted by each demand party;
and allocating the target storage address in the target period to the target demand side.
Alternatively, the first and second electrodes may be,
the method comprises the steps that a demand party responds to a storage address allocation instruction which is initiated by a server and aims at each period, and submits available computing resources aiming at a target storage address in a target period to the server; and enabling the server to determine a target demand party of the target storage address in the target period according to the available computing resources submitted by each demand party, and allocating the target storage address in the target period to the target demand party.
In the above embodiments of the electronic device, it should be understood that the Processor may be a Central Processing Unit (CPU), other general-purpose processors, a Digital Signal Processor (DSP), an Application Specific Integrated Circuit (ASIC), etc. The general-purpose processor may be a microprocessor, or the processor may be any conventional processor, and the aforementioned memory may be a read-only memory (ROM), a Random Access Memory (RAM), a flash memory, a hard disk, or a solid state disk. The steps of a method disclosed in connection with the embodiments of the present specification may be embodied directly in a hardware processor, or in a combination of the hardware and software modules of the processor.
The embodiments in the present specification are described in a progressive manner, and the same and similar parts among the embodiments are referred to each other, and each embodiment focuses on the differences from the other embodiments. In particular, for the embodiment of the electronic device, since it is substantially similar to the embodiment of the method, the description is simple, and for the relevant points, reference may be made to part of the description of the embodiment of the method.
Other embodiments of the present disclosure will be apparent to those skilled in the art from consideration of the specification and practice of the disclosure disclosed herein. This specification is intended to cover any variations, uses, or adaptations of the specification following, in general, the principles of the specification and including such departures from the present disclosure as come within known or customary practice within the art to which the specification pertains. It is intended that the specification and examples be considered as exemplary only, with a true scope and spirit of the specification being indicated by the following claims.
It will be understood that the present description is not limited to the precise arrangements described above and shown in the drawings, and that various modifications and changes may be made without departing from the scope thereof. The scope of the present description is limited only by the appended claims.
Claims (12)
1. A method of memory address allocation, the method comprising:
the server initiates an allocation instruction facing to a demand party aiming at the storage address in each period;
receiving available computing resources, submitted by each demander, for a target storage address in a target period;
determining a target demand party of a target storage address in the target period according to available computing resources submitted by each demand party;
and allocating the target storage address in the target period to the target demand side.
2. The method according to claim 1, wherein the determining the target demander of the target storage address in the target period according to the available computing resources submitted by each demander specifically comprises:
counting available computing resources submitted by each demand party corresponding to the target storage address in the target period;
and determining the demander with the largest available computing resource as the target demander of the target storage address in the target period.
3. The method of claim 1, further comprising:
and calculating by using the available computing resources submitted by the target demand party.
4. The method according to claim 3, wherein the calculating using the available computing resources submitted by the target demander specifically comprises:
and sending the calculation task to the target demander, executing the calculation task by using the available calculation resources of the target demander, and receiving a calculation result returned by the target demander.
5. The method of claim 1, the memory address comprising an ad slot in a page;
the server comprises a server of the page;
the demander comprises a merchant;
the available computing resources include bid funds of the merchant.
6. A method of memory address allocation, the method comprising:
the method comprises the steps that a demand party responds to a storage address allocation instruction which is initiated by a server and aims at each period, and submits available computing resources aiming at a target storage address in a target period to the server; and enabling the server to determine a target demand party of the target storage address in the target period according to the available computing resources submitted by each demand party, and allocating the target storage address in the target period to the target demand party.
7. The method according to claim 6, wherein the server determines the target demander of the target storage address in the target period according to the available computing resources submitted by each demander, and specifically includes:
the server counts available computing resources submitted by each demand party corresponding to the target storage address in the target period; and determining the demander with the largest available computing resource as the target demander of the target storage address in the target period.
8. The method of claim 6, further comprising:
after the target storage address in the target period is allocated and the calculation task sent by the server is received, the calculation task is executed by using the available calculation resource corresponding to the target storage address in the target period, and the receiving result is returned to the server.
9. The method of claim 6, the resource comprising an ad slot in a page;
the server comprises a server of the page;
the demander comprises a merchant;
the available computing resources include bid funds of the merchant.
10. A memory address assignment device, the device comprising:
the initiating unit is used for initiating a distribution instruction facing a demand party by the server aiming at the storage address in each period;
the receiving unit is used for receiving the available computing resources which are submitted by all the demanders and aim at the target storage address in the target period;
the determining unit is used for determining a target demand side of the target storage address in the target period according to the available computing resources submitted by each demand side;
and the allocation unit allocates the target storage address in the target period to the target demand side.
11. A memory address assignment device, the device comprising:
the response unit is used for responding to the allocation instruction aiming at the storage address in each period and initiated by the server by the demand party and submitting available computing resources aiming at the target storage address in the target period to the server; and enabling the server to determine a target demand party of the target storage address in the target period according to the available computing resources submitted by each demand party, and allocating the target storage address in the target period to the target demand party.
12. An electronic device, comprising:
a processor;
a memory for storing processor-executable instructions;
wherein the processor is configured as the method of any of the preceding claims 1-9.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911012268.6A CN110874331A (en) | 2019-10-23 | 2019-10-23 | Storage address allocation method and device and electronic equipment |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911012268.6A CN110874331A (en) | 2019-10-23 | 2019-10-23 | Storage address allocation method and device and electronic equipment |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN110874331A true CN110874331A (en) | 2020-03-10 |
Family
ID=69717893
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201911012268.6A Pending CN110874331A (en) | 2019-10-23 | 2019-10-23 | Storage address allocation method and device and electronic equipment |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110874331A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114343338A (en) * | 2021-12-30 | 2022-04-15 | 深圳市丰巢网络技术有限公司 | Intelligent cabinet and intelligent cabinet control method |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20060173743A1 (en) * | 2005-02-02 | 2006-08-03 | Bollay Denison W | Method of realtime allocation of space in digital media based on an advertiser's expected return on investment, ad placement score, and a publisher score |
| CN106603657A (en) * | 2016-12-13 | 2017-04-26 | 国网天津市电力公司 | IMS-based video conference resource optimization method |
| CN107004202A (en) * | 2014-09-16 | 2017-08-01 | 声钰科技 | The system and method that the user that markets asks |
| CN108062678A (en) * | 2016-11-08 | 2018-05-22 | 阿里巴巴集团控股有限公司 | A kind of advertisement bit allocation method, device and advertisement delivery system |
| CN108898436A (en) * | 2018-06-29 | 2018-11-27 | 清华大学 | Advertisement placement method and system, server and computer readable storage medium |
-
2019
- 2019-10-23 CN CN201911012268.6A patent/CN110874331A/en active Pending
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20060173743A1 (en) * | 2005-02-02 | 2006-08-03 | Bollay Denison W | Method of realtime allocation of space in digital media based on an advertiser's expected return on investment, ad placement score, and a publisher score |
| CN107004202A (en) * | 2014-09-16 | 2017-08-01 | 声钰科技 | The system and method that the user that markets asks |
| CN108062678A (en) * | 2016-11-08 | 2018-05-22 | 阿里巴巴集团控股有限公司 | A kind of advertisement bit allocation method, device and advertisement delivery system |
| CN106603657A (en) * | 2016-12-13 | 2017-04-26 | 国网天津市电力公司 | IMS-based video conference resource optimization method |
| CN108898436A (en) * | 2018-06-29 | 2018-11-27 | 清华大学 | Advertisement placement method and system, server and computer readable storage medium |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114343338A (en) * | 2021-12-30 | 2022-04-15 | 深圳市丰巢网络技术有限公司 | Intelligent cabinet and intelligent cabinet control method |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| JP7233767B2 (en) | System and method for reverse bidding auction | |
| CN109583998B (en) | Credit value-based platform contract execution method and device | |
| CN106487715B (en) | Method and device for allocating resources to users | |
| US20090276364A1 (en) | Process control system | |
| KR20190090786A (en) | Method and apparatus for offline interaction based on augmented reality | |
| US20130097028A1 (en) | Dynamic Floor Pricing for Managing Exchange Monetization | |
| US11107119B2 (en) | Conducting dynamic media lift studies concurrently with operating online advertising campaigns | |
| WO2009082074A1 (en) | Auction system for possession of on-line advertisement area and operating method thereof | |
| KR102109489B1 (en) | Transaction processing method and apparatus thereof | |
| KR20170141166A (en) | Platform System for Matching between Bidding Expert and Bidding Participant and Method thereof | |
| CN111092814B (en) | Service handling request message distribution method and equipment | |
| US20180018732A1 (en) | System and method for reverse sealed bid auctions | |
| US20150154515A1 (en) | Methods and systems for booking an event | |
| CN111861525A (en) | Task execution method and device, electronic equipment and computer readable storage medium | |
| KR101735287B1 (en) | The method, server and system for providing application funding service | |
| CN110874331A (en) | Storage address allocation method and device and electronic equipment | |
| CN107527250B (en) | Order management method and server | |
| Ozyagci et al. | Truthful incentive mechanism for mobile crowdsensing with smart consumer devices | |
| CN103077468A (en) | Dynamic resource allocation method and system for online transaction | |
| US20210082029A1 (en) | Intermediary Method, Intermediary Device, and Recording Medium/Program | |
| CN116074541B (en) | Resource processing method, system, device and electronic equipment | |
| KR20200048401A (en) | A method for providing transaction services of advertisement traffic networks | |
| KR102595366B1 (en) | Service reservation and marketing template provision system | |
| JP7178475B2 (en) | Information processing device, information processing method, and program | |
| US20220172281A1 (en) | System and method for reverse sealed bid auctions |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20200310 |