CN113806102A - Message queue processing method and device and computing equipment - Google Patents
Message queue processing method and device and computing equipment Download PDFInfo
- Publication number
- CN113806102A CN113806102A CN202010544867.9A CN202010544867A CN113806102A CN 113806102 A CN113806102 A CN 113806102A CN 202010544867 A CN202010544867 A CN 202010544867A CN 113806102 A CN113806102 A CN 113806102A
- Authority
- CN
- China
- Prior art keywords
- message queue
- processing
- preset
- determining
- consumption
- 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.)
- Granted
Links
- 238000003672 processing method Methods 0.000 title claims abstract description 27
- 238000000034 method Methods 0.000 claims abstract description 33
- 238000004891 communication Methods 0.000 claims description 15
- 230000004069 differentiation Effects 0.000 description 10
- 230000008569 process Effects 0.000 description 7
- 230000007246 mechanism Effects 0.000 description 6
- 238000004458 analytical method Methods 0.000 description 5
- 230000008859 change Effects 0.000 description 5
- 230000008447 perception Effects 0.000 description 5
- 238000004590 computer program Methods 0.000 description 4
- 238000010586 diagram Methods 0.000 description 4
- 230000009467 reduction Effects 0.000 description 3
- 230000009286 beneficial effect Effects 0.000 description 1
Images
Classifications
-
- 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/54—Interprogram communication
- G06F9/546—Message passing systems or structures, e.g. queues
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F2209/00—Indexing scheme relating to G06F9/00
- G06F2209/54—Indexing scheme relating to G06F9/54
- G06F2209/548—Queue
Landscapes
- Engineering & Computer Science (AREA)
- Software Systems (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
- Debugging And Monitoring (AREA)
Abstract
The embodiment of the invention relates to the technical field of computers, and discloses a message queue processing method, a message queue processing device and computing equipment. The method comprises the following steps: acquiring index data of a message queue; determining the queuing time of the message queue according to the index data; determining the processing level of the message queue according to the queuing time and the priority information corresponding to the message queue; if the processing level is greater than or equal to a preset processing level threshold, determining whether the consumption capacity of the consumer of the message queue is reduced; if the consumption capability of the consumer of the message queue is not reduced, carrying out capacity expansion processing on the message queue; and if the consumption capability of the consumer of the message queue is determined to be reduced, restarting the message queue. Through the mode, the message backlog processing efficiency can be improved.
Description
Technical Field
The embodiment of the invention relates to the technical field of computers, in particular to a message queue processing method, a message queue processing device and computing equipment.
Background
As the traffic volume increases, more and more services including a part of services with real-time requirements access to the message queue processing mechanism, and therefore, the message queue processing efficiency has a differentiated requirement based on the application real-time. Especially, under the environment of large-scale operators with various applications coexisting, the method is very important for quickly finding and solving the backlog problem of each independent application message.
The current message queue processing method is mainly characterized in that a uniform threshold value is preset, when the backlog of queue messages exceeds the threshold value, an alarm is given, and then a corresponding processing mode is manually adopted according to the application condition. The method lacks differentiation consideration of application dimension, and is easy to cause false alarm, so that the processing efficiency of message backlog is low.
Disclosure of Invention
In view of the foregoing problems, embodiments of the present invention provide a message queue processing method, an apparatus, and a computing device, which can improve the processing efficiency of message backlog.
According to a first aspect of the embodiments of the present invention, there is provided a message queue processing method, including: acquiring index data of a message queue; determining the queuing time of the message queue according to the index data; determining the processing level of the message queue according to the queuing time and the priority information corresponding to the message queue; if the processing level is greater than or equal to a preset processing level threshold, determining whether the consumption capacity of the consumer of the message queue is reduced; if the consumption capability of the consumer of the message queue is not reduced, carrying out capacity expansion processing on the message queue; and if the consumption capability of the consumer of the message queue is determined to be reduced, restarting the message queue.
In an optional mode, the index data comprises processing records and dequeue amount of the message queue;
if the processing level is greater than or equal to a preset processing level threshold, determining whether the consumption capacity of the consumer of the message queue is reduced, specifically including: acquiring the processing level within the latest preset times of the message queue; when the processing levels within the latest preset times are all smaller than a preset processing level threshold, determining whether the message queue is processed within a first preset time or not according to the processing record; if the message queue is determined not to be processed within the first preset time, determining the current consumption speed of the message queue according to the dequeue amount, and determining whether the ratio of the current consumption speed to a preset consumption speed peak value is greater than a preset ratio threshold value; if the ratio of the current consumption speed to a preset consumption speed peak value is larger than or equal to the preset ratio threshold value, determining that the consumption capacity of the consumers of the message queue is not reduced; and if the ratio of the current consumption speed to a preset consumption speed peak value is smaller than the preset ratio threshold value, determining that the consumption capacity of the consumers of the message queue is reduced.
In an optional manner, if the processing level is greater than or equal to a preset processing level threshold, determining whether the consumption capability of the consumer of the message queue is reduced further includes: determining a historical dequeuing speed peak value of the message queue according to the dequeuing amount; and updating the preset consumption speed peak value according to the historical dequeuing speed peak value.
In an optional manner, if it is determined that the consumption capability of the consumer of the message queue is not reduced, performing capacity expansion processing on the message queue specifically includes: determining whether the message queue is in an expansion state or not according to the processing record; if the message queue is determined to be in the capacity expansion state, performing additional capacity expansion processing on the message queue; and if the message queue is determined not to be in the capacity expansion state, performing capacity expansion processing on the message queue.
In an optional manner, the metric data further includes an amount of enqueue of the message queue; if it is determined that the consumption capability of the consumer of the message queue is reduced, performing restart processing on the message queue, specifically including: determining whether the message queue carries out capacity expansion processing or restarting processing within second preset time or not according to the processing record; if the message queue is determined not to be subjected to capacity expansion processing and restarting processing within the second preset time, determining the current enqueuing speed of the message queue according to the enqueuing amount, and determining whether the current enqueuing speed is greater than a preset enqueuing speed threshold value; if the current enqueuing speed is determined to be greater than a preset enqueuing speed threshold value, carrying out restarting processing and capacity expansion processing on the message queue; and if the current enqueuing speed is determined to be less than or equal to the preset enqueuing speed threshold, restarting the message queue.
In an optional mode, the index data comprises dequeue amount and backlog amount of the message queue; determining a queuing time of the message queue according to the index data specifically includes: determining the average dequeuing amount per second of the previous minute according to the dequeuing amount, and determining the average dequeuing amount per second as the current consumption speed; and dividing the backlog quantity by the current consumption speed to obtain the queuing time length.
In an optional manner, the determining the processing level of the message queue according to the queuing time and the priority information corresponding to the message queue specifically includes:
determining priority information corresponding to a message queue according to a preset corresponding relation between the message queue and the priority information;
determining the processing level according to the following formula:
G＝S-(T/K)*W
wherein G is the processing level, S is a preset original processing level, T is the queuing duration, K is a preset parameter, and W is priority information corresponding to the message queue.
According to a second aspect of the embodiments of the present invention, there is provided a message queue processing apparatus, including: the acquisition module is used for acquiring index data of the message queue; the determining module is used for determining the queuing time of the message queue according to the index data and determining the processing level of the message queue according to the queuing time and the priority information corresponding to the message queue; the judging module is used for determining whether the consumption capacity of the consumers of the message queue is reduced or not if the processing level is greater than or equal to a preset processing level threshold; and the processing module is used for carrying out capacity expansion processing on the message queue if the consumption capacity of the consumer of the message queue is not reduced, and carrying out restart processing on the message queue if the consumption capacity of the consumer of the message queue is reduced.
According to a third aspect of embodiments of the present invention, there is provided a computing device comprising: the system comprises a processor, a memory, a communication interface and a communication bus, wherein the processor, the memory and the communication interface complete mutual communication through the communication bus; the memory is used for storing at least one executable instruction, and the executable instruction enables the processor to execute the operation of the message queue processing method.
According to a fourth aspect of the embodiments of the present invention, there is provided a computer-readable storage medium, in which at least one executable instruction is stored, and when the executable instruction is executed on a computing device, the computing device executes the message queue processing method described above.
The embodiment of the invention acquires index data of a message queue, determines queuing time of the message queue according to the index data, determines processing level of the message queue according to the queuing time and priority information corresponding to the message queue, determines whether the consumption capacity of consumers of the message queue is reduced or not if the processing level is greater than or equal to a preset processing level threshold value, performs capacity expansion processing on the message queue if the consumption capacity of the consumers of the message queue is not reduced, restarts the message queue if the consumption capacity of the consumers of the message queue is reduced, can combine a key index of the message queuing time with differentiated requirements of service real-time corresponding to each message queue to obtain reasonable message queue score, analyzes a low-grade message queue according to the message queue score result, and judges that the message queue is a problem caused by increased queuing amount or reduced consumption capacity of the consumers, therefore, corresponding processing is carried out, the problem of rapid positioning can be solved by automatically analyzing the supply and demand change of consumption capacity, rapid processing is realized by automatic processing restart and expansion, and the processing efficiency of message backlog is improved.
Furthermore, an alarm and processing mechanism based on application requirements can be realized, the difference is further applied to tolerance, differential alarm and processing of complex and various it application queue problems are solved, meanwhile, the problem that the abnormity is solved before the customer perception is solved by utilizing differential application tolerance configuration, and the user experience is improved.
Furthermore, various processing schemes can be provided, optimal decisions can be given, automatic processing can be realized, the method is not limited to a single scene of the availability of the consumer process, and the whole method and the device can cover all the current message queue exception problems.
The foregoing description is only an overview of the technical solutions of the embodiments of the present invention, and the embodiments of the present invention can be implemented according to the content of the description in order to make the technical means of the embodiments of the present invention more clearly understood, and the detailed description of the present invention is provided below in order to make the foregoing and other objects, features, and advantages of the embodiments of the present invention more clearly understandable.
Drawings
The drawings are only for purposes of illustrating embodiments and are not to be construed as limiting the invention. Also, like reference numerals are used to refer to like parts throughout the drawings. In the drawings:
fig. 1 is a flowchart illustrating a message queue processing method according to an embodiment of the present invention;
fig. 2 is a flowchart illustrating a message queue processing method according to another embodiment of the present invention;
fig. 3 is a schematic structural diagram illustrating a message queue processing apparatus according to an embodiment of the present invention;
fig. 4 is a schematic structural diagram of a computing device provided in an embodiment of the present invention.
Detailed Description
Exemplary embodiments of the present invention will be described in more detail below with reference to the accompanying drawings. While exemplary embodiments of the invention are shown in the drawings, it should be understood that the invention can be embodied in various forms and should not be limited to the embodiments set forth herein.
The inventor analyzes the prior art and finds that the current message queue processing method mainly sets a uniform threshold value in advance, alarms when the backlog of queue messages exceeds the threshold value, and then adopts a corresponding processing mode manually according to the application condition. However, the messages are allowed to be asynchronous, and the method lacks differentiation consideration of application dimensions, is too single, and is easy to cause false alarm, so that the processing efficiency of message backlog is low. In addition, there is a message queue processing method for performing an alarm based on service awareness, which can have directionality on the result level, but the service awareness is not necessarily caused by the queue problem, and it is still necessary to check the problems in the database, the host, the network, and the like, so that it takes much time.
Based on this, the embodiment of the invention provides a message queue processing method, a message queue processing device and a computing device, which can improve the processing efficiency of message backlog.
Specifically, the embodiments of the present invention will be further explained below with reference to the drawings.
It should be understood that the following examples are provided by way of illustration and are not intended to limit the invention in any way to the particular embodiment disclosed.
Fig. 1 is a flowchart illustrating a message queue processing method according to an embodiment of the present invention. The method may be applied to a computing device. As shown in fig. 1, the method includes:
The metric data of the message queue may include one or more of an amount of enqueue, an amount of dequeue, an amount of backlog, producer information, consumer information, and the like of the message queue, among others. The enqueue amount refers to the number of messages entering the message queue; dequeue amount refers to the number of messages already processed in the message queue; the backlog quantity refers to the number of messages to be processed in the message queue; producer/consumer information refers to address information, port information, instance names, etc. of the producer/consumer. The producer may refer to a server sending a message, and the consumer may refer to a server processing a message.
Acquiring index data of the message queue may specifically include: and periodically collecting index data of the message queue from the message middleware according to the instance information of the message middleware. The instance information of the message middleware may include: address information, port information, instance coding information, system attribution information, etc., so that index data of a specific message queue can be collected from specific message middleware.
In some embodiments, after step 110, the method may further comprise: storing the index data in a database. The index data is written into the database, and the index data can be persisted for analysis and processing.
And step 120, determining the queuing time of the message queue according to the index data.
Specifically, step 120 may include:
and step 121, determining the average dequeue amount per second in the previous minute according to the dequeue amount, and determining the average dequeue amount per second as the current consumption speed.
Wherein, the total dequeuing amount of the previous minute is obtained, the total dequeuing amount of the previous minute is divided by 60 seconds, and the average dequeuing amount per second of the previous minute is determined, so that the average dequeuing amount per second can be determined as the current consumption speed.
And step 122, dividing the backlog quantity by the current consumption speed to obtain the queuing time length.
The queuing time may be determined according to the following formula:
T＝S/V
wherein T is the queuing time, S is the current backlog, and V is the current consumption speed.
And step 130, determining the processing level of the message queue according to the queuing time and the priority information corresponding to the message queue.
Specifically, step 130 includes:
step 131, determining priority information corresponding to the message queue according to a preset corresponding relationship between the message queue and the priority information.
Different message queues correspond to different services, and different services have different real-time requirements, so that different priority information needs to be configured for different message queues, and the priority information is configured according to the emergency degree of the service corresponding to the message queues, so as to appropriately delay the queuing time of some messages which are not very urgent or shorten the queuing time of some messages which are more urgent. In this embodiment, the corresponding relationship between the message queue and the priority information may be preset, for example, the priority information may be a numerical value, if the message queue a is a real-time message, the priority information is 10, and if the message queue b is a non-real-time message, the priority information is 0.1.
Step 132, determine the processing level according to the following formula:
G＝S-(T/K)*W
wherein G is a processing level, S is a preset original processing level, T is a queuing time, K is a preset parameter, and W is priority information corresponding to the message queue.
Where the queuing time may be in seconds. The preset raw processing level may be preset according to an actual use situation, for example, the preset raw processing level is 100. The preset parameter may also be preset according to the actual usage situation, for example, if the preset parameter is 2, the queue processing level is increased by one level for 2 seconds.
If the processing level is greater than or equal to the predetermined processing level threshold, step 140, it is determined whether the consumption capacity of the consumer of the message queue is reduced.
After the processing level is determined, whether the message queue is analyzed and processed or not is determined according to the processing level. In this embodiment, a higher processing level indicates that the message queue does not yet need to be processed, and a lower processing level indicates that the message queue needs to be processed. Specifically, a preset processing level threshold may be set, and when the processing level is greater than or equal to the preset processing level threshold, the message queue is analyzed and processed, and when the processing level is less than the preset processing level threshold, the message queue is not analyzed and processed, so that the message queue needing to be processed is screened out.
In some embodiments, step 140 may comprise:
The preset number of times may be 2, and the processing level within the latest preset number of times is the processing level of the latest 2 times.
And 142, when the processing levels within the latest preset times are all smaller than the preset processing level threshold, determining whether the message queue is processed within the first preset time according to the processing records.
Specifically, whether the processing levels within the latest preset times are all smaller than a preset processing level threshold value is determined, and if the processing levels within the latest preset times are all smaller than the preset processing level threshold value is determined, whether the message queue is processed within a first preset time is determined according to the processing records; and if the processing level within the latest preset times is determined to be greater than or equal to the preset processing level threshold, the message queue is not processed.
The index data of the message queue may further include a processing record. The processing record refers to a restart processing record and a capacity expansion processing record of the message queue. And generating a processing record of the message queue each time the message queue is processed. Determining whether the message queue is processed within a first preset time according to the processing record, which may specifically be: inquiring the processing record, if the restart processing record or the capacity expansion processing record of the message queue in the first preset time is inquired, determining that the message queue is processed in the first preset time, and if the restart processing record or the capacity expansion processing record of the message queue in the first preset time is not inquired, determining that the message queue is not processed in the first preset time. The first preset time may be set according to an actual application situation, for example, the first preset time is the first 10 minutes.
Where the current consumption speed may be the average dequeue per second of the previous minute, i.e., the total dequeue in the previous minute divided by 60 seconds. The preset consumption speed peak value can be preset and can be adjusted according to the actual application condition. The preset proportion threshold is a preset proportion threshold, when the ratio of the current consumption speed to the preset consumption speed peak value is greater than or equal to the preset proportion threshold, the current consumption speed is higher, and when the ratio of the current consumption speed to the preset consumption speed peak value is smaller than the preset proportion threshold, the current consumption speed is lower.
Before step 143, step 140 may further include: determining a historical dequeuing speed peak value of the message queue according to the dequeuing amount; and updating the preset consumption speed peak value according to the historical dequeuing speed peak value. For example, a dequeue speed is determined every minute, the maximum dequeue speed in one day is taken as a peak dequeue speed, so that the peak dequeue speed of each day in the past month (namely, the peak historical dequeue speed) is determined, the peak dequeue speed of each day in the past month of the message queue is counted once a day, and the preset peak consumption speed is updated to the maximum peak dequeue speed. As another example, assume that the peak values of dequeue speeds of the past 30 days per day are a1、a2、a3…a30And a is a1>a2>a3>…>a30Then, a peak consumption rate is preset on day 311If the peak value of the dequeuing speed of the 31 th day is determined to be a31And a is a31>a1Updating the preset consumption speed peak value to a at day 3231。
And 144, if the ratio of the current consumption speed to the preset consumption speed peak value is determined to be greater than or equal to the preset ratio threshold value, determining that the consumption capacity of the consumers in the message queue is not reduced.
And step 145, if the ratio of the current consumption speed to the preset consumption speed peak value is smaller than the preset ratio threshold value, determining that the consumption capacity of the consumers in the message queue is reduced.
When the ratio of the current consumption speed to the preset consumption speed peak value is determined to be greater than or equal to the preset ratio threshold value, the current consumption speed is indicated to be higher, and the consumption capacity of the consumers in the message queue is determined not to be reduced; and when the ratio of the current consumption speed to the preset consumption speed peak value is smaller than the preset proportion threshold value, the current consumption speed is low, and the consumption capacity of the consumers of the message queue is determined to be reduced.
And 150, if the consumption capability of the consumer of the message queue is not reduced, carrying out capacity expansion processing on the message queue.
The queuing time is long, but the consumption capacity of the consumers of the message queue is not reduced, which may be caused by the sudden increase of the queuing amount of the message queue, and the capacity expansion processing can be performed on the message queue, so as to improve the processing speed of the message.
The expansion processing for the message queue may specifically be: according to the ports of the message queues and the ports of the consumers, the message queues and the consumer instances are expanded, the number of the message queues and the number of the consumer instances are ensured to be equal, the time sequence configuration of the message queues is inquired, manual access expansion is required if the message queues have time sequence requirements, and the expansion is directly performed if the message queues have no time sequence requirements.
And step 160, if the consumption capability of the consumer of the message queue is determined to be reduced, restarting the message queue.
The queuing time is long, and the consumption capability of the consumer of the message queue is reduced, which may be the reduction of the consumption capability of the consumer of the message queue, and the reduction of the consumption capability of the consumer may be the reason of coding error, and the like, so that the message queue can be restarted to recover the consumption capability of the consumer.
The restarting process on the message queue may specifically be: and restarting the server where the consumption queue is located according to the port of the message queue, thereby performing restarting processing.
The embodiment of the invention acquires index data of a message queue, determines queuing time of the message queue according to the index data, determines processing level of the message queue according to the queuing time and priority information corresponding to the message queue, determines whether the consumption capacity of consumers of the message queue is reduced or not if the processing level is greater than or equal to a preset processing level threshold value, performs capacity expansion processing on the message queue if the consumption capacity of the consumers of the message queue is not reduced, restarts the message queue if the consumption capacity of the consumers of the message queue is reduced, can combine a key index of the message queuing time with differentiated requirements of service real-time corresponding to each message queue to obtain reasonable message queue score, analyzes a low-grade message queue according to the message queue score result, and judges that the message queue is a problem caused by increased queuing amount or reduced consumption capacity of the consumers, thereby carry out corresponding processing, the supply and demand change that can the automatic analysis consumption ability fixes a position the problem fast, restart and the dilatation through automated processing realize fast processing, thereby improve the treatment effeciency of message backlog, and, can also realize warning and processing mechanism based on application demand, and further use this kind of difference on the tolerance, solved and reported an emergency and asked for help or increased vigilance and handle the differentiation of complicated various it application queue problem, utilize the application tolerance configuration of differentiation simultaneously, realized that the customer perception is prior to in the unusual solution, user experience has been promoted.
In some other embodiments, as shown in fig. 2, step 150 may specifically include:
and step 151, determining whether the message queue is in a capacity expansion state according to the processing record.
The processing record can be inquired, and whether the message queue is in a capacity expansion state or not can be determined by combining the time required for one-time capacity expansion of the message queue. For example, if the time required for once expansion of the message queue is 5 minutes, and the message queue starts to expand before 3 minutes is queried, the message queue is still in the expansion state currently.
And 152, if the message queue is determined to be in the capacity expansion state, performing additional capacity expansion processing on the message queue.
If the message queue is determined to be in the capacity expansion state, that is, the capacity expansion quantity of the message queue is not enough to process the backlog message, the capacity is expanded again on the basis of the original capacity expansion, so that the additional capacity expansion processing is performed.
Step 153, if it is determined that the message queue is not in the capacity expansion state, performing capacity expansion processing on the message queue.
In some other embodiments, as shown in fig. 2, step 160 may specifically include:
When the consumption capacity of the consumer of the message queue is reduced, the processing record is inquired, if the restart processing record or the capacity expansion processing record of the message queue in the second preset time is inquired, whether the capacity expansion processing or the restart processing is carried out on the message queue in the second preset time is determined, and if the restart processing record or the capacity expansion processing record of the message queue in the second preset time is not inquired, it is determined that the message queue is not processed in the second preset time. The second preset time can be set according to the actual application, for example, the second preset time is the first 30 minutes.
And step 162, if it is determined that the message queue is not subjected to the capacity expansion processing and the restart processing within the second preset time, determining the current enqueuing speed of the message queue according to the enqueuing amount, and determining whether the current enqueuing speed is greater than a preset enqueuing speed threshold.
The current enqueuing speed of the message queue is determined according to the enqueuing amount, and specifically may be: and acquiring the total enqueue amount of the previous minute, and dividing the total enqueue amount of the previous minute by 60 seconds to calculate the current enqueue speed. The preset enqueuing speed threshold is the maximum value of the preset enqueuing speed, when the current enqueuing speed is greater than the preset enqueuing speed threshold, the enqueuing amount of the message queue is increased, and when the current enqueuing speed is less than or equal to the preset enqueuing speed threshold, the enqueuing amount of the message queue is not increased.
And 163, if the current enqueuing speed is determined to be greater than the preset enqueuing speed threshold, performing restart processing and capacity expansion processing on the message queue.
If the current enqueuing speed is greater than the preset enqueuing speed threshold, it indicates that the message backlog of the message queue is caused by not only the decrease of the consumption capability of the consumer but also the increase of the enqueuing amount of the message queue, so that the restarting processing and the capacity expansion processing need to be carried out simultaneously.
And step 164, if the current enqueuing speed is determined to be less than or equal to the preset enqueuing speed threshold, restarting the message queue.
If the current enqueuing speed is less than or equal to the preset enqueuing speed threshold, the message backlog of the message queue is only caused by the reduction of the consumption capability of the consumer, so that the message queue is only restarted.
In some other embodiments, step 160 may further include:
and 165, if the message queue is determined to be subjected to capacity expansion processing or restarting processing within the second preset time, generating a manual intervention alarm.
And if the message queue is determined to be subjected to capacity expansion processing or restarting processing within the second preset time, namely the reason of the message backlog of the message queue cannot be solved through capacity expansion and restarting, generating a manual intervention alarm to prompt manual intervention.
In the embodiment, various forms of processing schemes can be provided, optimal decisions can be given, automatic processing can be realized, the method is not limited to a single scene of availability of a consumer process, and the whole method and the device can cover all the current message queue exception problems.
In some other embodiments, the method further comprises:
and 170, displaying the index data of the message queue.
The index data may include an amount of enqueue, an amount of dequeue, a backlog, producer information, consumer information, and a processing record. For example, the metrics data for the presentation message queue may be as shown in table 1 below.
Fig. 3 is a schematic structural diagram illustrating a message queue processing apparatus according to an embodiment of the present invention. The method may be applied to a computing device. As shown in fig. 3, the apparatus includes: the device comprises an acquisition module 210, a determination module 220, a judgment module 230 and a processing module 240.
The collecting module 210 is configured to collect index data of the message queue; the determining module 220 is configured to determine a queuing time of the message queue according to the indicator data, and determine a processing level of the message queue according to the queuing time and priority information corresponding to the message queue; the determining module 230 is configured to determine whether the consumption capability of the consumer of the message queue is reduced if the processing level is greater than or equal to a preset processing level threshold; the processing module 240 is configured to perform capacity expansion processing on the message queue if it is determined that the consumption capability of the consumer of the message queue is not reduced, and perform restart processing on the message queue if it is determined that the consumption capability of the consumer of the message queue is reduced.
The index data of the message queue may include one or more of an amount of enqueue, an amount of dequeue, an amount of backlog, producer information, consumer information, and the like, among others.
The determining module 220 is specifically configured to: determining the average dequeue amount per second of the previous minute according to the dequeue amount, and determining the average dequeue amount per second as the current consumption speed; and dividing the backlog quantity by the current consumption speed to obtain the queuing time length.
Wherein, the determining module 220 is further specifically configured to: determining priority information corresponding to the message queue according to a preset corresponding relation between the message queue and the priority information; the process level is determined according to the following formula:
G＝S-(T/K)*W
wherein G is a processing level, S is a preset original processing level, T is a queuing time, K is a preset parameter, and W is priority information corresponding to the message queue.
The determining module 230 is specifically configured to: acquiring the processing level within the latest preset times of the message queue; when the processing levels within the latest preset times are all smaller than a preset processing level threshold value, determining whether the message queue is processed within a first preset time or not according to the processing records; if the message queue is determined not to be processed within the first preset time, determining the current consumption speed of the message queue according to the dequeue amount, and determining whether the ratio of the current consumption speed to a preset consumption speed peak value is greater than a preset ratio threshold value; if the ratio of the current consumption speed to the preset consumption speed peak value is larger than or equal to the preset ratio threshold value, determining that the consumption capacity of the consumers of the message queue is not reduced; and if the ratio of the current consumption speed to the preset consumption speed peak value is smaller than the preset proportion threshold value, determining that the consumption capacity of the consumers of the message queue is reduced.
In an optional manner, the determining module 230 is further specifically configured to: determining a historical dequeuing speed peak value of the message queue according to the dequeuing amount; and updating the preset consumption speed peak value according to the historical dequeuing speed peak value.
In an optional manner, the processing module 240 is specifically configured to: determining whether the message queue is in an expansion state or not according to the processing record; if the message queue is determined to be in the capacity expansion state, performing additional capacity expansion processing on the message queue; and if the message queue is determined not to be in the capacity expansion state, performing capacity expansion processing on the message queue.
In an optional manner, the processing module 240 is further specifically configured to: determining whether the message queue is subjected to capacity expansion processing or restarting processing within second preset time according to the processing record; if the message queue is determined not to be subjected to capacity expansion processing and restarting processing within second preset time, determining the current enqueuing speed of the message queue according to the enqueuing amount, and determining whether the current enqueuing speed is greater than a preset enqueuing speed threshold value; if the current enqueuing speed is determined to be greater than the preset enqueuing speed threshold value, restarting and expanding the message queue; if the current enqueuing speed is determined to be less than or equal to the preset enqueuing speed threshold, restarting the message queue; and if the message queue is determined to be subjected to capacity expansion processing or restarting processing within the second preset time, generating a manual intervention alarm.
In an alternative form, the apparatus further comprises a display module. The display module is specifically configured to: and displaying the index data of the message queue.
It should be noted that, the message queue processing apparatus provided in the embodiments of the present invention is an apparatus capable of executing the message queue processing method, and all embodiments of the message queue processing method are applicable to the apparatus and can achieve the same or similar beneficial effects.
The embodiment of the invention acquires index data of a message queue, determines queuing time of the message queue according to the index data, determines processing level of the message queue according to the queuing time and priority information corresponding to the message queue, determines whether the consumption capacity of consumers of the message queue is reduced or not if the processing level is greater than or equal to a preset processing level threshold value, performs capacity expansion processing on the message queue if the consumption capacity of the consumers of the message queue is not reduced, restarts the message queue if the consumption capacity of the consumers of the message queue is reduced, can combine a key index of the message queuing time with differentiated requirements of service real-time corresponding to each message queue to obtain reasonable message queue score, analyzes a low-grade message queue according to the message queue score result, and judges that the message queue is a problem caused by increased queuing amount or reduced consumption capacity of the consumers, thereby carry out corresponding processing, the supply and demand change that can the automatic analysis consumption ability fixes a position the problem fast, restart and the dilatation through automated processing realize fast processing, thereby improve the treatment effeciency of message backlog, and, can also realize warning and processing mechanism based on application demand, and further use this kind of difference on the tolerance, solved and reported an emergency and asked for help or increased vigilance and handle the differentiation of complicated various it application queue problem, utilize the application tolerance configuration of differentiation simultaneously, realized that the customer perception is prior to in the unusual solution, user experience has been promoted.
Fig. 4 is a schematic structural diagram of a computing device provided in an embodiment of the present invention. The specific embodiments of the present invention are not intended to limit the specific implementations of computing devices.
As shown in fig. 4, the computing device may include: a processor (processor)302, a communication Interface 304, a memory 306, and a communication bus 308.
Wherein: the processor 302, communication interface 304, and memory 306 communicate with each other via a communication bus 308. A communication interface 304 for communicating with network elements of other devices, such as producers, consumers, or other servers. The processor 302 is configured to execute the program 310, and may specifically perform the relevant steps in the above embodiment of the message queue processing method.
In particular, program 310 may include program code comprising computer-executable instructions.
The processor 302 may be a central processing unit CPU, or an Application Specific Integrated Circuit (ASIC), or one or more Integrated circuits configured to implement an embodiment of the present invention. The computing device includes one or more processors, which may be the same type of processor, such as one or more CPUs; or may be different types of processors such as one or more CPUs and one or more ASICs.
And a memory 306 for storing a program 310. Memory 306 may comprise high-speed RAM memory and may also include non-volatile memory (non-volatile memory), such as at least one disk memory.
The program 310 may specifically be invoked by the processor 302 to cause the computing device to perform the operations in the message queue processing method in the above embodiments.
The embodiment of the invention acquires index data of a message queue, determines queuing time of the message queue according to the index data, determines processing level of the message queue according to the queuing time and priority information corresponding to the message queue, determines whether the consumption capacity of consumers of the message queue is reduced or not if the processing level is greater than or equal to a preset processing level threshold value, performs capacity expansion processing on the message queue if the consumption capacity of the consumers of the message queue is not reduced, restarts the message queue if the consumption capacity of the consumers of the message queue is reduced, can combine a key index of the message queuing time with differentiated requirements of service real-time corresponding to each message queue to obtain reasonable message queue score, analyzes a low-grade message queue according to the message queue score result, and judges that the message queue is a problem caused by increased queuing amount or reduced consumption capacity of the consumers, thereby carry out corresponding processing, the supply and demand change that can the automatic analysis consumption ability fixes a position the problem fast, restart and the dilatation through automated processing realize fast processing, thereby improve the treatment effeciency of message backlog, and, can also realize warning and processing mechanism based on application demand, and further use this kind of difference on the tolerance, solved and reported an emergency and asked for help or increased vigilance and handle the differentiation of complicated various it application queue problem, utilize the application tolerance configuration of differentiation simultaneously, realized that the customer perception is prior to in the unusual solution, user experience has been promoted.
An embodiment of the present invention provides a computer-readable storage medium, where the storage medium stores at least one executable instruction, and when the executable instruction is executed on a computing device, the computing device is enabled to execute a message queue processing method in any of the above method embodiments. The executable instructions may be specifically configured to cause the computing device to perform the operations in the message queue processing method in the foregoing embodiments.
The embodiment of the invention acquires index data of a message queue, determines queuing time of the message queue according to the index data, determines processing level of the message queue according to the queuing time and priority information corresponding to the message queue, determines whether the consumption capacity of consumers of the message queue is reduced or not if the processing level is greater than or equal to a preset processing level threshold value, performs capacity expansion processing on the message queue if the consumption capacity of the consumers of the message queue is not reduced, restarts the message queue if the consumption capacity of the consumers of the message queue is reduced, can combine a key index of the message queuing time with differentiated requirements of service real-time corresponding to each message queue to obtain reasonable message queue score, analyzes a low-grade message queue according to the message queue score result, and judges that the message queue is a problem caused by increased queuing amount or reduced consumption capacity of the consumers, thereby carry out corresponding processing, the supply and demand change that can the automatic analysis consumption ability fixes a position the problem fast, restart and the dilatation through automated processing realize fast processing, thereby improve the treatment effeciency of message backlog, and, can also realize warning and processing mechanism based on application demand, and further use this kind of difference on the tolerance, solved and reported an emergency and asked for help or increased vigilance and handle the differentiation of complicated various it application queue problem, utilize the application tolerance configuration of differentiation simultaneously, realized that the customer perception is prior to in the unusual solution, user experience has been promoted.
The embodiment of the invention provides a message queue processing device, which is used for executing the message queue processing method.
Embodiments of the present invention provide a computer program that can be invoked by a processor to enable a computing device to execute a message queue processing method in any of the above method embodiments.
Embodiments of the present invention provide a computer program product comprising a computer program stored on a computer-readable storage medium, the computer program comprising program instructions that, when run on a computer, cause the computer to perform a message queue processing method in any of the above-described method embodiments.
The algorithms or displays presented herein are not inherently related to any particular computer, virtual system, or other apparatus. Various general purpose systems may also be used with the teachings herein. The required structure for constructing such a system will be apparent from the description above. In addition, embodiments of the present invention are not directed to any particular programming language. It is appreciated that a variety of programming languages may be used to implement the teachings of the present invention as described herein, and any descriptions of specific languages are provided above to disclose the best mode of the invention.
In the description provided herein, numerous specific details are set forth. It is understood, however, that embodiments of the invention may be practiced without these specific details. In some instances, well-known methods, structures and techniques have not been shown in detail in order not to obscure an understanding of this description.
Similarly, it should be appreciated that in the foregoing description of exemplary embodiments of the invention, various features of the embodiments of the invention are sometimes grouped together in a single embodiment, figure, or description thereof for the purpose of streamlining the invention and aiding in the understanding of one or more of the various inventive aspects. However, the disclosed method should not be interpreted as reflecting an intention that: that the invention as claimed requires more features than are expressly recited in each claim. Thus, the claims following the detailed description are hereby expressly incorporated into this detailed description, with each claim standing on its own as a separate embodiment of this invention.
Those skilled in the art will appreciate that the modules in the device in an embodiment may be adaptively changed and disposed in one or more devices different from the embodiment. The modules or units or components of the embodiments may be combined into one module or unit or component, and furthermore they may be divided into a plurality of sub-modules or sub-units or sub-components. All of the features disclosed in this specification (including any accompanying claims, abstract and drawings), and all of the processes or elements of any method or apparatus so disclosed, may be combined in any combination, except combinations where at least some of such features and/or processes or elements are mutually exclusive. Each feature disclosed in this specification (including any accompanying claims, abstract and drawings) may be replaced by alternative features serving the same, equivalent or similar purpose, unless expressly stated otherwise.
Furthermore, those skilled in the art will appreciate that while some embodiments herein include some features included in other embodiments, rather than other features, combinations of features of different embodiments are meant to be within the scope of the invention and form different embodiments.
It should be noted that the above-mentioned embodiments illustrate rather than limit the invention, and that those skilled in the art will be able to design alternative embodiments without departing from the scope of the appended claims. In the claims, any reference signs placed between parentheses shall not be construed as limiting the claim. The word "comprising" does not exclude the presence of elements or steps not listed in a claim. The word "a" or "an" preceding an element does not exclude the presence of a plurality of such elements. The invention may be implemented by means of hardware comprising several distinct elements, and by means of a suitably programmed computer. In the unit claims enumerating several means, several of these means may be embodied by one and the same item of hardware. The usage of the words first, second and third, etcetera do not indicate any ordering. These words may be interpreted as names. The steps in the above embodiments should not be construed as limiting the order of execution unless specified otherwise.
Claims (10)
1. A message queue processing method, comprising:
acquiring index data of a message queue;
determining the queuing time of the message queue according to the index data;
determining the processing level of the message queue according to the queuing time and the priority information corresponding to the message queue;
if the processing level is greater than or equal to a preset processing level threshold, determining whether the consumption capacity of the consumer of the message queue is reduced;
if the consumption capability of the consumer of the message queue is not reduced, carrying out capacity expansion processing on the message queue;
and if the consumption capability of the consumer of the message queue is determined to be reduced, restarting the message queue.
2. The method of claim 1, wherein the metrics data includes processing records, dequeue amounts for the message queue;
if the processing level is greater than or equal to a preset processing level threshold, determining whether the consumption capacity of the consumer of the message queue is reduced, specifically including:
acquiring the processing level within the latest preset times of the message queue;
when the processing levels within the latest preset times are all smaller than a preset processing level threshold, determining whether the message queue is processed within a first preset time or not according to the processing record;
if the message queue is determined not to be processed within the first preset time, determining the current consumption speed of the message queue according to the dequeue amount, and determining whether the ratio of the current consumption speed to a preset consumption speed peak value is greater than a preset ratio threshold value;
if the ratio of the current consumption speed to a preset consumption speed peak value is larger than or equal to the preset ratio threshold value, determining that the consumption capacity of the consumers of the message queue is not reduced;
and if the ratio of the current consumption speed to a preset consumption speed peak value is smaller than the preset ratio threshold value, determining that the consumption capacity of the consumers of the message queue is reduced.
3. The method according to claim 2, wherein if the processing level is greater than or equal to a preset processing level threshold, determining whether the consumption capacity of the consumer of the message queue is reduced further comprises:
determining a historical dequeuing speed peak value of the message queue according to the dequeuing amount;
and updating the preset consumption speed peak value according to the historical dequeuing speed peak value.
4. The method according to claim 2, wherein if it is determined that the consumption capacity of the consumer of the message queue is not reduced, performing capacity expansion processing on the message queue specifically includes:
determining whether the message queue is in an expansion state or not according to the processing record;
if the message queue is determined to be in the capacity expansion state, performing additional capacity expansion processing on the message queue;
and if the message queue is determined not to be in the capacity expansion state, performing capacity expansion processing on the message queue.
5. The method of claim 2, wherein the metric data further includes an amount of enqueue of the message queue;
if it is determined that the consumption capability of the consumer of the message queue is reduced, performing restart processing on the message queue, specifically including:
determining whether the message queue carries out capacity expansion processing or restarting processing within second preset time or not according to the processing record;
if the message queue is determined not to be subjected to capacity expansion processing and restarting processing within the second preset time, determining the current enqueuing speed of the message queue according to the enqueuing amount, and determining whether the current enqueuing speed is greater than a preset enqueuing speed threshold value;
if the current enqueuing speed is determined to be greater than a preset enqueuing speed threshold value, carrying out restarting processing and capacity expansion processing on the message queue;
and if the current enqueuing speed is determined to be less than or equal to the preset enqueuing speed threshold, restarting the message queue.
6. The method of any of claims 1-5, wherein the metric data includes an amount of dequeue, an amount of backlog of the message queue;
determining a queuing time of the message queue according to the index data specifically includes:
determining the average dequeuing amount per second of the previous minute according to the dequeuing amount, and determining the average dequeuing amount per second as the current consumption speed;
and dividing the backlog quantity by the current consumption speed to obtain the queuing time length.
7. The method according to claim 6, wherein the determining the processing level of the message queue according to the queuing time and the priority information corresponding to the message queue specifically comprises:
determining priority information corresponding to a message queue according to a preset corresponding relation between the message queue and the priority information;
determining the processing level according to the following formula:
G＝S-(T/K)*W
wherein G is the processing level, S is a preset original processing level, T is the queuing duration, K is a preset parameter, and W is priority information corresponding to the message queue.
8. A message queue processing apparatus, comprising:
the acquisition module is used for acquiring index data of the message queue;
the determining module is used for determining the queuing time of the message queue according to the index data and determining the processing level of the message queue according to the queuing time and the priority information corresponding to the message queue;
the judging module is used for determining whether the consumption capacity of the consumers of the message queue is reduced or not if the processing level is greater than or equal to a preset processing level threshold;
and the processing module is used for carrying out capacity expansion processing on the message queue if the consumption capacity of the consumer of the message queue is not reduced, and carrying out restart processing on the message queue if the consumption capacity of the consumer of the message queue is reduced.
9. A computing device, comprising: the system comprises a processor, a memory, a communication interface and a communication bus, wherein the processor, the memory and the communication interface complete mutual communication through the communication bus;
the memory is for storing at least one executable instruction that causes the processor to perform the operations of the message queue processing method of any of claims 1-7.
10. A computer-readable storage medium having stored therein at least one executable instruction that, when executed on a computing device, causes the computing device to perform operations of the message queue processing method of any of claims 1-7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010544867.9A CN113806102B (en) | 2020-06-15 | 2020-06-15 | Message queue processing method and device and computing equipment |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010544867.9A CN113806102B (en) | 2020-06-15 | 2020-06-15 | Message queue processing method and device and computing equipment |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113806102A true CN113806102A (en) | 2021-12-17 |
| CN113806102B CN113806102B (en) | 2023-11-21 |
Family
ID=78944206
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010544867.9A Active CN113806102B (en) | 2020-06-15 | 2020-06-15 | Message queue processing method and device and computing equipment |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113806102B (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114281514A (en) * | 2022-03-08 | 2022-04-05 | 南京赛宁信息技术有限公司 | Method and system for recovering multi-stage queue scenes in shooting range environment |
| CN115695317A (en) * | 2022-12-23 | 2023-02-03 | 海马云（天津）信息技术有限公司 | Queuing and dequeuing method and device of access request, electronic equipment and storage medium |
Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105847608A (en) * | 2016-03-17 | 2016-08-10 | 中国工商银行股份有限公司 | Routing device and method for call center |
| WO2017028545A1 (en) * | 2015-08-14 | 2017-02-23 | 中兴通讯股份有限公司 | Port queue congestion monitoring method and system |
| US20170289242A1 (en) * | 2016-03-31 | 2017-10-05 | David Keppel | Technologies for dynamic work queue management |
| WO2018082570A1 (en) * | 2016-11-02 | 2018-05-11 | 华为技术有限公司 | I/o request scheduling method and device |
| WO2019205371A1 (en) * | 2018-04-24 | 2019-10-31 | 平安科技（深圳）有限公司 | Server, message allocation method, and storage medium |
| CN110489225A (en) * | 2018-05-15 | 2019-11-22 | 中国移动通信集团浙江有限公司 | A kind of service expansion method, device and equipment based on message queue |
| CN111176856A (en) * | 2018-11-09 | 2020-05-19 | 商派软件有限公司 | Method for intelligently controlling consumption script channel |
| CN111240865A (en) * | 2020-01-14 | 2020-06-05 | 山东汇贸电子口岸有限公司 | Elastic flexible activity priority management system and method based on message queue |
-
2020
- 2020-06-15 CN CN202010544867.9A patent/CN113806102B/en active Active
Patent Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2017028545A1 (en) * | 2015-08-14 | 2017-02-23 | 中兴通讯股份有限公司 | Port queue congestion monitoring method and system |
| CN105847608A (en) * | 2016-03-17 | 2016-08-10 | 中国工商银行股份有限公司 | Routing device and method for call center |
| US20170289242A1 (en) * | 2016-03-31 | 2017-10-05 | David Keppel | Technologies for dynamic work queue management |
| WO2018082570A1 (en) * | 2016-11-02 | 2018-05-11 | 华为技术有限公司 | I/o request scheduling method and device |
| WO2019205371A1 (en) * | 2018-04-24 | 2019-10-31 | 平安科技（深圳）有限公司 | Server, message allocation method, and storage medium |
| CN110489225A (en) * | 2018-05-15 | 2019-11-22 | 中国移动通信集团浙江有限公司 | A kind of service expansion method, device and equipment based on message queue |
| CN111176856A (en) * | 2018-11-09 | 2020-05-19 | 商派软件有限公司 | Method for intelligently controlling consumption script channel |
| CN111240865A (en) * | 2020-01-14 | 2020-06-05 | 山东汇贸电子口岸有限公司 | Elastic flexible activity priority management system and method based on message queue |
Non-Patent Citations (3)
| Title |
|---|
| JUSTUS ARNE SCHWARZ等: "Performance analysis of time-dependent queueing systems: Survey and classification", 《OMEGA》, vol. 63, pages 170 - 189 * |
| 岳然等: "LTE-A系统中下行调度算法的研究", 《电信科学》, vol. 26, no. 1, pages 68 - 71 * |
| 陈瑶 等: "基于ActiveMQ的数据传输框架性能优化", 《现代信息科技》, vol. 3, no. 16, pages 128 - 130 * |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114281514A (en) * | 2022-03-08 | 2022-04-05 | 南京赛宁信息技术有限公司 | Method and system for recovering multi-stage queue scenes in shooting range environment |
| CN114281514B (en) * | 2022-03-08 | 2022-05-24 | 南京赛宁信息技术有限公司 | Method and system for recovering multi-stage queue scenes in shooting range environment |
| CN115695317A (en) * | 2022-12-23 | 2023-02-03 | 海马云（天津）信息技术有限公司 | Queuing and dequeuing method and device of access request, electronic equipment and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN113806102B (en) | 2023-11-21 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106802826B (en) | Service processing method and device based on thread pool | |
| US20180365085A1 (en) | Method and apparatus for monitoring client applications | |
| CN110232010A (en) | A kind of alarm method, alarm server and monitoring server | |
| CN113806102A (en) | Message queue processing method and device and computing equipment | |
| CN108021487B (en) | GPU (graphics processing Unit) graphic processing performance monitoring and analyzing method | |
| CN112367384B (en) | Kafka cluster-based dynamic speed limiting method and device and computer equipment | |
| CN109726092B (en) | Bus processing efficiency evaluation method, system and computer storage medium | |
| US20200004785A1 (en) | Automatic grouping based on user behavior | |
| CN108769157B (en) | Message popup display method and device, computing equipment and computer storage medium | |
| CN109446515A (en) | Group information analysis method, electronic device and computer readable storage medium | |
| CN113760658A (en) | Monitoring method, device and equipment | |
| JP5104529B2 (en) | Analysis support program, analysis support method, and analysis support apparatus | |
| CN112764992B (en) | Thread pool monitoring method, device and equipment | |
| CN111368864A (en) | Identification method, availability evaluation method and device, electronic equipment and storage medium | |
| CN115269519A (en) | Log detection method and device and electronic equipment | |
| CN113645585A (en) | Internet of things data acquisition method | |
| CN112988417A (en) | Message processing method and device, electronic equipment and computer readable medium | |
| CN117785487B (en) | Method, device, equipment and medium for scheduling computing power resources | |
| CN114064741B (en) | Method, device and equipment for acquiring prepositive data and storage medium | |
| CN108920327A (en) | A kind of cloud computing alarm method and device | |
| CN114625311B (en) | Method and device for determining cache component | |
| CN110928738B (en) | Performance analysis method, device and equipment | |
| CN117650967A (en) | Multi-cluster index processing method, system, electronic equipment and storage medium | |
| CN114036160A (en) | Real-time data acquisition method and device, electronic equipment and storage medium | |
| CN115408125A (en) | Sliding window-based task processing method, system, device and storage medium |
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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |