CN112527527B - Message queue consumption speed control method, device, electronic device and medium - Google Patents

Abstract

The embodiment of the invention discloses a consumption speed control method and device of a message queue, electronic equipment and a medium. The method comprises the following steps: retrieving a first number of messages from the message queue in response to the timed task initiation request; wherein the first number is the same as the number of fragmented tasks of the timed task; and processing the message through the slicing task. The embodiment of the invention combines the message queue with the timed task fragments, controls the consumption speed of the message queue by controlling the number of the timed task fragments, reduces the implementation complexity of the control method of the consumption speed of the message queue, and can effectively control the consumption thread number of the message.

Description

Message queue consumption speed control method, device, electronic device and medium

Technical Field

The embodiments of the present invention relate to the field of computer technology, and in particular to a method, device, electronic device and medium for controlling the consumption speed of a message queue.

Background Art

After the message producer generates a message, it will send the message to the message queue, and then the message consumer will take the message from the message queue for message consumption. Since the load capacity of the message consumer is limited, controlling the consumption speed of the message queue is of great significance to ensure the stability of the message consumer system and improve the work efficiency of the message consumer.

Existing methods for controlling the consumption speed of message queues, such as sliding window algorithm, leaky bucket algorithm and token bucket algorithm, can control the consumption speed of message queues per unit time, but the complexity of implementing the above algorithms is relatively high when the distributed system is expanded.

Summary of the invention

The embodiment of the present invention provides a method, device, electronic device and medium for controlling the consumption speed of a message queue, so as to achieve the purpose of controlling the consumption speed of a message queue.

In a first aspect, an embodiment of the present invention provides a method for controlling the consumption speed of a message queue, comprising:

In response to a scheduled task start request, taking out a first number of messages from a message queue; wherein the first number is the same as the number of shard tasks of the scheduled task;

The message is processed by the sharding task.

In a second aspect, an embodiment of the present invention further provides a consumption speed control device for a message queue, comprising:

A message fetching module, configured to fetch a first number of messages from a message queue in response to a scheduled task start request; wherein the first number is the same as the number of shard tasks of the scheduled task;

The message processing module is used to process the message through the sharding task.

In a third aspect, an embodiment of the present invention further provides an electronic device, including:

one or more processors;

a memory for storing one or more programs,

When the one or more programs are executed by the one or more processors, the one or more processors implement the method for controlling the consumption speed of a message queue as described in any embodiment of the present invention.

In a fourth aspect, an embodiment of the present invention further provides a non-transitory computer-readable storage medium storing computer instructions, wherein the computer instructions are used to enable the computer to execute a method for controlling the consumption speed of a message queue as described in any embodiment.

The technical solution provided by the embodiment of the present invention, in response to a scheduled task start request, takes out a first number of messages from a message queue; wherein the first number is the same as the number of shard tasks of the scheduled task; and the messages are processed by the shard tasks. The technical solution provided by the embodiment of the present invention combines the message queue with the scheduled task sharding, and controls the consumption speed of the message queue by controlling the number of shard tasks of the scheduled task, thereby reducing the implementation complexity of the method for controlling the consumption speed of the message queue, and can effectively control the number of message consumption threads.

BRIEF DESCRIPTION OF THE DRAWINGS

1 is a flow chart of a method for controlling the consumption speed of a message queue provided in Embodiment 1 of the present invention;

2 is a flow chart of a method for controlling the consumption speed of a message queue provided in Embodiment 2 of the present invention;

3 is a schematic diagram of the structure of a consumption speed control device for a message queue provided in Embodiment 3 of the present invention;

FIG. 4 is a schematic diagram of the structure of an electronic device to which the method for controlling the consumption speed of a message queue provided by an embodiment of the present invention is applicable.

DETAILED DESCRIPTION

The present invention will be further described in detail below in conjunction with the accompanying drawings and embodiments. It is to be understood that the specific embodiments described herein are only used to explain the present invention, rather than to limit the present invention. It should also be noted that, for ease of description, only parts related to the present invention, rather than all structures, are shown in the accompanying drawings.

Embodiment 1

FIG1 is a flow chart of a method for controlling the consumption speed of a message queue provided in Embodiment 1 of the present invention. This embodiment is applicable to the case where the consumption speed of a message queue is controlled. The method can be executed by a device for controlling the consumption speed of a message queue. The device can be implemented in software and/or hardware and can be configured in an electronic device. The electronic device can be an electronic device such as a server with communication and computing capabilities. As shown in FIG1 , the method specifically includes:

S110. In response to a scheduled task start request, take out a first number of messages from a message queue; wherein the first number is the same as the number of shard tasks of the scheduled task.

The scheduled task refers to a task that is executed based on a given time point, a given time interval, or a given number of executions. For example, the scheduled task is a task that is executed once every 1 second.

The scheduled task start request is issued while executing the scheduled task or before executing the scheduled task, and is used to instruct the start and execution of the scheduled task. A first number of messages are taken out from the message queue, wherein the message queue refers to a container for storing messages during the transmission of the messages, and the message refers to the data stored in the message queue. The first number is the same as the number of shard tasks of the scheduled task. The specific value of the first number is not limited here and is determined based on actual conditions. Among them, the shard task refers to a subtask that executes the same scheduled task.

In an optional embodiment, the scheduled task is used to calculate the penalty interest on the overdue payment bill data at a set time interval. Exemplarily, the scheduled task is to calculate the penalty interest on the overdue payment bill data every 1 second. The scheduled task can be executed by multiple task execution servers at the same time. The task content executed by each task execution server is consistent, and the penalty interest is calculated on the overdue payment bill data every 1 second. The task executed on each task execution server is a shard task of the scheduled task.

The number of shards of a scheduled task is determined before the scheduled task is started. In response to the scheduled task start request, the same number of messages as the number of shards of the scheduled task are taken out from the message queue. The number of shards of a scheduled task is not limited here and is determined based on actual conditions.

In an optional embodiment, the message queue is a redis message queue. The redis queue is to use the redis (remote dictionary server) cache application as a message queue. Exemplarily, the redis cache application can implement the redis message queue through the two instructions blpush and brpop or based on Sorted-Set. The redis message queue has the characteristic of being simple to implement, and the redis message queue implemented based on Sorted-Set also has the characteristic of not allowing duplicate messages to be stored.

S120: Process the message through the sharding task.

The sharding task can be executed by the sharding task execution server. As the consumer of the message, the sharding task execution server processes the message obtained from the message queue and completes the consumption of the message in the message queue.

In an optional embodiment, before taking out a first number of messages from a message queue in response to a scheduled task start request, the method further includes: obtaining a shard task quantity update instruction; sharding the scheduled task into a second number of shard tasks according to the shard task quantity update instruction; wherein the first number is equal to the second number.

The shard task quantity update instruction refers to an instruction for changing the shard quantity of a scheduled task when the scheduled task is sharded. For a scheduled task that is sharded for the first time, the shard task quantity update instruction is used to initialize the shard quantity of the scheduled task; for a scheduled task that has already been sharded, the shard task quantity update instruction can be used to change the shard quantity of the scheduled task according to specific business needs. The shard quantity update instruction includes the scheduled task identifier and the target shard task quantity. The target shard task quantity is the expected shard task quantity after the change.

Optionally, the shard task quantity update instruction is input by the user in real time according to actual business needs, or it can be automatically generated according to a preset shard task quantity comparison table. The preset shard task quantity comparison table is pre-set according to the business volume and system carrying capacity. The system carrying capacity includes the storage capacity and computing capacity of the system. The preset shard quantity can be a specific value or a range of values, that is, a certain business volume and system carrying capacity can limit the number of shard tasks to a range of values, and the number of shard tasks can be any value within the range of values.

According to the shard task quantity update instruction, the scheduled task is sharded into a second number of shard tasks. The second number is related to the business volume and the system carrying capacity, and is determined according to the shard task quantity update instruction. The specific value is not limited here and is determined according to the actual situation. The second number is the number of shard tasks obtained by sharding the scheduled task, and the second number is equal to the number of messages taken out from the message queue. The embodiment of the present invention obtains a shard task quantity update instruction before taking out a first number of messages from the message queue in response to a scheduled task start request; according to the shard task quantity update instruction, the scheduled task is sharded into a second number of shard tasks; wherein the first number is equal to the second number. The embodiment of the present invention controls the consumption speed of the message queue by controlling the number of shards of the scheduled task and then controlling the number of messages taken out from the message queue.

In an optional embodiment, before taking out the first number of messages from the message queue in response to the scheduled task start request, it also includes: classifying the business data according to the business attribute information and obtaining the classification results; storing the classification results as messages in the message queue; wherein the classification results stored in the same message queue have the same business attributes.

The system that receives scheduled tasks may receive multiple scheduled tasks at the same time. While receiving scheduled tasks, a large amount of business data will also be input into the system. Before the scheduled task is started and executed, the business data needs to be classified according to business attributes, and then the classification results are stored in the message queue so that the scheduled task can process the messages in the message queue.

Among them, business data refers to basic record data that has not been collected, organized and counted. Business data can be manually entered by the front-line business department or automatically acquired by the system through text or image recognition and other technologies. Business attributes refer to the source of business data. Business data is classified according to business attribute information, and classification results are obtained. For example, in the scenario of credit lending, business data can be divided into overdue repayment bill data and on-time repayment bill data according to whether the user repays on time within the deadline. Continuing with the above example, storing the classification results as messages in the message queue means storing the overdue repayment bill data and on-time repayment bill data in different message queues respectively, and the classification results stored in the same message queue belong to the same business attributes, that is, only overdue repayment bill data or only on-time repayment bill data are included in the same message queue. In the same message queue, both overdue repayment bill data and on-time repayment bill data cannot be included.

In an optional embodiment, the message queue stores overdue payment bill data. In an optional embodiment, the timed task is used to calculate penalty interest on the overdue payment bill data at set time intervals.

Specifically, in the scenario of credit lending, there may be a situation where the customer fails to repay on time within the prescribed repayment period. In this case, the credit lending platform will calculate the penalty interest to be collected by the customer who repays the overdue amount the next day. Store the overdue repayment bill data in the message queue according to the user dimension, and optionally store the user identity information in the overdue bill data in the message queue. The scheduled task is used to calculate the penalty interest on the overdue repayment bill data at a set time interval. Exemplarily, the scheduled task is to calculate the penalty interest on the overdue repayment bill data at an interval of 1 second. When the number of shard tasks of the scheduled task is equal to 20, the scheduled task takes out 20 user identity information from the message queue every 1 second, and the 20 shard tasks calculate the penalty interest on the overdue repayment bill data according to the user identity information. In the case where the processing volume of other businesses in addition to this scheduled task in the system increases and capacity expansion is required, since the number of shard tasks of the scheduled task is 20, the consumption speed of messages in the message queue is 20 every two seconds. The consumption speed of messages in the message queue is only related to the number of shards of the scheduled task and the execution frequency of the scheduled task. The shard tasks of the scheduled task themselves are not affected by the system expansion, so the consumption speed of messages in the message queue is not affected by the system expansion. By controlling the number of shard tasks of the scheduled task, the number of consumer threads of the message can be controlled to meet the expectations.

The technical solution provided by the embodiment of the present invention, in response to a scheduled task start request, takes out a first number of messages from a message queue; wherein the first number is the same as the number of shard tasks of the scheduled task; and the messages are processed by the shard tasks. The technical solution provided by the embodiment of the present invention combines the message queue with the scheduled task sharding, and controls the consumption speed of the message queue by controlling the number of shard tasks of the scheduled task, thereby reducing the implementation complexity of the method for controlling the consumption speed of the message queue, and can effectively control the number of message consumption threads.

Embodiment 2

Figure 2 is a flow chart of the method for controlling the consumption speed of a message queue provided in Example 2 of the present invention. This embodiment is further optimized on the basis of the above-mentioned embodiment. Specifically, the optimization is as follows: before taking out a first number of messages from the message queue in response to the scheduled task start request, it also includes: obtaining a scheduled task execution frequency update instruction; and setting the execution frequency of the scheduled task according to the execution frequency update instruction.

As shown in FIG. 2 , the method includes:

S210: Obtain a scheduled task execution frequency update instruction.

The scheduled task execution frequency update instruction is an instruction used to adjust the scheduled task execution frequency. For scheduled tasks that are being sharded for the first time, the scheduled task execution frequency update instruction is used to initialize the scheduled task execution frequency; for scheduled tasks whose execution frequency has been determined, the scheduled task execution frequency update instruction can be used to change the scheduled task execution frequency according to specific business needs.

Optionally, the scheduled task execution frequency is input by the user in real time according to actual business needs, or it can be automatically generated according to a preset scheduled task execution frequency comparison table. Among them, the preset scheduled task execution frequency comparison table is pre-set according to the business volume and system carrying capacity. Among them, the system carrying capacity includes the storage capacity and computing capacity of the system. The scheduled task execution frequency can be a specific value or a range of values, that is, a certain business volume and system carrying capacity can limit the scheduled task execution frequency to a range of values, and the scheduled task execution frequency can be any value within the range of values. The specific value of the scheduled task execution frequency is not limited here and is determined according to actual conditions.

S220: Setting the execution frequency of the scheduled task according to the execution frequency update instruction.

The scheduled task execution frequency update instruction includes a scheduled task identifier and a target scheduled task execution frequency. The target scheduled task is set to the target scheduled task execution frequency according to the scheduled task identifier in the scheduled task execution frequency update instruction. The target scheduled task execution frequency is the expected scheduled task execution frequency after the change.

S230. In response to a scheduled task start request, take out a first number of messages from a message queue; wherein the first number is the same as the number of shard tasks of the scheduled task.

S240: Process the message through the sharding task.

The technical solution provided in the embodiment of the present invention obtains a scheduled task execution frequency update instruction; and sets the execution frequency of the scheduled task according to the execution frequency update instruction. In response to a scheduled task start request, a first number of messages are taken out from a message queue; wherein the first number is the same as the number of shard tasks of the scheduled task; and the messages are processed by the shard tasks. The technical solution provided in the embodiment of the present invention can control the message consumption speed of the message queue by combining the message queue with the scheduled task sharding, and by controlling the execution frequency of the scheduled task and the number of shard tasks of the scheduled task, thereby simplifying the implementation method of the message consumption speed control.

Embodiment 3

Fig. 3 is a schematic diagram of the structure of a message queue consumption speed control device provided by Embodiment 3 of the present invention. This embodiment is applicable to the case of controlling the consumption speed of a message queue. The device can be implemented by software and/or hardware and can be configured in an electronic device.

As shown in FIG. 3 , the device may include: a message retrieving module 310 and a message processing module 320 .

The message fetching module 310 is used to fetch a first number of messages from the message queue in response to a scheduled task start request; wherein the first number is the same as the number of shard tasks of the scheduled task.

The message processing module 320 is used to process the message through the sharding task.

The technical solution provided by the embodiment of the present invention, in response to a scheduled task start request, takes out a first number of messages from a message queue; wherein the first number is the same as the number of shard tasks of the scheduled task; and the messages are processed by the shard tasks. The technical solution provided by the embodiment of the present invention combines the message queue with the scheduled task sharding, and controls the consumption speed of the message queue by controlling the number of shard tasks of the scheduled task, thereby reducing the implementation complexity of the method for controlling the consumption speed of the message queue, and can effectively control the number of message consumption threads.

Optionally, the device further includes: a shard task quantity update instruction acquisition module, which is used to acquire a shard task quantity update instruction before taking out a first number of messages from the message queue in response to the scheduled task start request. A scheduled task sharding module is used to slice the scheduled task into a second number of shard tasks according to the shard task quantity update instruction; wherein the first number is equal to the second number.

Optionally, a business data classification module is used to classify the business data according to the business attribute information and obtain the classification result before taking out the first number of messages from the message queue in response to the scheduled task start request. A classification result storage module is used to store the classification result as a message in the message queue; wherein the classification results stored in the same message queue belong to the same business attribute.

Optionally, the device further comprises: an execution frequency update instruction acquisition module, used to acquire a scheduled task execution frequency update instruction before taking out a first number of messages from a message queue in response to a scheduled task start request. An execution frequency setting module, used to set the execution frequency of the scheduled task according to the execution frequency update instruction.

Optionally, the message queue is a redis message queue.

Optionally, the message queue stores overdue payment bill data.

Optionally, the scheduled task is used to calculate penalty interest on the overdue payment bill data at set time intervals.

The message queue consumption speed control device provided in the embodiment of the present invention can execute the message queue consumption speed control method provided in any embodiment of the present invention, and has the corresponding functional modules and beneficial effects for executing the message queue consumption speed control method.

Embodiment 4

According to an embodiment of the present invention, the present invention also provides an electronic device and a readable storage medium.

Fig. 4 is a schematic diagram of the structure of an electronic device for implementing the consumption speed control method of the message queue of an embodiment of the present invention. The electronic device is intended to represent various forms of digital computers, such as laptop computers, desktop computers, workbenches, personal digital assistants, servers, blade servers, mainframe computers, and other suitable computers. The electronic device can also represent various forms of mobile devices, such as personal digital processing, cellular phones, smart phones, wearable electronic devices and other similar computing devices. The components shown herein, their connections and relationships, and their functions are merely examples and are not intended to limit the implementation of the embodiments of the present invention described and/or required herein.

As shown in Figure 4, the electronic device includes: one or more processors 410, a memory 420, and interfaces for connecting various components, including high-speed interfaces and low-speed interfaces. The various components are connected to each other using different buses and can be installed on a common mainboard or installed in other ways as needed. The processor can process instructions executed in the electronic device, including instructions stored in or on the memory to display graphical information of the GUI on an external input/output device (such as a display electronic device coupled to the interface). In other embodiments, if necessary, multiple processors and/or multiple buses can be used together with multiple memories and multiple memories. Similarly, multiple electronic devices can be connected, and each electronic device provides some necessary operations (for example, as an electronic device array, a group of blade-type electronic devices, or a multi-processor system). A processor 410 is taken as an example in Figure 4.

The memory 420 is a non-transient computer-readable storage medium provided in an embodiment of the present invention. The memory stores instructions executable by at least one processor to enable at least one processor to execute the method for controlling the consumption speed of a message queue provided in an embodiment of the present invention. The non-transient computer-readable storage medium of an embodiment of the present invention stores computer instructions, which are used to enable a computer to execute the method for controlling the consumption speed of a message queue provided in an embodiment of the present invention.

The memory 420, as a non-transient computer-readable storage medium, can be used to store non-transient software programs, non-transient computer executable programs and modules, such as program instructions/modules corresponding to the method for controlling the consumption speed of a message queue provided in an embodiment of the present invention (for example, the message retrieval module 310 and the message processing module 320 shown in FIG. 3 ). The processor 410 executes various functional applications and data processing of the electronic device by running the non-transient software programs, instructions and modules stored in the memory 420, that is, implements the method for controlling the consumption speed of a message queue provided in the above method embodiment.

