Event execution method, system and equipment for high-concurrency service scene and medium

Abstract

The invention discloses an event execution method, system and device for a high-concurrency service scene and a medium, and the method comprises the following steps: initializing inventory data, and caching all red envelope information into redis; the redis serves as a distributed dispatching center, and the request is automatically locked; performing self-adaptive unlocking according to the service duration and the service completion condition; checking the red envelope amount and the remaining amount, and caching the obtained red envelope information to redis; according to the event request type, calling a double mean value method to calculate the allocation amount of the red envelope event; in response to the completion of operation execution, releasing the data state of the data table, and releasing the lock; according to the method, the function of randomly distributing the amount of the red envelope can be intuitively and quickly realized, the scheme of randomly grabbing the red envelope is realized, the development cost is reduced, and the method is suitable for professional application of other high-concurrency mass data processing, overcomes the defects in the prior art and has relatively high application value.

Description

Technical Field

[0001] The present invention relates to the technical field of engineering project software development, and in particular to an event execution method, system, device and medium for high-concurrency business scenarios. Background Art

[0002] In the development of the software industry, various social products are becoming increasingly popular. In order to obtain more users and traffic, major platforms have launched new ways of playing, such as grabbing red envelopes, flash sales, and promotional activities. The red envelope function is a way to promote products, but it is highly homogenized. If it is necessary to use the red envelope rain method to attract traffic, the system design needs to meet the requirements of three highs (high availability, high concurrency, and high performance) for the majority of C-end users.

[0003] At present, the methods to solve the high concurrency problem mainly include using spin mutex locks, CAS optimistic locks, pessimistic locks and optimistic locks at the database level, and relying on the sequential execution mechanism of the database execution engine. However, the above solutions all have certain defects, as follows: (1) Using the synchronized keyword is invalid in a distributed environment. synchronized is a keyword in Java that is used to protect shared resources in a single JVM. In a distributed environment, multiple service instances cannot be synchronized through synchronized because the instances cannot directly share the locks in the JVM. synchronized can cause performance problems, especially in high concurrency situations, where lock contention may become a bottleneck.

[0004] (2) Pessimistic locking: During the data processing process, the data is locked until the processing is completed; this method can avoid conflicts caused by concurrent access, but may reduce the system's concurrent processing capabilities.

[0005] (3) Direct access to the database solution uses the database table lock mechanism. However, high-concurrency access can easily lead to memory overflow, causing the cluster service to crash directly. This solution is suitable for situations where the concurrency is not high. Summary of the invention

[0006] The object of the present invention is to provide an event execution method, system, device and medium for high-concurrency business scenarios, thereby solving all or one of the above-mentioned problems existing in the prior art.

[0007] In order to solve the above technical problems, the specific technical solutions of the present invention are as follows: In one aspect, the present invention provides an event execution method for a high-concurrency business scenario, comprising the following steps: Initialization steps: Initialize inventory data and cache all red envelope information in redis; Locking steps: Use redis as a distributed scheduling center to automatically lock requests and adaptively unlock based on service duration and service completion status; Verification steps: Verify the amount of the red envelope and the remaining amount, and cache the obtained red envelope information in redis; Amount classification steps: According to the event request type, the double mean method is called to calculate the allocation amount of the red envelope event; Unlocking steps: In response to the completion of the operation, the data state of the data table is released and the lock is released.

[0008] In one implementation manner, all the red envelope information includes: unallocated red envelope information and allocated red envelope information.

[0009] In one implementation manner, the adaptive unlocking according to the service duration and service completion status includes: In response to long business hours, the lock is automatically renewed; In response to the locked business operation being completed, the current lock is not renewed; In response to not manually unlocking, the lock is automatically deleted after thirty seconds.

[0010] In one implementation manner, the adaptive unlocking according to the service duration and service completion status further includes: In response to multiple requests, the first request is automatically locked for thirty seconds, and all requests except the first request enter a blocking wait state; In response to the completion of the locked business operation, call lock.unlock() to unlock; In response to an exception or downtime in the business process, the lock is automatically deleted after thirty seconds.

[0011] In one embodiment, the method of calculating the allocation amount of the red envelope event by calling the double mean method according to the event request type includes: In response to the event request type being a lucky red envelope request, a random number is generated according to the current remaining amount; red envelope information is obtained from redis to verify the remaining amount of the red envelope; If the remaining number of red envelopes is equal to zero, the remaining amount will be assigned to the last red envelope; If the remaining number of red envelopes is not zero, the current red envelope distribution amount is calculated according to the double mean method.

[0012] In one embodiment, the calculation formula of the double mean method is: The amount of money snatched each time in the red envelope event = random interval [p, m / n×2-p]; Among them, m is the remaining red envelope amount, n is the remaining number of people, and p is the minimum amount each person can get.

[0013] In one embodiment, the event execution method for high-concurrency business scenarios further includes: In response to an exception occurring during locking, verifying the remaining amount, or obtaining the red envelope amount, corresponding exception handling and data rollback operations are performed.

[0014] On the other hand, the present invention also provides an event execution system for a high-concurrency business scenario, comprising: Initialization module, used to: initialize inventory data and cache all red envelope information in redis; The locking module is used to: use redis as a distributed scheduling center to automatically lock requests; and adaptively unlock based on business duration and business completion status; The verification module is used to verify the amount of the red envelope and the remaining amount, and cache the obtained red envelope information in redis; The amount classification module is used to: calculate the allocation amount of the red envelope event by calling the double mean method according to the event request type; The unlocking module is used to: in response to the completion of the operation, release the data state of the data table and release the lock.

[0015] On the other hand, the present invention also provides a computer-readable storage medium, on which a computer program is stored, and when the computer program is executed by a processor, the steps of the event execution method for the high-concurrency business scenario are implemented.

[0016] On the other hand, the present invention further provides a computer device, comprising a processor, a communication interface, a memory and a communication bus, wherein the processor, the communication interface and the memory communicate with each other via the communication bus; wherein: The memory is used to store computer programs; The processor is used to execute the steps of the event execution method for the high-concurrency business scenario by running the program stored in the memory.

[0017] The beneficial effects of the technical solution of the present invention are: 1. The event execution method for high-concurrency business scenarios described in the present invention can realize the function of randomly allocating red envelope amounts intuitively and quickly, realize the solution of randomly grabbing red envelopes, reduce development costs, and is suitable for other professional applications of massive data processing under high concurrency, which makes up for the defects of the existing technology and has high application value.

[0018] 2. The event execution system for high-concurrency business scenarios described in the present invention can realize the event execution method for high-concurrency business scenarios described in the present invention through the mutual cooperation of system modules.

[0019] 3. The computer-readable storage medium described in the present invention can guide the system modules to cooperate, thereby realizing the event execution method for high-concurrency business scenarios described in the present invention, and the computer-readable storage medium described in the present invention also effectively improves the operability of the event execution method for high-concurrency business scenarios.

[0020] 4. The computer device described in the present invention can store and execute the computer-readable storage medium, thereby realizing the event execution method for high-concurrency business scenarios described in the present invention. BRIEF DESCRIPTION OF THE DRAWINGS

[0021] In order to more clearly illustrate the specific implementation methods of the present invention or the technical solutions in the prior art, the drawings required for use in the specific implementation methods or the description of the prior art will be briefly introduced below. Obviously, the drawings described below are some implementation methods of the present invention. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying creative work.

[0022] Figure 1 It is a flowchart of the event execution method for the high-concurrency business scenario described in Example 1 of the present invention; Figure 2 It is a logical flow diagram of the event execution method for the high-concurrency business scenario described in Example 1 of the present invention; Figure 3 It is a partial code diagram of step S300 in the event execution method for a high-concurrency business scenario described in Example 1 of the present invention; Figure 4 It is a partial code diagram of step S200 in the event execution method for a high-concurrency business scenario described in Example 1 of the present invention; Figure 5 It is a partial code diagram of step S400 in the event execution method for a high-concurrency business scenario described in Example 1 of the present invention; Figure 6 It is a schematic diagram of the architecture of the event execution system for the high-concurrency business scenario described in Example 2 of the present invention; Figure 7 is a schematic diagram of the structure of the computer device described in Example 4 of the present invention; The symbols in the accompanying drawings are explained as follows: 1501, processor; 1502, communication interface; 1503, memory; 1504, communication bus. DETAILED DESCRIPTION

[0023] The preferred embodiments of the present invention are described in detail below in conjunction with the accompanying drawings so that the advantages and features of the present invention can be more easily understood by those skilled in the art, thereby making a clearer and more definite definition of the protection scope of the present invention.

[0024] In the description of the present invention, it should be noted that the embodiments described in the present invention are only part of the embodiments of the present invention, rather than all of the embodiments; based on the embodiments in the present invention, all other embodiments obtained by ordinary technicians in the field without making creative work are within the scope of protection of the present invention.

[0025] The terms "first", "second", etc. in the specification and claims of this article and the above-mentioned drawings are used to distinguish similar objects, and are not necessarily used to describe a specific order or sequence. It should be understood that the data used in this way can be interchanged where appropriate, so that the embodiments of this article described here can be implemented in an order other than those illustrated or described here. In addition, the terms "including" and "having" and any variations thereof are intended to cover non-exclusive inclusions, for example, a process, method, device, product or equipment that includes a series of steps or units is not necessarily limited to those steps or units clearly listed, but may include other steps or units that are not clearly listed or inherent to these processes, methods, products or equipment. Example 1

[0026] This embodiment provides an event execution method for a high-concurrency business scenario, such as Figure 1~Figure 5 As shown, the following steps are included: The event referred to in this method is the "red envelope grabbing event".

[0027] The core functions of this method are: using distributed locks, implementing distributed locks through distributed cache systems such as Redis, ensuring that only one request can successfully obtain red envelopes in a concurrent situation, and other requests are blocked; by setting a unique lock identifier, when a request obtains the lock, other requests need to wait until the lock is released; the API lock mechanism provided by Redisson, the automatic renewal of the lock, if the business time is long, the lock will be automatically renewed for a new 30s during the operation, there is no need to worry about the lock automatically expiring due to the long business time, as long as the locked business is completed, the current lock will not be renewed, even if it is not manually unlocked, the lock will be automatically deleted after 30s by default to avoid deadlock; the lucky red envelope share uses the double mean method to generate a random number in the interval [0, current remaining amount] to solve the process of grabbing red envelopes; based on the above scheme, the function of randomly allocating red envelope amounts can be intuitively and quickly realized, the random red envelope grabbing scheme is realized, the development cost is reduced, and it is suitable for other professional applications of massive data processing under high concurrency. The specific steps are as follows: S100, initialization step: In this step, the inventory data is initialized, and all red envelope information (including unallocated red envelope information and allocated red envelope information) is cached in the memory; the reading and writing speed of the red envelope information is improved through the memory reading and writing mechanism; Specifically, during the initialization process, the code for importing dependencies is as follows: <dependency> <groupid> org.redisson< / groupid> <artifactid> redisson< / artifactid> <version> 3.23.5< / version> < / dependency> ; Specifically, during the initialization process, the application.yaml configuration code is as follows: spring: redis: host: 127.0.0.1 port: 6379 password: lettuce: pool: max-active: 8 max-idle: 8 min-idle: 0 max-wait: 1000ms.

[0028] S200, locking steps: In this step, redis is used as a distributed scheduling center to automatically lock the current request for 30 seconds. If the business time is long, the lock is automatically renewed. As long as the locked business is completed, the current lock will not be renewed. Even if it is not manually unlocked, the lock is automatically deleted after 30 seconds by default to avoid deadlock.

