CN110765136A - Identifier management method, device, medium and equipment - Google Patents
Identifier management method, device, medium and equipment Download PDFInfo
- Publication number
- CN110765136A CN110765136A CN201911047992.2A CN201911047992A CN110765136A CN 110765136 A CN110765136 A CN 110765136A CN 201911047992 A CN201911047992 A CN 201911047992A CN 110765136 A CN110765136 A CN 110765136A
- Authority
- CN
- China
- Prior art keywords
- identifier
- memory
- production
- set value
- server
- 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
- 238000007726 management method Methods 0.000 title description 23
- 238000003860 storage Methods 0.000 claims abstract description 148
- 238000004519 manufacturing process Methods 0.000 claims abstract description 145
- 230000015654 memory Effects 0.000 claims abstract description 136
- 238000000034 method Methods 0.000 claims abstract description 63
- 238000004891 communication Methods 0.000 claims abstract description 12
- 230000004044 response Effects 0.000 claims abstract description 12
- 238000001514 detection method Methods 0.000 claims description 7
- 238000004590 computer program Methods 0.000 claims description 4
- 230000002349 favourable effect Effects 0.000 abstract description 4
- 238000010586 diagram Methods 0.000 description 13
- 239000002699 waste material Substances 0.000 description 9
- 230000008569 process Effects 0.000 description 8
- 238000009826 distribution Methods 0.000 description 6
- 230000007246 mechanism Effects 0.000 description 6
- 230000003287 optical effect Effects 0.000 description 4
- 239000003795 chemical substances by application Substances 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- 230000006870 function Effects 0.000 description 2
- 239000013307 optical fiber Substances 0.000 description 2
- 230000000644 propagated effect Effects 0.000 description 2
- 102100033312 Alpha-2-macroglobulin Human genes 0.000 description 1
- 101710187168 Alpha-2-macroglobulin Proteins 0.000 description 1
- 101710136034 Alpha-2-macroglobulin homolog Proteins 0.000 description 1
- 230000009471 action Effects 0.000 description 1
- 230000006978 adaptation Effects 0.000 description 1
- 238000003491 array Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 239000000835 fiber Substances 0.000 description 1
- 239000005556 hormone Substances 0.000 description 1
- 229940088597 hormone Drugs 0.000 description 1
- 239000003999 initiator Substances 0.000 description 1
- 230000014759 maintenance of location Effects 0.000 description 1
- 230000002093 peripheral effect Effects 0.000 description 1
- 230000008092 positive effect Effects 0.000 description 1
- 230000001105 regulatory effect Effects 0.000 description 1
- 239000004065 semiconductor Substances 0.000 description 1
- 238000011895 specific detection Methods 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/22—Indexing; Data structures therefor; Storage structures
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/27—Replication, distribution or synchronisation of data between databases or within a distributed database system; Distributed database system architectures therefor
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/28—Databases characterised by their database models, e.g. relational or object models
- G06F16/283—Multi-dimensional databases or data warehouses, e.g. MOLAP or ROLAP
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/46—Multiprogramming arrangements
- G06F9/50—Allocation of resources, e.g. of the central processing unit [CPU]
- G06F9/5005—Allocation of resources, e.g. of the central processing unit [CPU] to service a request
- G06F9/5027—Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resource being a machine, e.g. CPUs, Servers, Terminals
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/46—Multiprogramming arrangements
- G06F9/50—Allocation of resources, e.g. of the central processing unit [CPU]
- G06F9/5061—Partitioning or combining of resources
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q40/00—Finance; Insurance; Tax strategies; Processing of corporate or income taxes
- G06Q40/08—Insurance
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Databases & Information Systems (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Software Systems (AREA)
- General Engineering & Computer Science (AREA)
- Business, Economics & Management (AREA)
- Data Mining & Analysis (AREA)
- Accounting & Taxation (AREA)
- Finance (AREA)
- Development Economics (AREA)
- Economics (AREA)
- Marketing (AREA)
- Strategic Management (AREA)
- Technology Law (AREA)
- General Business, Economics & Management (AREA)
- Computing Systems (AREA)
- Stored Programmes (AREA)
Abstract
The present disclosure relates to the technical field of data processing, and provides a method and an apparatus for managing an identifier, a computer medium, and an electronic device, wherein the method includes: in response to a first memory in a distributed storage warehouse receiving an allocation request of an identifier sent by a first application server in communication connection with the first memory, detecting whether the first memory stores an identifier to be allocated corresponding to the allocation request; if the identifier to be allocated is not stored in the first memory, sending a production request of the identifier to a production server; receiving an identifier generated by the production server based on the uniform production rule; and sending the received identifier to the first application server to realize the application of the identifier by the first application server. The technical scheme can avoid the problem of identifier repetition. Meanwhile, the problem that different application servers consume the identifiers at different rates can be effectively solved, and the method is favorable for saving computing resources and improving the utilization rate of the identifiers.
Description
Technical Field
The present disclosure relates to the field of data processing technologies, and in particular, to a method and an apparatus for managing an identifier, and a computer storage medium and an electronic device for implementing the method.
Background
A Globally Unique Identifier (GUID) is a binary numeric Identifier generated by an algorithm. For a company or enterprise, in order to realize sharing of internal resources, a globally unique identifier GUID is used in each sub-organization (or sub-department). However, in the related art, the following problems currently exist with regard to GUIDs:
1. the identifiers are independently generated by each sub-organization, which makes the identifiers highly susceptible to duplication problems.
2. The actual rates of consumption of identifiers for various services in different sub-organizations are different, and it is difficult to intelligently allocate identifiers to resources of different consumption rates, resulting in a large waste of computing resources and a large waste of GUIDs.
It is to be noted that the information disclosed in the background section above is only used to enhance understanding of the background of the present disclosure.
Disclosure of Invention
The present disclosure is directed to an identifier management method, an identifier management apparatus, a computer storage medium, and an electronic device, so as to avoid, at least to a certain extent, the drawback in the related art that it is difficult to intelligently allocate identifiers to resources with different consumption rates, which results in a large amount of waste of computing resources and a large amount of waste of GUIDs.
Additional features and advantages of the disclosure will be set forth in the detailed description which follows, or in part will be obvious from the description, or may be learned by practice of the disclosure.
According to a first aspect of the present disclosure, there is provided a method for managing an identifier, including:
responding to a first memory in a distributed storage warehouse to receive an allocation request of an identifier sent by a first application server in communication connection with the first memory, and detecting whether the first memory stores an identifier to be allocated corresponding to the allocation request;
if the identifier to be allocated is not stored in the first memory, sending a production request of the identifier to a production server;
receiving an identifier generated by the production server based on a uniform production rule;
and sending the received identifier to the first application server to realize the application of the identifier by the first application server.
In an exemplary embodiment of the present disclosure, based on the foregoing solution, the memories in the distributed storage warehouse adopt distributed deployment on physical deployment; the first storage exists in a local system of the first application server.
In an exemplary embodiment of the disclosure, based on the foregoing scheme, after receiving the identifier generated by the production server using the unified production rule, the method further includes:
acquiring a first set value of the identifier storage amount of the first memory, and detecting whether the current storage amount of the first memory is smaller than the first set value;
if the current storage amount of the first memory is smaller than the first set value, the production request of the identifier is continuously sent to the production server until the current storage amount of the first memory is larger than or equal to the first set value.
In an exemplary embodiment of the present disclosure, based on the foregoing scheme, the method further includes:
acquiring a second set value of the identifier storage amount of the first memory, and detecting whether the current storage amount of the first memory is smaller than the second set value or not at regular time through a timer, wherein the second set value is smaller than the first set value;
if the current storage capacity of the first memory is smaller than the second set value, the production server continues to send the production request of the identifier to the production server until the current storage capacity of the first memory is larger than or equal to the first set value.
In an exemplary embodiment of the present disclosure, based on the foregoing scheme, the method further includes:
for any target memory in the distributed storage warehouse, acquiring the number of identifiers in the received allocation request within a first preset time;
and setting the number of the identifiers in the allocation request as a first set value corresponding to the next first preset time.
In an exemplary embodiment of the present disclosure, based on the foregoing scheme, the method further includes:
for any target memory in the distributed storage warehouse, acquiring first set values corresponding to N first preset time lengths to obtain N first set values;
and setting the minimum value of the N first set values as a second set value corresponding to the next first preset time length, wherein N is a positive integer.
In an exemplary embodiment of the present disclosure, based on the foregoing scheme, after sending the received identifier to the first application server, the method further includes:
and deleting the status flag of the identifier sent to the first application server.
In an exemplary embodiment of the present disclosure, based on the foregoing scheme, the method further includes:
acquiring a first set value of the second memory identifier storage amount in response to the second memory being added to the distributed storage repository;
and sending a production request of the identifier to the production server until the current storage capacity of the second storage is greater than or equal to the first set value.
According to a second aspect of the present disclosure, there is provided an identifier management apparatus, the apparatus including:
a first detection module to: responding to a first memory in a distributed storage warehouse to receive an allocation request of an identifier sent by a first application server in communication connection with the first memory, and detecting whether the first memory stores an identifier to be allocated corresponding to the allocation request;
a production request sending module for: if the identifier to be allocated is not stored in the first memory, sending a production request of the identifier to a production server;
an identifier receiving module to: receiving an identifier generated by the production server based on a uniform production rule;
an identifier assignment module to: and sending the received identifier to the first application server to realize the application of the identifier by the first application server.
According to a third aspect of the present disclosure, there is provided a computer storage medium having stored thereon a computer program which, when executed by a processor, implements the method of managing an identifier of the first aspect described above.
According to a fourth aspect of the present disclosure, there is provided an electronic device comprising: a processor; and a memory for storing executable instructions of the processor; wherein the processor is configured to perform the method of managing identifiers of the first aspect via execution of the executable instructions.
As can be seen from the foregoing technical solutions, the identifier management method, the identifier management apparatus, the computer storage medium, and the electronic device in the exemplary embodiments of the present disclosure have at least the following advantages and positive effects:
in the technical solution provided by some embodiments of the present disclosure, in response to an allocation request of an identifier sent by an application server, it is detected whether a first memory for storing the identifier stores an identifier to be allocated corresponding to the allocation request. If the identifier to be allocated is not stored in the first memory, further sending a production request of the identifier to a production server, and after receiving the identifier generated by the production server based on the uniform production rule, sending the received identifier to the first application server so as to realize the application of the identifier by the first application server.
On one hand, the identifier in the technical scheme is generated by the production server based on the uniform production rule, so that the problem of identifier repetition is avoided. On the other hand, the production server and the application server are connected through a distributed storage library, and distributed storage and distribution of the identifiers are achieved. And providing the stored identifier to the application server based on the allocation request of the identifier of the application server, or providing the identifier to the application server after sending a generation request of the identifier to the production server. Therefore, the problem that different application servers consume identifiers at different rates is effectively solved, and the method is favorable for saving computing resources and improving the utilization rate of the identifiers.
It is to be understood that both the foregoing general description and the following detailed description are exemplary and explanatory only and are not restrictive of the disclosure.
Drawings
The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments consistent with the present disclosure and together with the description, serve to explain the principles of the disclosure. It is to be understood that the drawings in the following description are merely exemplary of the disclosure, and that other drawings may be derived from those drawings by one of ordinary skill in the art without the exercise of inventive faculty.
FIG. 1 illustrates a system architecture diagram for implementing a management method for identifiers in an exemplary embodiment of the present disclosure;
FIG. 2 illustrates a flow diagram of a method of managing identifiers in an exemplary embodiment of the disclosure;
FIG. 3 illustrates a schematic diagram of the production, storage, distribution and application of identifiers in an exemplary embodiment of the present disclosure;
FIG. 4 illustrates a flow diagram of the production, storage, distribution, and application of identifiers in an exemplary embodiment of the present disclosure;
FIG. 5 shows a flow diagram of a parameter determination method in an exemplary embodiment of the present disclosure;
fig. 6 shows a schematic structural diagram of a management apparatus of an identifier in another exemplary embodiment of the present disclosure;
FIG. 7 shows a schematic diagram of a structure of a computer storage medium in an exemplary embodiment of the disclosure; and the number of the first and second groups,
fig. 8 shows a schematic structural diagram of an electronic device in an exemplary embodiment of the present disclosure.
Detailed Description
Example embodiments will now be described more fully with reference to the accompanying drawings. Example embodiments may, however, be embodied in many different forms and should not be construed as limited to the examples set forth herein; rather, these embodiments are provided so that this disclosure will be thorough and complete, and will fully convey the concept of example embodiments to those skilled in the art.
Furthermore, the described features, structures, or characteristics may be combined in any suitable manner in one or more embodiments. In the following description, numerous specific details are provided to give a thorough understanding of embodiments of the disclosure. One skilled in the relevant art will recognize, however, that the subject matter of the present disclosure can be practiced without one or more of the specific details, or with other methods, components, devices, steps, and so forth. In other instances, well-known methods, devices, implementations, or operations have not been shown or described in detail to avoid obscuring aspects of the disclosure.
The block diagrams shown in the figures are functional entities only and do not necessarily correspond to physically separate entities. I.e. these functional entities may be implemented in the form of software, or in one or more hardware modules or integrated circuits, or in different networks and/or processor means and/or microcontroller means.
The flow charts shown in the drawings are merely illustrative and do not necessarily include all of the contents and operations/steps, nor do they necessarily have to be performed in the order described. For example, some operations/steps may be decomposed, and some operations/steps may be combined or partially combined, so that the actual execution sequence may be changed according to the actual situation.
The present exemplary embodiment first provides a system architecture for implementing a management method for an identifier, which can be applied to various data processing scenarios, for example: a production scenario for the identifier, an application scenario for the identifier, etc. Referring to fig. 1, the system architecture 100 may include terminal devices 101, 102, 103, a network 104, and a server 105. The network 104 serves as a medium for providing communication links between the terminal devices 101, 102, 103 and the server 105. Network 104 may include various connection types, such as wired, wireless communication links, or fiber optic cables, to name a few.
The user may use the terminal devices 101, 102, 103 to interact with the server 105 via the network 104 to receive or send request instructions or the like. The terminal devices 101, 102, 103 may have various communication client applications installed thereon, such as a photo processing application, a shopping application, a web browser application, a search application, an instant messaging tool, a mailbox client, social platform software, and the like.
The terminal devices 101, 102, 103 may be various electronic devices having a display screen and supporting web browsing, including but not limited to smart phones, tablet computers, laptop portable computers, desktop computers, and the like.
The server 105 may be a server that provides various services, for example, in response to receiving an allocation request of an identifier sent by a user using the terminal devices 101, 102, 103, detecting whether an identifier to be allocated corresponding to the allocation request is stored in a first memory in a distributed storage warehouse; and if the identifier to be allocated is not stored in the first memory, sending a production request of the identifier to a production server (for example only). The backend management server may receive an identifier generated by the production server based on the unified production rules (for example only). The background management server can also send the received identifier to the first application server so as to realize the application of the identifier by the first application server.
It should be noted that the management method of the identifier provided in the embodiment of the present application is generally executed by the server 105, and accordingly, the management device of the identifier is generally provided in the terminal device 101.
In the conventional technology for managing the correlation identifier, an insurance company is taken as an example as follows:
the first scheme is that the insurance company does not have a unified insurance management system actually, and different insurance management systems are established for different types of insurance. Such as life insurance systems, financial insurance systems, etc. Such systems each have different GUID production allocation mechanisms, making it difficult to analyze and share various types of resources of a company from a uniform perspective, and GUID duplication is easy to occur.
The second implementation is to use the sender mechanism commonly used by internet companies. And (4) forming an independent number sender to establish a uniform GUID production source for the system. The mechanism solves the problem of the repeatability of the GUID, realizes the uniformity of a production allocation mechanism, and can realize resource sharing very smoothly. But the problem is that there is a huge waste of resources for application in the insurance system. Internet applications have a higher speed frequency than insurance companies, since the initiator mechanism is based on the on-the-fly generation, there is almost no waste of resources for very high frequency internet applications, but for insurance applications, there will be a large probability of a large waste of computing resources and GUIDs due to the huge difference in their frequency of resource usage.
In embodiments of the present disclosure, a method, an apparatus, a computer medium, and an electronic device for managing an identifier are provided, which overcome the above disadvantages of the related art at least to some extent. The following description will first describe a management method of the identifier.
Fig. 2 shows a flow diagram of a method for managing identifiers in an exemplary embodiment of the disclosure. Referring to fig. 2, the embodiment shown in the figure provides a method comprising:
step S210, in response to a first memory in a distributed storage warehouse receiving an allocation request of an identifier sent by a first application server in communication connection with the first memory, detecting whether the first memory stores an identifier to be allocated corresponding to the allocation request;
step S220, if the identifier to be distributed is not stored in the first memory, sending a production request of the identifier to a production server;
step S230, receiving an identifier generated by the production server based on a uniform production rule; and the number of the first and second groups,
step S240, sending the received identifier to the first application server, so as to implement the application of the identifier by the first application server.
In an exemplary embodiment, fig. 3 shows a schematic diagram of the structure of the production, storage, distribution and application of identifiers in an exemplary embodiment of the present disclosure. Referring to fig. 3, including: production server 310 (for production of identifier GUIDs), storage repository 320 (for storage and allocation of GUIDs), and application server 330 (for application of GUIDs).
The technical effect of the technical solution provided by the embodiment shown in fig. 2 is analyzed with reference to fig. 3, as follows: on one hand, the identifier in the present technical solution is generated by the production server 310 based on the uniform production rule, thereby avoiding the problem of identifier duplication. On the other hand, the production server 310 and the application server 330 are connected by a distributed storage library 320, and distributed storage and allocation of identifiers are realized. And provides the stored identifier to the application server based on the request for allocation of the identifier of the application server 330, or provides the identifier to the application server 330 after transmitting the request for generation of the identifier to the production server 310. Therefore, the problem that different application servers consume identifiers at different rates is effectively solved, and the method is favorable for saving computing resources and improving the utilization rate of the identifiers.
The production server 310 may also be referred to as a "production factory" and represents an independent system that produces GUIDs. Illustratively, multiple production servers may be employed to meet the application requirements for a large number of GUIDs. Additionally, each production server contains a plurality of production threads for the production GUID.
Illustratively, the storage warehouse 320 is a distributed storage warehouse. In particular, the servers in storage 320 are physically deployed in a distributed manner. Among other things, the application server 330 preferentially sends requests for GUID allocations from storage (or storage clusters) deployed co-locally (i.e., locally), which can greatly increase application speed and efficiency.
In an exemplary embodiment, FIG. 4 illustrates a flow diagram of a method for the production, storage, distribution, and application of identifiers in an exemplary embodiment of the disclosure. The following detailed description of each step in the technical solution shown in fig. 2 is made with reference to fig. 4:
illustratively, in step S210, in response to a first memory in a distributed storage repository receiving an allocation request of an identifier sent by a first application server communicatively connected to the first memory, it is detected whether the first memory stores an identifier to be allocated corresponding to the allocation request.
Referring to FIG. 4, in step ①, the client uses the application service and the application service used needs to consume a GUID, then in step ②, the first application server initiates an identifier allocation Request (i.e.: Request ID) to the first storage 21 in the distributed repository 320. of course, the first application server initiates an identifier allocation Request (i.e.: Request ID) to the second storage 22 in the distributed repository 320. specifically, the application server 330 preferentially sends a Request for a GUID allocation from a storage (or storage cluster) that is deployed in the same place (i.e., local), which greatly increases application speed and efficiency.
In an exemplary embodiment, the first storage 21 in the distributed storage repository receives an allocation request of an identifier sent by the first application server, and further detects whether itself (i.e., the first storage 21) stores an identifier to be allocated corresponding to the allocation request. For example, if the allocation request includes the number of GUIDs, the first memory detects whether the first memory stores a sufficient number of identifiers to be allocated. The specific detection mode is as follows:
referring to FIG. 3, the storage repository 320 includes a MA (manager agent) component 23 for collecting and analyzing GUID demand and usage to enable predicting future GUID production numbers. Further, the GUID production efficiency and production volume to the generation server 310 is dynamically regulated. And, a da (distribution agent) component 24 is disposed in each memory of the storage repository 320. The DA module 24 is used to monitor and assign GUIDs.
With continued reference to fig. 4, in step ③, the repository 320 dynamically allocates resources via the MA component 23, and in particular, determines whether a production request for an identifier needs to be sent to a production server by checking whether the first storage 21 currently connected to the first application server has an identifier to be allocated corresponding to the allocation request.
If it is detected that the identifier to be allocated corresponding to the allocation request exists in the first storage 21, in step ④, a GUID is allocated and the status of the allocated GUID is updated to "to be deleted".
Illustratively, the DA component of each memory in the repository 320 will periodically check whether there is a pending ID in the current memory. And if the state that the GUID exists is detected to be 'to-be-deleted', collecting all GUIDs to be deleted, and deleting. Therefore, the application order of GUIDs is guaranteed.
Referring to fig. 2, in step S220, if the identifier to be allocated is not stored in the first memory, a production request of the identifier is sent to a production server.
If it is detected that the identifier to be allocated corresponding to the allocation request does not exist in the first storage 21, in step ⑤, the MA component should reallocate resources to quickly respond to the allocation request (for example, it is detected that the identifier to be allocated corresponding to the allocation request exists in the second storage 22, and the GUID in the second storage 22 is allocated to the first application server), and in step ⑥, the DA component 24 in the first storage 21 issues a production request for the identifier to the production server 310.
With continued reference to FIG. 4, after the production server 310 receives the production request for the identifier, it initiates a GUID production process and, in step ⑦, it is detected whether there are any idle production processes (production resources) in the current production server.
If it is detected that there are free production resources in the current production server, then a production process is initiated to produce the GUIDs immediately at step ⑧ and the GUIDs are sent in bulk to the repository 320.
Hormones referring to fig. 2, in step S230, an identifier generated by the production server based on a unified production rule is received.
Referring to fig. 4, in step ⑨, the repository receives and stores the guid to send the received identifier to the first application server in step S240 to implement the application of the identifier by the first application server (in the embodiment, step ④ in fig. 4).
If it is detected that there is no free production resource in the current production server, then in step ⑩, wait for the production resource and issue an alert, and periodically report the usage status of the production resource.
In an exemplary embodiment, in the identifier management method provided in the present technical solution, the number of GUIDs stored in each storage in the storage warehouse is also dynamically monitored and adjusted. The description will be given taking an example of any one of the memories (first memory 21) in the storage warehouse. Specifically, the method comprises the following steps:
with continued reference to FIG. 4, at step
A first setting value (α) of the identifier storage amount of the first memory 21 is acquired, and it is detected whether the current storage amount of the first memory 21 is smaller than the first setting value α.
If the current storage capacity of the first storage 21 is less than the first set value α, step ⑥ is repeated to continue sending the production request of the identifier to the production server until the current storage capacity of the first storage 21 is greater than or equal to the first set value α.
With continued reference to FIG. 4, at step
The second setting value β is smaller than the first setting value α, a second setting value (β) of the identifier storage amount of the first memory 21 is obtained, and whether the current storage amount of the first memory 21 is smaller than the second setting value β is detected by a timer, wherein the second setting value β may be, for example, the minimum storage value of the first memory with respect to the GUID.
If the current storage amount of the first storage 21 is less than the second set value β, step ⑥ is repeated to continue sending the production request of the identifier to the production server until the current storage amount of the first storage is greater than or equal to the first set value α.
It should be noted that, when it is detected that the current storage amount of the memory (such as the first memory 21) is equal to or greater than the first set value α, the memory does not send the production request temporarily, but as the identifier (i.e., GUID) in the memory is consumed and deleted, it may be detected that the storage amount of the memory is less than the corresponding first set value α (as in the above step)) Alternatively, it may be detected that the amount of memory is less than the corresponding second set point β (as in the above step)
) Then the memory sends the production request again. It can be seen that the memory sending production request is dynamically adjusted according to whether the current memory capacity is larger than the first set value or the second set value.
In an exemplary embodiment, the above steps
And the step of
A corresponding solution may be referred to as the αβ algorithm and may specifically be provided in the MA component 23 of the repository 320, whereby the MA component 23 enables predicting future GUID production numbers by collecting and analyzing the need and usage of GUIDs in the respective storages.
In an exemplary embodiment, fig. 5 shows a flowchart of a parameter determination method in an exemplary embodiment of the disclosure.
The following example explains αβ the determination of α values in the algorithm in conjunction with fig. 5:
in an exemplary embodiment, for any target storage in the distributed storage warehouse 320, the number of identifiers in the allocation request received within a first preset time period is obtained; and setting the number of the identifiers in the allocation request as a first set value corresponding to the next first preset time.
Illustratively, the first preset time period is one day. Taking the first storage as an example, referring to fig. 5, the first storage 21 receives an allocation request from the first application server and an allocation request from the second application server. In the past day, the number of GUIDs corresponding to the allocation request of the first application server is C1 (i.e. the number of GUIDs consumed by the application service in the first application server is C1), and the number of GUIDs corresponding to the allocation request of the first application server is C2.
Specifically, the number of identifiers (C1+ C2) in the allocation request received by the first memory 21 in the past day may be acquired by the DA component of the first memory, and further, the MA component sets the number of identifiers (C1+ C2) in the allocation request to a first setting value of the first memory on the next day, that is, α 1 ═ C1+ C2., or, the number of identifiers Q in the allocation request received by the first memory in the past yesterday may be acquired by the DA component of the first memory, and the number of identifiers Q in the allocation request may be set to a first setting value α of the first memory today.
Similarly, the first setting value α 2M in the second memory is C1+ C2+ C3, and the first setting value α M in the mth memory is Cn-1+ Cn.
The following example explains αβ the determination of β values in the algorithm in conjunction with fig. 5:
in an exemplary embodiment, for any target storage in the distributed storage warehouse 320, acquiring N first set values corresponding to within a first preset time period to obtain N first set values; and setting the minimum value of the N first set values as a second set value corresponding to the next first preset time length, wherein N is a positive integer.
For example, the first preset time period is one day, the value of N may be 30, taking the first memory as an example, that is, the DA component of the first memory may obtain the number of identifiers in the allocation request received by the first memory in the past 30 days, that is, obtain the minimum value α 1 ' in the first setting value α 1 in the past 30 days, and further, the MA component may set the number of identifiers α 1 ' in the allocation request to the second setting value, that is, β 1 ═ α 1 ', of the next day of the first memory.
Similarly, the second memory corresponds to the second set value β 2 ═ α 2 ', and the mth memory corresponds to the first set value β M ═ α M'.
In an exemplary embodiment, the number p of production servers needed in the production plant on the next day can also be predicted by the ratio of the GUID consumption of the application server on the previous day to the number k of GUIDs generated per production server day.
With continued reference to fig. 5, the number p of production servers required in the production plant on the next day may be determined by the formula p ═ (α 1+ α 2+ … … α m)/k.
In the technical solution provided by the embodiment shown in fig. 5, the actual GUID consumption situation of the application service group is analyzed and counted, and then the αβ algorithm self-learns the dynamic production α and β values and the number p of production servers required in the production plant in the next preset time period (the following day), so that the intelligent production and allocation of GUIDs are realized, the problem of uneven consumption rate of identifiers by different application servers is effectively solved, and the method is favorable for saving computing resources and improving the utilization rate of identifiers.
In an exemplary embodiment, in response to a second memory being added to the distributed storage repository, obtaining a first set value of the amount of the second memory identifier stored; and sending a production request of the identifier to the production server until the current storage amount of the second storage is greater than or equal to the first set value.
Specifically, for the memory added to the repository (such as the second memory described above), when it is detected that the storage amount of the identifier (i.e., GUID) is less than the first set value corresponding thereto, a production request is sent to increase the storage amount thereof, and at the same time, when the storage amount thereof is once greater than or equal to the first set value α, the memory temporarily does not send a production request, and as the identifier (i.e., GUID) in the memory is consumed and deleted, it is possible to detect that the storage amount of the memory is less than the first set value α corresponding thereto, the memory sends a production request again.
The following steps are described with reference to fig. 4: when a new memory (denoted as secondary memory) is added to the aforementioned storage 320, at step
The DA component of the second storage then directly issues a GUID production request to the production server, and further proceeds to step ⑥ until the GUID to be allocated currently stored in the storage is greater than or equal to the first set value α corresponding to the storage.
The identifier association method provided by the technical scheme provides a distributed GUID production scheme supporting high concurrency for an insurance system, provides a uniform GUID production allocation mechanism, and solves the problem of GUID repetition. Meanwhile, aiming at different speeds and efficiencies of the insurance resource consumption GUID, a self-learning intelligent GUID production allocation scheme is provided, so that the GUID can be effectively produced and utilized in real time, and the resource waste and the GUID waste are reduced.
Those skilled in the art will appreciate that all or part of the steps implementing the above embodiments are implemented as computer programs executed by a CPU. When executed by the CPU, performs the functions defined by the above-described methods provided by the present disclosure. The program may be stored in a computer readable storage medium, which may be a read-only memory, a magnetic or optical disk, or the like.
Furthermore, it should be noted that the above-mentioned figures are only schematic illustrations of the processes involved in the methods according to exemplary embodiments of the present disclosure, and are not intended to be limiting. It will be readily understood that the processes shown in the above figures are not intended to indicate or limit the chronological order of the processes. In addition, it is also readily understood that these processes may be performed synchronously or asynchronously, e.g., in multiple modules.
The following describes an embodiment of an apparatus of the present disclosure, which may be used to perform the method for recommending a driving route of the present disclosure.
Fig. 6 shows a schematic structural diagram of a management apparatus of an identifier in an exemplary embodiment of the present disclosure. As shown in fig. 6, the identifier management apparatus 600 according to this embodiment includes: a first detection module 601, a production request sending module 602, an identifier receiving module 603, and an identifier assignment module 604.
The first detecting module 601 is configured to: responding to a first memory in a distributed storage warehouse to receive an allocation request of an identifier sent by a first application server in communication connection with the first memory, and detecting whether the first memory stores an identifier to be allocated corresponding to the allocation request;
the production request sending module 602 is configured to: if the identifier to be allocated is not stored in the first memory, sending a production request of the identifier to a production server;
the identifier receiving module 603 is configured to: receiving an identifier generated by the production server based on a uniform production rule; and the number of the first and second groups,
the identifier assigning module 604 is configured to: and sending the received identifier to the first application server to realize the application of the identifier by the first application server.
In some embodiments of the present disclosure, based on the foregoing solution, the memories in the distributed storage warehouse adopt distributed deployment on physical deployment; the first storage exists in a local system of the first application server.
In some embodiments of the present disclosure, based on the foregoing solution, the apparatus further includes: the device comprises a first set value acquisition module and a second detection module.
After the identifier receiving module 603 receives the identifier generated by the production server according to the unified production rule, the first setting value obtaining module is configured to: acquiring a first set value of the identifier storage amount of the first memory, and detecting whether the current storage amount of the first memory is smaller than the first set value; the second detection module is configured to: if the current storage amount of the first memory is smaller than the first set value, the production request of the identifier is continuously sent to the production server until the current storage amount of the first memory is larger than or equal to the first set value.
In some embodiments of the present disclosure, based on the foregoing solution, the apparatus further includes: the device comprises a second set value acquisition module and a third detection module.
Wherein, the second setting value obtaining module is configured to: acquiring a second set value of the identifier storage amount of the first memory, and detecting whether the current storage amount of the first memory is smaller than the second set value or not at regular time through a timer, wherein the second set value is smaller than the first set value;
the third detection module is configured to: if the current storage capacity of the first memory is smaller than the second set value, the production server continues to send the production request of the identifier to the production server until the current storage capacity of the first memory is larger than or equal to the first set value.
In some embodiments of the present disclosure, based on the foregoing solution, the apparatus further includes: the device comprises an identifier number acquisition module and a first setting module.
Wherein, the identifier number obtaining module is configured to: for any target memory in the distributed storage warehouse, acquiring the number of identifiers in the received allocation request within a first preset time; the first setting module is configured to: and setting the number of the identifiers in the allocation request as a first set value corresponding to the next first preset time.
In some embodiments of the present disclosure, based on the foregoing solution, the apparatus further includes: a third set value acquisition module and a second setting module.
Wherein, the third setting value obtaining module is configured to: for any target memory in the distributed storage warehouse, acquiring first set values corresponding to N first preset time lengths to obtain N first set values; the second setting module is configured to: and setting the minimum value of the N first set values as a second set value corresponding to the next first preset time.
In some embodiments of the present disclosure, based on the foregoing solution, the apparatus further includes: and an identifier deleting module.
Wherein, the deleting module is used for: after the identifier receiving module 603 transmits the received identifier to the first application server, the status flag of the identifier transmitted to the first application server is deleted.
In some embodiments of the present disclosure, based on the foregoing solution, the first setting value obtaining module is further configured to: acquiring a first set value of the second memory identifier storage amount in response to the second memory being added to the distributed storage repository; and sending a production request of the identifier to the production server until the current storage amount of the second storage is greater than or equal to the first set value.
The specific details of each module in the identifier management apparatus have been described in detail in the identifier management method, and therefore are not described herein again.
It should be noted that although in the above detailed description several modules or units of the device for action execution are mentioned, such a division is not mandatory. Indeed, the features and functionality of two or more modules or units described above may be embodied in one module or unit, according to embodiments of the present disclosure. Conversely, the features and functions of one module or unit described above may be further divided into embodiments by a plurality of modules or units.
Moreover, although the steps of the methods of the present disclosure are depicted in the drawings in a particular order, this does not require or imply that the steps must be performed in this particular order, or that all of the depicted steps must be performed, to achieve desirable results. Additionally or alternatively, certain steps may be omitted, multiple steps combined into one step execution, and/or one step broken down into multiple step executions, etc.
Through the above description of the embodiments, those skilled in the art will readily understand that the exemplary embodiments described herein may be implemented by software, or by software in combination with necessary hardware. Therefore, the technical solution according to the embodiments of the present disclosure may be embodied in the form of a software product, which may be stored in a non-volatile storage medium (which may be a CD-ROM, a usb disk, a removable hard disk, etc.) or on a network, and includes several instructions to enable a computing device (which may be a personal computer, a server, a mobile terminal, or a network device, etc.) to execute the method according to the embodiments of the present disclosure.
In an exemplary embodiment of the present disclosure, there is also provided a computer storage medium capable of implementing the above method. On which a program product capable of implementing the above-described method of the present specification is stored. In some possible embodiments, various aspects of the present disclosure may also be implemented in the form of a program product including program code for causing a terminal device to perform the steps according to various exemplary embodiments of the present disclosure described in the "exemplary methods" section above of this specification when the program product is run on the terminal device.
Referring to fig. 7, a program product 700 for implementing the above method according to an embodiment of the present disclosure is described, which may employ a portable compact disc read only memory (CD-ROM) and include program code, and may be run on a terminal device, such as a personal computer. However, the program product of the present disclosure is not limited thereto, and in this document, a readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device.
The program product described above may employ any combination of one or more readable media. The readable medium may be a readable signal medium or a readable storage medium. A readable storage medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination of the foregoing. More specific examples (a non-exhaustive list) of the readable storage medium include: an electrical connection having one or more wires, a portable disk, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.
A computer readable signal medium may include a propagated data signal with readable program code embodied therein, for example, in baseband or as part of a carrier wave. Such a propagated data signal may take many forms, including, but not limited to, electro-magnetic, optical, or any suitable combination thereof. A readable signal medium may also be any readable medium that is not a readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device.
Program code embodied on a readable medium may be transmitted using any appropriate medium, including but not limited to wireless, wireline, optical fiber cable, RF, etc., or any suitable combination of the foregoing.
Program code for carrying out operations for the present disclosure may be written in any combination of one or more programming languages, including an object oriented programming language such as Java, C + + or the like and conventional procedural programming languages, such as the "C" programming language or similar programming languages. The program code may execute entirely on the user's computing device, partly on the user's device, as a stand-alone software package, partly on the user's computing device and partly on a remote computing device, or entirely on the remote computing device or server. In the case of a remote computing device, the remote computing device may be connected to the user computing device through any kind of network, including a Local Area Network (LAN) or a Wide Area Network (WAN), or may be connected to an external computing device (e.g., through the internet using an internet service provider).
In addition, in an exemplary embodiment of the present disclosure, an electronic device capable of implementing the above method is also provided.
As will be appreciated by one skilled in the art, aspects of the present disclosure may be embodied as a system, method or program product. Accordingly, various aspects of the present disclosure may be embodied in the form of: an entirely hardware embodiment, an entirely software embodiment (including firmware, microcode, etc.) or an embodiment combining hardware and software aspects that may all generally be referred to herein as a "circuit," module "or" system.
An electronic device 800 according to this embodiment of the disclosure is described below with reference to fig. 8. The electronic device 800 shown in fig. 8 is only an example and should not bring any limitations to the functionality and scope of use of the embodiments of the present disclosure.
As shown in fig. 8, electronic device 800 is in the form of a general purpose computing device. The components of the electronic device 800 may include, but are not limited to: the at least one processing unit 810, the at least one memory unit 820, and a bus 830 that couples the various system components including the memory unit 820 and the processing unit 810.
Wherein the storage unit stores program codes, and the program codes can be executed by the processing unit 810, so that the processing unit 810 executes the steps according to various exemplary embodiments of the present disclosure described in the "exemplary method" section above in this specification. For example, the processing unit 810 may perform the following as shown in fig. 2: step S210, in response to a first memory in a distributed storage warehouse receiving an allocation request of an identifier sent by a first application server in communication connection with the first memory, detecting whether the first memory stores an identifier to be allocated corresponding to the allocation request; step S220, if the identifier to be distributed is not stored in the first memory, sending a production request of the identifier to a production server; step S220, receiving the identifier generated by the production server based on the uniform production rule; and step S240, determining the performance of the target department based on the first and second relevance tables.
For example, the processing unit 810 may further execute a management method of the identifier as shown in fig. 2, fig. 3, or fig. 4.
The storage unit 820 may include readable media in the form of volatile memory units such as a random access memory unit (RAM)8201 and/or a cache memory unit 8202, and may further include a read only memory unit (ROM) 8203.
The storage unit 820 may also include a program/utility 8204 having a set (at least one) of program modules 8205, such program modules 8205 including, but not limited to: an operating system, one or more application programs, other program modules, and program data, each of which, or some combination thereof, may comprise an implementation of a network environment.
Bus 830 may be any of several types of bus structures including a memory unit bus or memory unit controller, a peripheral bus, an accelerated graphics port, a processing unit, or a local bus using any of a variety of bus architectures.
The electronic device 800 may also communicate with one or more external devices 900 (e.g., keyboard, pointing device, bluetooth device, etc.), with one or more devices that enable a user to interact with the electronic device 800, and/or with any devices (e.g., router, modem, etc.) that enable the electronic device 800 to communicate with one or more other computing devices. Such communication may occur via input/output (I/O) interfaces 850. Also, the electronic device 800 may communicate with one or more networks (e.g., a Local Area Network (LAN), a Wide Area Network (WAN), and/or a public network, such as the internet) via the network adapter 860. As shown, the network adapter 860 communicates with the other modules of the electronic device 800 via the bus 830. It should be appreciated that although not shown, other hardware and/or software modules may be used in conjunction with the electronic device 800, including but not limited to: microcode, device drivers, redundant processing units, external disk drive arrays, RAID systems, tape drives, and data backup storage systems, among others.
Through the above description of the embodiments, those skilled in the art will readily understand that the exemplary embodiments described herein may be implemented by software, or by software in combination with necessary hardware. Therefore, the technical solution according to the embodiments of the present disclosure may be embodied in the form of a software product, which may be stored in a non-volatile storage medium (which may be a CD-ROM, a usb disk, a removable hard disk, etc.) or on a network, and includes several instructions to enable a computing device (which may be a personal computer, a server, a terminal device, or a network device, etc.) to execute the method according to the embodiments of the present disclosure.
Furthermore, the above-described figures are merely schematic illustrations of processes included in methods according to exemplary embodiments of the present disclosure, and are not intended to be limiting. It will be readily understood that the processes shown in the above figures are not intended to indicate or limit the chronological order of the processes. In addition, it is also readily understood that these processes may be performed synchronously or asynchronously, e.g., in multiple modules.
Other embodiments of the disclosure will be apparent to those skilled in the art from consideration of the specification and practice of the disclosure disclosed herein. This application is intended to cover any variations, uses, or adaptations of the disclosure following, in general, the principles of the disclosure and including such departures from the present disclosure as come within known or customary practice within the art to which the disclosure pertains. It is intended that the specification and examples be considered as exemplary only, with a true scope and spirit of the disclosure being indicated by the following claims.
Claims (11)
1. A method for managing identifiers, the method comprising:
in response to a first memory in a distributed storage warehouse receiving an allocation request of an identifier sent by a first application server in communication connection with the first memory, detecting whether the first memory stores an identifier to be allocated corresponding to the allocation request;
if the identifier to be distributed is not stored in the first memory, sending a production request of the identifier to a production server;
receiving an identifier generated by the production server based on a uniform production rule;
and sending the received identifier to the first application server to realize the application of the identifier by the first application server.
2. The method for managing identifiers according to claim 1, wherein the memories in the distributed storage repository are deployed in a distributed manner on a physical deployment; the first memory resides on a local system of the first application server.
3. Method for management of identifiers according to claim 1 or 2, characterized in that after receiving an identifier generated by said production server using unified production rules, said method further comprises:
acquiring a first set value of the identifier storage amount of the first memory, and detecting whether the current storage amount of the first memory is smaller than the first set value;
if the current storage amount of the first storage is smaller than the first set value, the production request of the identifier is continuously sent to the production server until the current storage amount of the first storage is larger than or equal to the first set value.
4. The method for managing identifiers according to claim 3, characterized in that it further comprises:
acquiring a second set value of the identifier storage amount of the first memory, and detecting whether the current storage amount of the first memory is smaller than the second set value or not at regular time through a timer, wherein the second set value is smaller than the first set value;
if the current storage amount of the first storage is smaller than the second set value, the production request of the identifier is continuously sent to the production server until the current storage amount of the first storage is larger than or equal to the first set value.
5. The method for managing identifiers according to claim 3, characterized in that it further comprises:
for any target memory in the distributed storage warehouse, acquiring the number of identifiers in the received allocation request within a first preset time;
and setting the number of the identifiers in the allocation request as a first set value corresponding to the next first preset time.
6. The method for managing identifiers according to claim 5, characterized in that it further comprises:
for any target memory in the distributed storage warehouse, acquiring first set values corresponding to N first preset time lengths to obtain N first set values;
and setting the minimum value of the N first set values as a second set value corresponding to the next first preset time length, wherein N is a positive integer.
7. Method for management of identifiers according to claim 1 or 2, characterized in that after sending the received identifier to the first application server, the method further comprises:
deleting the status flag of the identifier sent to the first application server.
8. Method for management of identifiers according to claim 1 or 2, characterized in that it further comprises:
in response to a second memory being added to the distributed storage repository, obtaining a first set value of the second memory identifier storage amount;
and sending a production request of the identifier to the production server until the current storage amount of the second storage is greater than or equal to the first set value.
9. An apparatus for managing identifiers, the apparatus comprising:
a first detection module to: in response to a first memory in a distributed storage warehouse receiving an allocation request of an identifier sent by a first application server in communication connection with the first memory, detecting whether the first memory stores an identifier to be allocated corresponding to the allocation request;
a production request sending module for: if the identifier to be allocated is not stored in the first memory, sending a production request of the identifier to a production server;
an identifier receiving module to: receiving an identifier generated by the production server based on a uniform production rule;
an identifier assignment module to: and sending the received identifier to the first application server to realize the application of the identifier by the first application server.
10. A computer storage medium on which a computer program is stored, characterized in that the computer program, when being executed by a processor, implements a method of managing an identifier according to any one of claims 1 to 8.
11. An electronic device, comprising:
a processor; and
a memory for storing executable instructions of the processor;
wherein the processor is configured to perform the method of managing an identifier of any of claims 1 to 8 via execution of the executable instructions.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911047992.2A CN110765136A (en) | 2019-10-30 | 2019-10-30 | Identifier management method, device, medium and equipment |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911047992.2A CN110765136A (en) | 2019-10-30 | 2019-10-30 | Identifier management method, device, medium and equipment |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN110765136A true CN110765136A (en) | 2020-02-07 |
Family
ID=69333214
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201911047992.2A Pending CN110765136A (en) | 2019-10-30 | 2019-10-30 | Identifier management method, device, medium and equipment |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110765136A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN117478722A (en) * | 2023-12-22 | 2024-01-30 | 深圳市一恒科电子科技有限公司 | P2P identifier allocation method, system, electronic equipment and storage medium |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CA2830835A1 (en) * | 2011-03-25 | 2012-10-04 | Whisbi Technologies, S.L. | System and method for transmitting real-time images |
| CN103812886A (en) * | 2012-11-09 | 2014-05-21 | 中国科学院上海高等研究院 | Computer cluster resource allocation system and method |
| CN110365688A (en) * | 2019-07-19 | 2019-10-22 | 湖南快乐阳光互动娱乐传媒有限公司 | Anti-stealing link method and device |
-
2019
- 2019-10-30 CN CN201911047992.2A patent/CN110765136A/en active Pending
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CA2830835A1 (en) * | 2011-03-25 | 2012-10-04 | Whisbi Technologies, S.L. | System and method for transmitting real-time images |
| CN103812886A (en) * | 2012-11-09 | 2014-05-21 | 中国科学院上海高等研究院 | Computer cluster resource allocation system and method |
| CN110365688A (en) * | 2019-07-19 | 2019-10-22 | 湖南快乐阳光互动娱乐传媒有限公司 | Anti-stealing link method and device |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN117478722A (en) * | 2023-12-22 | 2024-01-30 | 深圳市一恒科电子科技有限公司 | P2P identifier allocation method, system, electronic equipment and storage medium |
| CN117478722B (en) * | 2023-12-22 | 2024-03-15 | 深圳市一恒科电子科技有限公司 | P2P identifier allocation method, system, electronic equipment and storage medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US11570272B2 (en) | Provisioning using pre-fetched data in serverless computing environments | |
| US11755452B2 (en) | Log data collection method based on log data generated by container in application container environment, log data collection device, storage medium, and log data collection system | |
| US9342376B2 (en) | Method, system, and device for dynamic energy efficient job scheduling in a cloud computing environment | |
| CN109710405B (en) | Block chain intelligent contract management method and device, electronic equipment and storage medium | |
| US20140136717A1 (en) | Configuring cloud resources | |
| CN109614227B (en) | Task resource allocation method and device, electronic equipment and computer readable medium | |
| US8539192B2 (en) | Execution of dataflow jobs | |
| CN111045911B (en) | Performance test method, performance test device, storage medium and electronic equipment | |
| WO2024016596A1 (en) | Container cluster scheduling method and apparatus, device, and storage medium | |
| CN112017062B (en) | Resource quota distribution method and device based on guest group subdivision and electronic equipment | |
| US8819239B2 (en) | Distributed resource management systems and methods for resource management thereof | |
| US11422858B2 (en) | Linked workload-processor-resource-schedule/processing-system—operating-parameter workload performance system | |
| CN113806097A (en) | Data processing method and device, electronic equipment and storage medium | |
| US10628279B2 (en) | Memory management in multi-processor environments based on memory efficiency | |
| CN110765136A (en) | Identifier management method, device, medium and equipment | |
| CN110347546B (en) | Dynamic adjustment method, device, medium and electronic equipment for monitoring task | |
| CN109067649B (en) | Node processing method and device, storage medium and electronic equipment | |
| CN116521639A (en) | Log data processing method, electronic equipment and computer readable medium | |
| CN117093335A (en) | Task scheduling method and device for distributed storage system | |
| US8543687B2 (en) | Moving deployment of images between computers | |
| US20220043732A1 (en) | Method, device, and program product for managing computing resource in storage system | |
| CN114090201A (en) | Resource scheduling method, device, equipment and storage medium | |
| CN114116782A (en) | Distributed database resource control method and device, electronic equipment and storage medium | |
| CN113204426A (en) | Task processing method of resource pool and related equipment | |
| CN117311999B (en) | Resource scheduling method, storage medium and electronic equipment of service cluster |
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: 20200207 |