CN113704358A - Distributed task cooperative processing method and device and computer equipment - Google Patents
Distributed task cooperative processing method and device and computer equipment Download PDFInfo
- Publication number
- CN113704358A CN113704358A CN202111025568.5A CN202111025568A CN113704358A CN 113704358 A CN113704358 A CN 113704358A CN 202111025568 A CN202111025568 A CN 202111025568A CN 113704358 A CN113704358 A CN 113704358A
- Authority
- CN
- China
- Prior art keywords
- task
- distributed
- preset
- processing
- distributed database
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
- 238000003672 processing method Methods 0.000 title claims abstract description 31
- 238000012544 monitoring process Methods 0.000 claims abstract description 25
- 230000007246 mechanism Effects 0.000 claims description 16
- 238000004590 computer program Methods 0.000 claims description 9
- 238000004458 analytical method Methods 0.000 claims description 3
- 238000004891 communication Methods 0.000 claims 1
- 238000000034 method Methods 0.000 abstract description 13
- 230000008569 process Effects 0.000 abstract description 6
- 238000010586 diagram Methods 0.000 description 9
- 230000006870 function Effects 0.000 description 9
- 238000012423 maintenance Methods 0.000 description 2
- 238000006467 substitution reaction Methods 0.000 description 2
- 230000003287 optical effect Effects 0.000 description 1
- 230000004044 response Effects 0.000 description 1
- 239000007787 solid Substances 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/27—Replication, distribution or synchronisation of data between databases or within a distributed database system; Distributed database system architectures therefor
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/24—Querying
- G06F16/245—Query processing
- G06F16/2458—Special types of queries, e.g. statistical queries, fuzzy queries or distributed queries
- G06F16/2471—Distributed queries
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- Databases & Information Systems (AREA)
- General Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- Data Mining & Analysis (AREA)
- Computing Systems (AREA)
- Fuzzy Systems (AREA)
- Mathematical Physics (AREA)
- Probability & Statistics with Applications (AREA)
- Software Systems (AREA)
- Computational Linguistics (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention provides a distributed task cooperative processing method, a distributed task cooperative processing device and computer equipment, which are applied to a cluster consisting of a plurality of nodes for processing tasks and a distributed database connected with the nodes, wherein the method comprises the following steps: when the current node is a main node, receiving task request information of a client; analyzing the task request information to obtain corresponding task identification and task detail information; the task identifier and the task detail information are issued to a task with a preset prefix to a distributed database according to a first preset rule; and monitoring a processing result of a task with a preset prefix in the distributed database, and sending the processing result to the client. The invention receives the task request of the client through the main node, analyzes the task request and then issues the task with the preset prefix to the distributed database, so that the nodes in the cluster can cooperatively process the task with the preset prefix, thereby improving the task processing speed, and the cluster nodes are simple to deploy and easy to operate and maintain.
Description
Technical Field
The present invention relates to the field of computers, and in particular, to a distributed task cooperative processing method, apparatus, computer device, and readable storage medium.
Background
In the prior art, distributed task cooperative processing is generally realized based on distributed consistency software, multiple applications are biased to heavy applications, dependence is more, and used consistency algorithms are complex and difficult to understand, so that deployment, maintenance and use of the distributed task cooperative processing are complex.
Disclosure of Invention
In view of the above problems, the present invention provides a distributed task cooperative processing method, apparatus, computer device and readable storage medium, so as to improve the speed of task processing, and the cluster nodes are simple to deploy and easy to operate and maintain.
In order to achieve the purpose, the invention adopts the following technical scheme:
a distributed task cooperative processing method is applied to a cluster consisting of a plurality of nodes for processing tasks and a distributed database connected with the nodes, and comprises the following steps:
when the current node is a main node, receiving task request information of a client;
analyzing the task request information to obtain corresponding task identification and task detail information;
the task identifier and the task detail information are issued to a task with a preset prefix to the distributed database according to a first preset rule;
and monitoring a processing result of the task with the preset prefix in the distributed database, and sending the processing result to the client.
Preferably, the distributed task cooperative processing method further includes:
when the current node is a master node or a slave node, acquiring a current task with the preset prefix from the distributed database by using a preset monitoring mechanism;
and after processing the current task and obtaining a current processing result, issuing the current processing result and the current node name to the distributed database according to a second preset rule, wherein the prefix is the task processing result of combining the preset prefix with the task identifier.
Preferably, the distributed task cooperative processing method further includes:
and when the current node is a master node, sending the processing results of all the slave nodes to the client, and then sending an instruction to delete the task with the preset prefix in the distributed database.
Preferably, in the distributed task cooperative processing method, the distributed database is an ETCD distributed key value database.
Preferably, in the distributed task cooperative processing method, the first preset rule is that the task identifier is used as a key, and the task details are used as values;
the second preset rule is that the current node name is used as a key, and the current processing result is a value.
Preferably, in the distributed task cooperative processing method, the preset prefix is/tasks, and the preset monitoring mechanism is an ETCD Watch monitoring mechanism.
Preferably, in the distributed task cooperative processing method, when a current node is a master node and a fault occurs, a new master node is selected from the cluster according to an ETCD election mechanism, and the new master node communicates with the client.
The invention also provides a distributed task cooperative processing device, which is applied to a cluster consisting of a plurality of nodes for processing tasks and a distributed database connected with the nodes, and comprises:
the task request receiving module is used for receiving task request information of the client when the current node is a main node;
the task analysis processing module is used for analyzing and processing the task request information to obtain corresponding task identification and task detail information;
the task issuing module is used for issuing a task with a preset prefix to the distributed database according to a first preset rule by the task identifier and the task detail information;
and the processing result monitoring module is used for monitoring the processing result of the task with the preset prefix in the distributed database and sending the processing result to the client.
The invention also provides computer equipment which comprises a memory and a processor, wherein the memory stores a computer program, and the computer program executes the distributed task cooperative processing method when running on the processor.
The invention also provides a readable storage medium storing a computer program which, when running on a processor, executes the distributed task co-processing method.
The invention provides a distributed task cooperative processing method, which is applied to a cluster consisting of a plurality of nodes for processing tasks and a distributed database connected with the nodes, and comprises the following steps: when the current node is a main node, receiving task request information of a client; analyzing the task request information to obtain corresponding task identification and task detail information; the task identifier and the task detail information are issued to a task with a preset prefix to the distributed database according to a first preset rule; and monitoring a processing result of the task with the preset prefix in the distributed database, and sending the processing result to the client. According to the distributed task cooperative processing method, the main node receives the task request of the client, analyzes the task request and then issues the task with the preset prefix to the distributed database, so that the nodes in the cluster cooperatively process the task with the preset prefix, the main node monitors the processing result of the nodes in the cluster and sends the processing result to the client, and therefore the task processing speed is improved, the cluster nodes are simple to deploy, and operation and maintenance are easy.
In order to make the aforementioned and other objects, features and advantages of the present invention comprehensible, preferred embodiments accompanied with figures are described in detail below.
Drawings
In order to more clearly illustrate the technical solution of the present invention, the drawings required to be used in the embodiments will be briefly described below, and it should be understood that the following drawings only illustrate some embodiments of the present invention, and therefore should not be considered as limiting the scope of the present invention. Like components are numbered similarly in the various figures.
Fig. 1 is a flowchart of a distributed task cooperative processing method provided in embodiment 1 of the present invention;
fig. 2 is a schematic structural diagram of a distributed task processing cluster according to embodiment 1 of the present invention;
fig. 3 is a flowchart of a distributed task cooperative processing method according to embodiment 2 of the present invention;
fig. 4 is a flowchart of another distributed task cooperative processing method provided in embodiment 2 of the present invention;
fig. 5 is a schematic structural diagram of a distributed task cooperative processing apparatus according to embodiment 3 of the present invention;
fig. 6 is a schematic structural diagram of another distributed task cooperative processing apparatus according to embodiment 3 of the present invention.
Detailed Description
The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments.
The components of embodiments of the present invention generally described and illustrated in the figures herein may be arranged and designed in a wide variety of different configurations. Thus, the following detailed description of the embodiments of the present invention, presented in the figures, is not intended to limit the scope of the invention, as claimed, but is merely representative of selected embodiments of the invention. All other embodiments, which can be derived by a person skilled in the art from the embodiments of the present invention without making any creative effort, shall fall within the protection scope of the present invention.
Hereinafter, the terms "including", "having", and their derivatives, which may be used in various embodiments of the present invention, are only intended to indicate specific features, numbers, steps, operations, elements, components, or combinations of the foregoing, and should not be construed as first excluding the existence of, or adding to, one or more other features, numbers, steps, operations, elements, components, or combinations of the foregoing.
Furthermore, the terms "first," "second," "third," and the like are used solely to distinguish one from another and are not to be construed as indicating or implying relative importance.
Unless otherwise defined, all terms (including technical and scientific terms) used herein have the same meaning as commonly understood by one of ordinary skill in the art to which various embodiments of the present invention belong. The terms (such as those defined in commonly used dictionaries) should be interpreted as having a meaning that is consistent with their contextual meaning in the relevant art and will not be interpreted in an idealized or overly formal sense unless expressly so defined herein in various embodiments of the present invention.
Example 1
Fig. 1 is a flowchart of a distributed task cooperative processing method provided in embodiment 1 of the present invention, which is applied to a cluster composed of a plurality of nodes for processing tasks and a distributed database connected to the plurality of nodes, and includes the following steps:
step S11: and when the current node is the main node, receiving task request information of the client.
In this embodiment of the present invention, as shown in fig. 2, a distributed task processing cluster is a schematic structural diagram, where the cluster 200 includes a distributed database group 210, a master node 220 connected to the distributed database group 210, and a plurality of slave nodes 230, and the master node 220 is communicatively connected to a cluster external client 201 to receive a task request.
In the embodiment of the present invention, a cluster for distributed task processing includes a plurality of nodes, where the nodes are physical machines, such as computer devices or servers, running a task processing process, and returning a processing result to a distributed database after processing a new task by monitoring and acquiring the new task in a distributed database group, so as to complete a distributed cooperative processing process. And selecting a main node from the plurality of nodes according to a preset rule, and receiving task request information sent by a client outside the cluster through the main node.
Step S12: and analyzing the task request information to obtain corresponding task identification and task detail information.
In the embodiment of the invention, when the current node is a main node, after the task request information sent by the client is received, the task request information is analyzed to obtain the corresponding task identifier and the task detail information in the task request information. And when the node is used as a main node in the cluster, the node is allowed to start, and the task request information is analyzed.
Step S13: and issuing a task with a preset prefix to the distributed database according to the task identifier and the task detail information according to a first preset rule.
In the embodiment of the present invention, an application program based on a first preset rule may be set in a computer device as a node, and after the task identifier and the task detail information are analyzed when the current node is a master node, the task identifier and the task detail information may be input to the application program to obtain a task with a preset prefix. After the task with the preset prefix is obtained, the main node issues the task with the preset prefix to the distributed database. The distributed database comprises an ETCD (electronic toll collection) distributed key value database, wherein the ETCD is a high-availability and strong-consistency distributed key value database, is generally deployed in a cluster, is mainly used for configuration sharing, and has the characteristics of light weight, easiness in deployment and use, quick response and the like. And the first preset rule is that the task identifier is used as a key and the task detail is used as a value.
Step S14: and monitoring a processing result of the task with the preset prefix in the distributed database, and sending the processing result to the client.
In the embodiment of the invention, after the main node issues the task on the distributed database, the processing result in the distributed database is obtained in a monitoring mode. And the slave node acquires the processing result generated by the task processing from the distributed database and then returns the processing result to the distributed database, so that the master node acquires the processing result and then sends the processing result to the client to complete the whole distributed task cooperative processing process.
In the embodiment of the invention, the main node receives the task request of the client, analyzes the task request and then issues the task with the preset prefix to the distributed database, so that the nodes in the cluster cooperatively process the task with the preset prefix, and the main node monitors the processing result of the nodes in the cluster and sends the processing result to the client, thereby improving the task processing speed, and the cluster nodes are simple to deploy and easy to operate and maintain.
Example 2
Fig. 3 is a flowchart of a distributed task cooperative processing method provided in embodiment 2 of the present invention, where the method includes the following steps:
step S31: and when the current node is the main node, receiving task request information of the client.
This step is identical to step S11 described above, and will not be described herein again.
Step S32: and analyzing the task request information to obtain corresponding task identification and task detail information.
This step is identical to step S12 described above, and will not be described herein again.
Step S33: and issuing a task with a preset prefix to the distributed database according to the task identifier and the task detail information according to a first preset rule.
This step is identical to step S13 described above, and will not be described herein again.
Step S34: and monitoring a processing result of the task with the preset prefix in the distributed database, and sending the processing result to the client.
This step is identical to step S14 described above, and will not be described herein again.
Step S35: and when the current node is a master node or a slave node, acquiring the current task with the preset prefix from the distributed database by using a preset monitoring mechanism.
In the embodiment of the present invention, after a preset prefix task is issued to a distributed database, all nodes in a cluster processed by distributed tasks acquire a current task with a preset prefix from the distributed database by using a preset monitoring mechanism, where when the distributed database is an ETCD distributed key value database, the preset monitoring mechanism is an ETCD Watch monitoring mechanism, and the preset prefix is/deskks, which is an example of one of the prefixes, and this is not limited here.
Step S36: and after processing the current task and obtaining a current processing result, issuing the current processing result and the current node name to the distributed database according to a second preset rule, wherein the prefix is the task processing result of combining the preset prefix with the task identifier.
In the embodiment of the present invention, all nodes in the cluster are provided with an application program based on the second preset rule, and after processing the current task and obtaining the current processing result, the node may input the current processing result to the application program, complete the task processing of the preset prefix, and issue the task processing to the distributed database. When the distributed database is an ETCD distributed key value database, a second preset rule takes the current node name as a key and takes the current processing result as a value. When the preset prefix is/tasks, the prefix of the task processing result is/tasks 1, where the/task 1 is a task identifier, and the/task 1 is an example of one of the task identifiers, which is not limited herein.
Fig. 4 is a flowchart of another distributed task cooperative processing method provided in embodiment 2 of the present invention, where the method further includes the following steps:
step S37: and when the current node is a master node, sending the processing results of all the slave nodes to the client, and then sending an instruction to delete the task with the preset prefix in the distributed database.
In the embodiment of the invention, the distributed database is an ETCD distributed key value database. The first preset rule is that the task identification is used as a key, and the task detail is used as a value; the second preset rule is that the current node name is used as a key, and the current processing result is a value. The preset prefix is/tasks, and the preset monitoring mechanism is an ETCD Watch monitoring mechanism. And when the current node is a main node and has a fault, selecting a new main node from the cluster according to an ETCD election mechanism, and communicating with the client through the new main node.
Example 3
Fig. 5 is a schematic structural diagram of a distributed task cooperative processing apparatus according to embodiment 3 of the present invention.
The distributed task cooperative processing apparatus 500 includes:
a task request receiving module 510, configured to receive task request information of a client when a current node is a master node;
a task analysis processing module 520, configured to analyze the task request information to obtain a corresponding task identifier and task detail information;
a task issuing module 530, configured to issue a task with a preset prefix to the distributed database according to a first preset rule for the task identifier and the task detail information;
and the processing result monitoring module 540 is configured to monitor a processing result of the task with the preset prefix in the distributed database, and send the processing result to the client.
As shown in fig. 6, the distributed task cooperative processing apparatus 500 further includes:
a task monitoring module 550, configured to, when the current node is a master node or a slave node, obtain a current task with the preset prefix from the distributed database by using a preset monitoring mechanism;
and the processing result issuing module 560 is configured to, after processing the current task and obtaining a current processing result, issue, according to a second preset rule, a task processing result with a prefix being the preset prefix and a task identifier to the distributed database.
In the embodiment of the present invention, for more detailed description of functions of the modules, reference may be made to contents of corresponding parts in the foregoing embodiment, which are not described herein again.
In addition, the invention also provides computer equipment which can comprise a smart phone, a tablet computer, a vehicle-mounted computer, intelligent wearable equipment and the like. The computer device comprises a memory and a processor, wherein the memory can be used for storing a computer program, and the processor executes the computer program to enable the computer device to execute the functions of the method or the modules in the distributed task cooperative processing device.
The memory may include a storage program area and a storage data area, wherein the storage program area may store an operating system, an application program required for at least one function (such as a sound playing function, an image playing function, etc.), and the like; the storage data area may store data (such as audio data, a phonebook, etc.) created according to the use of the computer device, and the like. Further, the memory may include high speed random access memory, and may also include non-volatile memory, such as at least one magnetic disk storage device, flash memory device, or other volatile solid state storage device.
The embodiment also provides a computer storage medium for storing a computer program used in the computer device.
In the embodiments provided in the present application, it should be understood that the disclosed apparatus and method can be implemented in other ways. The apparatus embodiments described above are merely illustrative and, for example, the flowchart and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of apparatus, methods and computer program products according to various embodiments of the present invention. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
In addition, each functional module or unit in each embodiment of the present invention may be integrated together to form an independent part, or each module may exist separately, or two or more modules may be integrated to form an independent part.
The functions, if implemented in the form of software functional modules and sold or used as a stand-alone product, may be stored in a computer readable storage medium. Based on such understanding, the technical solution of the present invention or a part of the technical solution that contributes to the prior art in essence can be embodied in the form of a software product, which is stored in a storage medium and includes instructions for causing a computer device (which may be a smart phone, a personal computer, a server, or a network device, etc.) to execute all or part of the steps of the method according to the embodiments of the present invention. And the aforementioned storage medium includes: various media capable of storing program codes, such as a usb disk, a removable hard disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a magnetic disk, or an optical disk.
The above description is only for the specific embodiments of the present invention, but the scope of the present invention is not limited thereto, and any person skilled in the art can easily conceive of the changes or substitutions within the technical scope of the present invention, and all the changes or substitutions should be covered within the scope of the present invention. Therefore, the protection scope of the present invention shall be subject to the protection scope of the claims.
Claims (10)
1. A distributed task cooperative processing method is applied to a cluster consisting of a plurality of nodes for processing tasks and a distributed database connected with the nodes, and comprises the following steps:
when the current node is a main node, receiving task request information of a client;
analyzing the task request information to obtain corresponding task identification and task detail information;
the task identifier and the task detail information are issued to a task with a preset prefix to the distributed database according to a first preset rule;
and monitoring a processing result of the task with the preset prefix in the distributed database, and sending the processing result to the client.
2. The distributed task cooperative processing method according to claim 1, further comprising:
when the current node is a master node or a slave node, acquiring a current task with the preset prefix from the distributed database by using a preset monitoring mechanism;
and after processing the current task and obtaining a current processing result, issuing the current processing result and the current node name to the distributed database according to a second preset rule, wherein the prefix is the task processing result of combining the preset prefix with the task identifier.
3. The distributed task cooperative processing method according to claim 1, further comprising:
and when the current node is a master node, sending the processing results of all the slave nodes to the client, and then sending an instruction to delete the task with the preset prefix in the distributed database.
4. The distributed task cooperative processing method according to any one of claims 1 to 3, wherein the distributed database is an ETCD distributed key value database.
5. The distributed task cooperative processing method according to claim 2, wherein the first preset rule is that the task identifier is used as a key and the task details are used as values;
the second preset rule is that the current node name is used as a key, and the current processing result is a value.
6. The distributed task cooperative processing method according to claim 4, wherein the preset prefix is/tasks, and the preset snooping mechanism is an ETCD Watch snooping mechanism.
7. The distributed task cooperative processing method according to claim 4, wherein when a current node is a master node and a failure occurs, a new master node is selected from the cluster according to an ETCD election mechanism, and communication with the client is performed through the new master node.
8. A distributed task cooperative processing apparatus, applied to a cluster composed of a plurality of nodes for processing tasks and a distributed database connected to the plurality of nodes, the apparatus comprising:
the task request receiving module is used for receiving task request information of the client when the current node is a main node;
the task analysis processing module is used for analyzing and processing the task request information to obtain corresponding task identification and task detail information;
the task issuing module is used for issuing a task with a preset prefix to the distributed database according to a first preset rule by the task identifier and the task detail information;
and the processing result monitoring module is used for monitoring the processing result of the task with the preset prefix in the distributed database and sending the processing result to the client.
9. A computer device comprising a memory and a processor, the memory storing a computer program which, when run on the processor, performs the distributed task co-processing method according to any one of claims 1 to 7.
10. A readable storage medium, characterized in that it stores a computer program which, when run on a processor, performs the distributed task co-processing method of any one of claims 1 to 7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111025568.5A CN113704358A (en) | 2021-09-02 | 2021-09-02 | Distributed task cooperative processing method and device and computer equipment |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111025568.5A CN113704358A (en) | 2021-09-02 | 2021-09-02 | Distributed task cooperative processing method and device and computer equipment |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN113704358A true CN113704358A (en) | 2021-11-26 |
Family
ID=78658926
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202111025568.5A Pending CN113704358A (en) | 2021-09-02 | 2021-09-02 | Distributed task cooperative processing method and device and computer equipment |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113704358A (en) |
Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JPH1153326A (en) * | 1997-07-30 | 1999-02-26 | Internatl Business Mach Corp <Ibm> | Distribution processing system, client node, server node and distribution processing method |
| WO2013077787A1 (en) * | 2011-11-23 | 2013-05-30 | Telefonaktiebolaget Lm Ericsson (Publ) | Method and apparatus for distributed processing tasks |
| CN107872473A (en) * | 2016-09-23 | 2018-04-03 | 阿里巴巴集团控股有限公司 | Message treatment method, device and system |
| WO2018210401A1 (en) * | 2017-05-15 | 2018-11-22 | Telefonaktiebolaget Lm Ericsson (Publ) | Topic handling in mqtt networks |
| CN110134505A (en) * | 2019-05-15 | 2019-08-16 | 湖南麒麟信安科技有限公司 | A kind of distributed computing method of group system, system and medium |
| CN111666138A (en) * | 2020-05-19 | 2020-09-15 | 微民保险代理有限公司 | Timed task processing method, device and system, computer equipment and storage medium |
| WO2020253079A1 (en) * | 2019-06-17 | 2020-12-24 | 平安科技（深圳）有限公司 | Jmeter-based distributed performance test method and apparatus, device, and storage medium |
| CN112231108A (en) * | 2020-11-02 | 2021-01-15 | 网易（杭州）网络有限公司 | Task processing method and device, computer readable storage medium and server |
-
2021
- 2021-09-02 CN CN202111025568.5A patent/CN113704358A/en active Pending
Patent Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JPH1153326A (en) * | 1997-07-30 | 1999-02-26 | Internatl Business Mach Corp <Ibm> | Distribution processing system, client node, server node and distribution processing method |
| WO2013077787A1 (en) * | 2011-11-23 | 2013-05-30 | Telefonaktiebolaget Lm Ericsson (Publ) | Method and apparatus for distributed processing tasks |
| CN107872473A (en) * | 2016-09-23 | 2018-04-03 | 阿里巴巴集团控股有限公司 | Message treatment method, device and system |
| WO2018210401A1 (en) * | 2017-05-15 | 2018-11-22 | Telefonaktiebolaget Lm Ericsson (Publ) | Topic handling in mqtt networks |
| CN110134505A (en) * | 2019-05-15 | 2019-08-16 | 湖南麒麟信安科技有限公司 | A kind of distributed computing method of group system, system and medium |
| WO2020253079A1 (en) * | 2019-06-17 | 2020-12-24 | 平安科技（深圳）有限公司 | Jmeter-based distributed performance test method and apparatus, device, and storage medium |
| CN111666138A (en) * | 2020-05-19 | 2020-09-15 | 微民保险代理有限公司 | Timed task processing method, device and system, computer equipment and storage medium |
| CN112231108A (en) * | 2020-11-02 | 2021-01-15 | 网易（杭州）网络有限公司 | Task processing method and device, computer readable storage medium and server |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111831548B (en) | Dependency relationship topological graph drawing method and device | |
| CN108900353B (en) | Fault warning method and terminal equipment | |
| US20170344433A1 (en) | Apparatus and method for data migration | |
| US20160147622A1 (en) | Enhanced error detection in data synchronization operations | |
| CN109298835B (en) | Data archiving processing method, device, equipment and storage medium of block chain | |
| CN111756706A (en) | Abnormal flow detection method and device and storage medium | |
| CN105512283A (en) | Data quality management and control method and device | |
| CN105786950A (en) | Method and device for processing data | |
| CN107832169B (en) | Memory data migration method and device, terminal equipment and storage medium | |
| CN108289034A (en) | A kind of fault discovery method and apparatus | |
| CN110737719A (en) | Data synchronization method, device, equipment and computer readable storage medium | |
| CN109698814B (en) | Botnet discovery method and botnet discovery device | |
| CN108875035B (en) | Data storage method of distributed file system and related equipment | |
| CN109359109B (en) | Data processing method and system based on distributed stream computing | |
| CN111884843B (en) | Message processing method and device, electronic equipment and storage medium | |
| CN110196780B (en) | Method, device, storage medium and electronic device for determining server state | |
| CN110069406B (en) | Automatic triggering TPC-DS test method and system | |
| WO2015139565A1 (en) | Heterogeneous logging system management configuration | |
| CN110442439B (en) | Task process processing method and device and computer equipment | |
| CN106021576A (en) | Information processing method, association plug-in, WEB server and system | |
| CN112416385A (en) | Acquisition component management method and system | |
| CN113704358A (en) | Distributed task cooperative processing method and device and computer equipment | |
| CN113760608B (en) | Data recovery method and device, electronic equipment and storage medium | |
| CN110545296A (en) | Log data acquisition method, device and equipment | |
| CN114115983A (en) | Configuration file generation method and device and configuration method and device |
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 |