[0029] Specifically, the logic of requesting to obtain the red envelope amount is as follows: when a request comes in, the first request redisson.getLock(lock_key) is automatically locked for 30 seconds, and other requests enter blocking waiting. As long as the locked business is completed, call lock.unlock() to unlock it. If the process is abnormal or crashes, the lock is automatically deleted after 30 seconds by default to avoid deadlock. The specific code is as follows Figure 4 shown.

[0030] S300, verification steps: In this step, the amount of the red envelope and the remaining amount are verified; Specifically, the specific logic of sending red envelopes, verifying the amount and quantity of red envelopes, and caching the red envelope information in redis are as follows Figure 3 shown.

[0031] S400, amount classification steps: In this step, the current requested red envelope classification amount is obtained using the double mean method, and the formula is as follows: the amount grabbed each time = random interval [p, m / n×2-p] yuan (the remaining red envelope amount is m yuan, the remaining number of people is n, and p is the minimum amount each person can get).

[0032] Specifically, the lucky red envelope points use the double mean method to generate a random number in the interval [0, current remaining amount] to solve the process of grabbing red envelopes: first get the specific information of the red envelope from redis, and then check the remaining number of red envelopes. If the remaining number of red envelopes is equal to 0, the remaining amount is all assigned to the last red envelope. If not, there is not a red envelope left, then the amount of the current red envelope allocation is calculated according to the algorithm (double mean method). The specific code for the above operation is as follows: Figure 5 shown.

[0033] S500, unlocking steps: In this step, the lock is released. After the operation is completed, the data state of the data table needs to be released to release the lock.

[0034] S600, exception handling steps: In this step, if an exception occurs during locking, verifying the remaining amount, or obtaining the red envelope amount, corresponding exception handling and data rollback operations are required.

[0035] It should be noted that the above examples are only for explaining the present invention and cannot limit the protection scope of the present invention. Example 2

[0036] This embodiment is based on the same inventive concept as the event execution method for a high-concurrency business scenario described in Example 1, and provides an event execution system for a high-concurrency business scenario, such as Figure 6 As shown, including: Initialization module, used to: initialize inventory data and cache all red envelope information in redis; The locking module is used to: use redis as a distributed scheduling center to automatically lock requests; and adaptively unlock based on business duration and business completion status; The verification module is used to verify the amount of the red envelope and the remaining amount, and cache the obtained red envelope information in redis; The amount classification module is used to: calculate the allocation amount of the red envelope event by calling the double mean method according to the event request type; The unlocking module is used to: in response to the completion of the operation, release the data state of the data table and release the lock. Example 3

[0037] This embodiment provides a computer-readable storage medium, including: The storage medium is used to store computer software instructions used to implement the event execution method for the high-concurrency business scenario described in the above-mentioned Example 1, which includes a program for executing the above-mentioned program set for the event execution method for the high-concurrency business scenario; specifically, the executable program can be built into the event execution system for the high-concurrency business scenario described in Example 2, so that the event execution system for the high-concurrency business scenario can implement the event execution method for the high-concurrency business scenario described in Example 1 by executing the built-in executable program.

[0038] In addition, the computer-readable storage medium of this embodiment may adopt any combination of one or more computer-readable storage media, wherein the computer-readable storage medium includes electrical, optical, electromagnetic, infrared or semiconductor systems, devices or components, or any combination thereof. Example 4

[0039] This embodiment provides an electronic device, such as Figure 7 As shown, the electronic device may include: a processor 1501 , a communication interface 1502 , a memory 1503 and a communication bus 1504 , wherein the processor 1501 , the communication interface 1502 , and the memory 1503 communicate with each other via the communication bus 1504 .

[0040] Memory 1503, used for storing computer programs; The processor 1501 is used to implement the steps of the event execution method for the high-concurrency business scenario described in the above-mentioned embodiment 1 when executing the computer program stored in the memory 1503.

[0041] As an embodiment of the present invention, the communication bus mentioned in the above terminal can be a Peripheral Component Interconnect (PCI) bus or an Extended Industry Standard Architecture (EISA) bus. The communication bus can be divided into an address bus, a data bus, a control bus, etc. For ease of representation, Figure 7 Only one thick line is used in the diagram, but this does not mean that there is only one bus or only one type of bus.