The memory 420 may include a program storage area and a data storage area, wherein the program storage area may store an operating system, an application required by at least one function; the data storage area may store data created by the use of an electronic device that implements the method for controlling the consumption speed of a message queue, etc. In addition, the memory 420 may include a high-speed random access memory, and may also include a non-transient memory, such as at least one disk storage device, a flash memory device, or other non-transient solid-state storage device. In some embodiments, the memory 420 may optionally include a memory remotely arranged relative to the processor 410, and these remote memories may be connected to the electronic device that executes the method for controlling the consumption speed of a message queue via a network. Examples of the above-mentioned network include, but are not limited to, the Internet, an intranet, a local area network, a mobile communication network, and combinations thereof.

The electronic device executing the message queue consumption speed control method may further include: an input device 430 and an output device 440. The processor 410, the memory 420, the input device 430 and the output device 440 may be connected via a bus or other means, and FIG4 takes the bus connection as an example.

The input device 430 can receive input digital or character information, and generate key signal input related to user settings and function control of the electronic device that executes the consumption speed control method of the message queue, such as a touch screen, a keypad, a mouse, a track pad, a touch pad, an indicator rod, one or more mouse buttons, a trackball, a joystick and other input devices. The output device 440 may include a display electronic device, an auxiliary lighting device (e.g., an LED) and a tactile feedback device (e.g., a vibration motor), etc. The display electronic device may include, but is not limited to, a liquid crystal display (LCD), a light emitting diode (LED) display and a plasma display. In some embodiments, the display electronic device may be a touch screen.

Various implementations of the systems and techniques described herein can be realized in digital electronic circuit systems, integrated circuit systems, dedicated ASICs (application specific integrated circuits), computer hardware, firmware, software, and/or combinations thereof. These various implementations may include: being implemented in one or more computer programs that can be executed and/or interpreted on a programmable system including at least one programmable processor, which can be a special purpose or general purpose programmable processor that can receive data and instructions from a storage system, at least one input device, and at least one output device, and transmit data and instructions to the storage system, the at least one input device, and the at least one output device.

These computer programs (also referred to as programs, software, software applications, or code) include machine instructions for programmable processors and can be implemented using high-level procedural and/or object-oriented programming languages, and/or assembly/machine languages. As used herein, the terms "machine-readable medium" and "computer-readable medium" refer to any computer program product, electronic device, and/or device (e.g., disk, optical disk, memory, programmable logic device (PLD)) for providing machine instructions and/or data to a programmable processor, including a machine-readable medium that receives machine instructions as a machine-readable signal. The term "machine-readable signal" refers to any signal for providing machine instructions and/or data to a programmable processor.

To provide interaction with a user, the systems and techniques described herein can be implemented on a computer having: a display device (e.g., a CRT (cathode ray tube) or LCD (liquid crystal display) monitor) for displaying information to the user; and a keyboard and pointing device (e.g., a mouse or trackball) through which the user can provide input to the computer. Other types of devices can also be used to provide interaction with the user; for example, the feedback provided to the user can be any form of sensory feedback (e.g., visual feedback, auditory feedback, or tactile feedback); and input from the user can be received in any form (including acoustic input, voice input, or tactile input).

The systems and techniques described herein can be implemented in a computing system that includes backend components (e.g., as a data server), or a computing system that includes middleware components (e.g., an application server), or a computing system that includes frontend components (e.g., a user computer with a graphical user interface or a web browser through which a user can interact with implementations of the systems and techniques described herein), or a computing system that includes any combination of such backend components, middleware components, or frontend components. The components of the system can be interconnected by any form or medium of digital data communication (e.g., a communication network). Examples of communication networks include: a local area network (LAN), a wide area network (WAN), the Internet, and a blockchain network.

A computer system may include clients and servers. Clients and servers are generally remote from each other and usually interact through a communication network. The relationship of client and server is generated by computer programs running on respective computers and having a client-server relationship to each other.

It should be understood that the various forms of processes shown above can be used to reorder, add or delete steps. For example, the steps recorded in the embodiments of the present invention can be executed in parallel, sequentially or in different orders, as long as the expected results of the technical solutions disclosed in the embodiments of the present invention can be achieved, and this document does not limit them here.