[0042] As an implementation mode of the present invention, the communication interface is used for communication between the above-mentioned terminal and other devices.

[0043] As an embodiment of the present invention, the memory may include a random access memory (RAM) or a non-volatile memory, such as at least one disk memory. Optionally, the memory may also be at least one storage device located away from the aforementioned processor.

[0044] As an embodiment of the present invention, the above-mentioned processor can be a general-purpose processor, including a central processing unit (CPU), a network processor (NP), etc.; it can also be a digital signal processor (DSP), an application specific integrated circuit (ASIC), a field programmable gate array (FPGA) or other programmable logic devices, discrete gates or transistor logic devices, discrete hardware components.

[0045] Different from the existing technology, the event execution method, system, device and medium of the present application for high-concurrency business scenarios can intuitively and quickly realize the function of randomly allocating red envelope amounts, realize the random red envelope grabbing solution, reduce development costs, and are suitable for other professional applications of massive data processing under high concurrency, which makes up for the shortcomings of the existing technology and has high application value.

[0046] It should be understood that in the various embodiments of this document, the size of the serial numbers of the above-mentioned processes does not mean the order of execution. The execution order of each process should be determined by its function and internal logic, and should not constitute any limitation on the implementation process of the embodiments of this document.

[0047] It should also be understood that in the embodiments of this article, the term "and / or" is only a description of the association relationship of the associated objects, indicating that three relationships may exist. For example, A and / or B can represent: A exists alone, A and B exist at the same time, and B exists alone. In addition, the character " / " in this article generally indicates that the associated objects before and after are in an "or" relationship.

[0048] Those of ordinary skill in the art will appreciate that the units and algorithm steps of each example described in conjunction with the embodiments disclosed herein can be implemented in electronic hardware, computer software, or a combination of the two. In order to clearly illustrate the interchangeability of hardware and software, the composition and steps of each example have been generally described in terms of function in the above description. Whether these functions are performed in hardware or software depends on the specific application and design constraints of the technical solution. Professional and technical personnel can use different methods to implement the described functions for each specific application, but such implementation should not be considered to be beyond the scope of this article.

[0049] Those skilled in the art can clearly understand that, for the convenience and brevity of description, the specific working processes of the systems, devices and units described above can refer to the corresponding processes in the aforementioned method embodiments and will not be repeated here.

[0050] In the several embodiments provided herein, it should be understood that the disclosed systems, devices and methods can be implemented in other ways. For example, the device embodiments described above are only schematic, for example, the division of the units is only a logical function division, and there may be other division methods in actual implementation, such as multiple units or components can be combined or integrated into another system, or some features can be ignored or not executed. In addition, the mutual coupling or direct coupling or communication connection shown or discussed can be an indirect coupling or communication connection through some interfaces, devices or units, or can be electrical, mechanical or other forms of connection.

[0051] The units described as separate components may or may not be physically separated, and the components shown as units may or may not be physical units, that is, they may be located in one place or distributed on multiple network units. Some or all of the units may be selected according to actual needs to achieve the purpose of the embodiments of this article.

[0052] In addition, each functional unit in each embodiment of this invention may be integrated into one processing unit, or each unit may exist physically separately, or two or more units may be integrated into one unit. The above integrated unit may be implemented in the form of hardware or in the form of software functional unit.

[0053] If the integrated unit is implemented in the form of a software functional unit and sold or used as an independent product, it can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of this article is essentially or the part that contributes to the prior art, or all or part of the technical solution can be embodied in the form of a software product, and the computer software product is stored in a storage medium, including a number of instructions to enable a computer device (which can be a personal computer, a server, or a network device, etc.) to perform all or part of the steps of the method described in each embodiment of this article. The aforementioned storage medium includes: U disk, mobile hard disk, read-only memory (ROM, Read-Only Memory), random access memory (RAM, Random Access Memory), disk or optical disk and other media that can store program codes.

[0054] The above descriptions are merely embodiments of the present invention and are not intended to limit the patent scope of the present invention. Any equivalent structure or equivalent process transformation made using the contents of the present invention specification and drawings, or directly or indirectly applied in other related technical fields, are also included in the patent protection scope of the present invention.

Claims

1. An event execution method for a high-concurrency business scenario, characterized in that: The following steps are involved: Initialization steps: Initialize inventory data and cache all red envelope information in redis; Locking steps: Use redis as a distributed scheduling center to automatically lock requests and adaptively unlock based on service duration and service completion status; Verification steps: Verify the amount of the red envelope and the remaining amount, and cache the obtained red envelope information in redis; Amount classification steps: According to the event request type, the double mean method is called to calculate the allocation amount of the red envelope event; Unlocking steps: In response to the completion of the operation, the data state of the data table is released and the lock is released.

2. The event execution method for high-concurrency business scenarios according to claim 1 is characterized in that: All the red envelope information includes: unallocated red envelope information and allocated red envelope information.

3. The event execution method for high-concurrency business scenarios according to claim 1 is characterized in that: The adaptive unlocking according to the service duration and service completion status includes: In response to long business hours, the lock is automatically renewed; In response to the locked business operation being completed, the current lock is not renewed; In response to not manually unlocking, the lock is automatically deleted after thirty seconds.

4. The event execution method for high-concurrency business scenarios according to claim 3 is characterized in that: The adaptive unlocking according to the service duration and service completion status also includes: In response to multiple requests, the first request is automatically locked for thirty seconds, and all requests except the first request enter a blocking wait state; In response to the completion of the locked business operation, call lock.unlock() to unlock; In response to an exception or downtime in the business process, the lock is automatically deleted after thirty seconds.

5. The event execution method for high-concurrency business scenarios according to claim 4 is characterized in that: The method of calculating the allocation amount of the red envelope event by calling the double mean method according to the event request type includes: In response to the event request type being a lucky red envelope request, a random number is generated according to the current remaining amount; red envelope information is obtained from redis to verify the remaining amount of the red envelope; If the remaining number of red envelopes is equal to zero, the remaining amount will be assigned to the last red envelope; If the remaining number of red envelopes is not zero, the current red envelope distribution amount is calculated according to the double mean method.

6. The event execution method for high-concurrency business scenarios according to claim 5 is characterized in that: The calculation formula of the double mean method is: The amount of money snatched each time in the red envelope event = random interval [p, m / n×2-p]; Among them, m is the remaining red envelope amount, n is the remaining number of people, and p is the minimum amount each person can get.

7. The event execution method for high-concurrency business scenarios according to claim 1, characterized in that: The event execution method for the high-concurrency business scenario also includes: In response to an exception occurring during locking, verifying the remaining amount, or obtaining the red envelope amount, corresponding exception handling and data rollback operations are performed.

8. An event execution system for high-concurrency business scenarios, characterized in that: include: Initialization module, used to: initialize inventory data and cache all red envelope information in redis; The locking module is used to: use redis as a distributed scheduling center to automatically lock requests; and adaptively unlock based on business duration and business completion status; The verification module is used to verify the amount of the red envelope and the remaining amount, and cache the obtained red envelope information in redis; The amount classification module is used to: calculate the allocation amount of the red envelope event by calling the double mean method according to the event request type; The unlocking module is used to: in response to the completion of the operation, release the data state of the data table and release the lock.

9. A computer-readable storage medium, characterized in that: The computer-readable storage medium stores a computer program, and when the computer program is executed by the processor, the steps of the event execution method for the high-concurrency business scenario described in any one of claims 1 to 7 are implemented.

10. A computer device, characterized in that: It includes a processor, a communication interface, a memory and a communication bus, wherein the processor, the communication interface and the memory communicate with each other through the communication bus; wherein: The memory is used to store computer programs; The processor is used to execute the steps of the event execution method for a high-concurrency business scenario in any one of claims 1 to 7 by running the program stored in the memory.

Images