The above specific implementations do not constitute a limitation on the protection scope of the embodiments of the present invention. It should be understood by those skilled in the art that various modifications, combinations, sub-combinations and substitutions can be made according to design requirements and other factors. Any modifications, equivalent substitutions and improvements made within the spirit and principles of the embodiments of the present invention should be included in the protection scope of the embodiments of the present invention.

Note that the above are only preferred embodiments of the present invention and the technical principles used. Those skilled in the art will understand that the present invention is not limited to the specific embodiments described herein, and that various obvious changes, readjustments and substitutions can be made by those skilled in the art without departing from the scope of protection of the present invention. Therefore, although the present invention has been described in more detail through the above embodiments, the present invention is not limited to the above embodiments, and may include more other equivalent embodiments without departing from the concept of the present invention, and the scope of the present invention is determined by the scope of the appended claims.

Claims (8)

1. A method for controlling the consumption rate of a message queue, comprising:

Acquiring a segmentation task number updating instruction, wherein the segmentation task number updating instruction is input by a user and/or is automatically generated according to a preset segmentation task number comparison table, and the preset segmentation task number comparison table is preset according to the traffic and the system bearing capacity; according to the segmentation task quantity updating instruction, segmenting the timing task into a second quantity of segmentation tasks; wherein the first number is equal to the second number;

Acquiring a timing task execution frequency updating instruction, wherein the timing task execution frequency updating instruction is used for changing the timing task execution frequency, the timing task execution frequency is automatically generated according to a preset timing task execution frequency comparison table, and the preset timing task execution frequency comparison table is preset according to the traffic volume and the system bearing capacity;

Setting the execution frequency of the timing task according to the execution frequency updating instruction;

Retrieving a first number of messages from the message queue in response to the timed task initiation request; wherein the first number is the same as the number of fragmented tasks of the timed task;

and processing the message through the slicing task.

2. The method of claim 1, further comprising, prior to said retrieving a first number of messages from the message queue in response to the timed task initiation request:

Classifying the service data according to the service attribute information, and obtaining a classification result;

storing the classification result as a message into the message queue; wherein the service attributes of the classification results stored in the same message queue are the same.

3. The method of claim 1, wherein the message queue is a redis message queue.

4. The method of claim 2, wherein the message queue stores overdue payback billing data.

5. The method of claim 1 or 4, wherein the timing task is used to perform default interest calculations on the overdue bill data at set time intervals.

6. A consumption rate control device for a message queue, comprising:

A message fetching module, configured to fetch a first number of messages from a message queue in response to a timed task initiation request; wherein the first number is the same as the number of fragmented tasks of the timed task;

The message processing module is used for processing the message through the slicing task;

The system comprises a segmentation task number updating instruction acquisition module, a segmentation task number updating module and a segmentation task number updating module, wherein the segmentation task number updating instruction is input by a user and/or is automatically generated according to a preset segmentation task number comparison table, and the preset segmentation task number comparison table is preset according to the traffic volume and the system bearing capacity;

According to the segmentation task quantity updating instruction, segmenting the timing task into a second quantity of segmentation tasks; wherein the first number is equal to the second number;

The timing task execution frequency updating instruction is used for changing the timing task execution frequency, the timing task execution frequency is automatically generated according to a preset timing task execution frequency comparison table, and the preset timing task execution frequency comparison table is preset according to the traffic volume and the system bearing capacity;

and the execution frequency setting module is used for setting the execution frequency of the timing task according to the execution frequency updating instruction.

7. An electronic device, the electronic device comprising:

One or more processors;

A memory for storing one or more programs;

the one or more programs, when executed by the one or more processors, cause the one or more processors to implement the consumption rate control method of a message queue of any one of claims 1-5.

8. A non-transitory computer readable storage medium storing computer instructions for causing the computer to perform the method of consumption rate control of a message queue of any one of claims 1-5.