CN111597056A - Distributed scheduling method, system, storage medium and device - Google Patents
Distributed scheduling method, system, storage medium and device Download PDFInfo
- Publication number
- CN111597056A CN111597056A CN202010418887.1A CN202010418887A CN111597056A CN 111597056 A CN111597056 A CN 111597056A CN 202010418887 A CN202010418887 A CN 202010418887A CN 111597056 A CN111597056 A CN 111597056A
- Authority
- CN
- China
- Prior art keywords
- application server
- zookeeper
- waiting queue
- priority
- polled
- 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
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/52—Program synchronisation; Mutual exclusion, e.g. by means of semaphores
- G06F9/526—Mutual exclusion algorithms
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/46—Multiprogramming arrangements
- G06F9/50—Allocation of resources, e.g. of the central processing unit [CPU]
- G06F9/5061—Partitioning or combining of resources
- G06F9/5072—Grid computing
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F2209/00—Indexing scheme relating to G06F9/00
- G06F2209/50—Indexing scheme relating to G06F9/50
- G06F2209/5021—Priority
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D10/00—Energy efficient computing, e.g. low power processors, power management or thermal management
Landscapes
- Engineering & Computer Science (AREA)
- Software Systems (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Mathematical Physics (AREA)
- Multi Processors (AREA)
- Computer And Data Communications (AREA)
Abstract
The invention relates to a distributed scheduling method, which comprises the steps of sending a detection message to each application server in an application server list in a polling mode; if the zookeeper temporary node does not exist and a response message sent by the polled application server is received, the zookeeper temporary node is created so that the polled application server can obtain a distributed lock, and only the polled application server can execute tasks. The invention realizes the cooperative work of each application server and simultaneously realizes the efficient and convenient scheduling management of the distributed system. The invention also relates to a distributed scheduling system, a storage medium and a device.
Description
Technical Field
The present invention relates to the field of servers, and in particular, to a distributed scheduling method, system, storage medium, and device.
Background
In the fields of internet and electronic commerce, large data volume and high concurrency are problems which need to be solved urgently. The relatively time consuming business logic is stripped from the user behavior for asynchronous processing. Therefore, the user experience can be improved, and the expandability of the system can be increased. Distributed task scheduling is therefore very widely used.
In the distributed system of the present day, a system usually consists of hundreds of servers, and how to schedule the large number of servers is an easy matter, and the system has large workload, is cumbersome and is easy to make mistakes. How to perform scheduling management in a distributed system needs a convenient and efficient method.
Disclosure of Invention
The technical problem to be solved by the present invention is to provide a method and a system for managing configuration information in a distributed system, aiming at the defects of the prior art.
The technical scheme for solving the technical problems is as follows:
a distributed scheduling method comprises the following steps:
sending a detection message to each application server in the application server list in a polling mode;
if the zookeeper temporary node does not exist and the polled response message sent by the application server is received, the zookeeper temporary node is created so that the polled application server can obtain a distributed lock, and only the polled application server can execute tasks.
The invention has the beneficial effects that: the distributed scheduling method includes the steps that a detection message is sent to each application server in an application server list in a polling mode, when the application servers need to acquire distributed locks, response messages are sent, after the response messages are received by the servers, zookeeper temporary nodes are created, the application servers acquire the distributed locks, only the application servers can execute tasks, all the application servers can work cooperatively, and efficient and convenient scheduling management of a distributed system is achieved.
On the basis of the technical scheme, the invention can be further improved as follows.
Further, the method further comprises:
if the zookeeper temporary node exists and receives a polled response message sent by the application server, adding the polled application server into a waiting queue;
and detecting whether the zookeeper temporary node exists according to a preset time period, if not, extracting the application server from the waiting queue, sending the detection message to the application server, and if a response message of the application server is received, creating the zookeeper temporary node.
The beneficial effect of adopting the further scheme is that: if the zookeeper temporary node exists and receives a response message sent by the polled application server, the polled application server is added into a waiting queue, whether the zookeeper temporary node exists is detected according to a preset time period, when the zookeeper temporary node does not exist, the application server information is extracted from the waiting queue, and the detection message is sent to the application server, so that the application server can be ensured to seize distributed locks sequentially according to the waiting queue, and efficient and convenient scheduling management of the distributed system is realized.
Further, the waiting queues include a high-priority waiting queue and a low-priority waiting queue, and the extracting the application server from the waiting queue specifically includes:
when the high-priority waiting queue is not empty, extracting the application server in the high-priority waiting queue;
otherwise, extracting the application server in the low-priority waiting queue.
The beneficial effect of adopting the further scheme is that: the waiting queue is divided into a high-priority waiting queue and a low-priority waiting queue, and the high-priority application server can preferentially seize the distributed locks, so that efficient and convenient scheduling management of the distributed system is realized.
Further, the application servers include a high-priority application server and a low-priority application server, and the adding the polled application server into the waiting queue specifically includes:
adding the high-priority application server to the high-priority waiting queue;
and adding the low-priority application server into the low-priority waiting queue.
Further, before sending the probe packet to each application server in the application server list in a polling manner, the method further includes:
and creating a public storage area, and storing the application server list into the public storage area.
Another technical solution of the present invention for solving the above technical problems is as follows:
a distributed scheduling system comprising a zookeeper server and a plurality of application servers;
the zookeeper server polls and sends a detection message to each application server in the application server list;
if the zookeeper server does not have a zookeeper temporary node and the polled application server sends a response message, the zookeeper temporary node is created on the zookeeper server, the polled application server obtains a distributed lock, and only the polled application server can execute a task.
The invention has the beneficial effects that: the distributed scheduling system comprises a zookeeper server and a plurality of application servers, wherein a detection message is sent to each application server in an application server list through polling, when the application servers need to acquire distributed locks, response messages are sent, after the servers receive the response messages, zookeeper temporary nodes are created, the application servers acquire the distributed locks, only the application servers can execute tasks, and the application servers can work cooperatively, so that efficient and convenient scheduling management of the distributed system is realized.
On the basis of the technical scheme, the invention can be further improved as follows.
Further, if the zookeeper temporary node exists on the zookeeper server and a polled response message sent by the application server is received, adding the polled application server into a waiting queue;
the zookeeper server detects whether the zookeeper temporary node exists according to a preset time period, if not, the application server is extracted from the waiting queue and the detection message is sent to the application server, and if a response message of the application server is received, the zookeeper temporary node is created.
The beneficial effect of adopting the further scheme is that: if the zookeeper temporary node exists and receives a response message sent by the polled application server, the polled application server is added into a waiting queue, whether the zookeeper temporary node exists is detected according to a preset time period, when the zookeeper temporary node does not exist, the application server information is extracted from the waiting queue, and the detection message is sent to the application server, so that the application server can be ensured to seize distributed locks sequentially according to the waiting queue, and efficient and convenient scheduling management of the distributed system is realized.
Further, the wait queues include a high priority wait queue and a low priority wait queue;
when the high-priority waiting queue is not empty, the zookeeper server extracts an application server in the high-priority waiting queue;
the beneficial effect of adopting the further scheme is that: the waiting queue is divided into a high-priority waiting queue and a low-priority waiting queue, and the high-priority application server can preferentially seize the distributed locks, so that efficient and convenient scheduling management of the distributed system is realized.
In addition, the present invention also provides a computer-readable storage medium, which includes instructions, when the instructions are executed on a computer, the computer executes the steps of the distributed scheduling method according to any one of the above technical solutions.
The invention further provides a computer device, which includes a memory, a processor and a computer program stored in the memory and capable of running on the processor, and when the processor executes the program, the steps of the distributed scheduling method according to any one of the above technical solutions are implemented.
Advantages of additional aspects of the invention will be set forth in part in the description which follows, and in part will be obvious from the description, or may be learned by practice of the invention.
Drawings
In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the drawings needed to be used in the embodiments of the present invention or in the description of the prior art will be briefly described below, and it is obvious that the drawings described below are only some embodiments of the present invention, and it is obvious for those skilled in the art that other drawings can be obtained according to the drawings without creative efforts.
Fig. 1 is a schematic flowchart of a distributed scheduling method according to an embodiment of the present invention;
fig. 2 is a schematic structural diagram of a distributed scheduling system according to another embodiment 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 some, not all, embodiments of the present invention. All other embodiments, which can be obtained by a person skilled in the art without any inventive step based on the embodiments of the present invention, shall fall within the scope of protection of the present invention.
As shown in fig. 1, which is a schematic flow diagram of a distributed scheduling method according to an embodiment of the present invention, the distributed scheduling method includes the following steps:
110. and sending a detection message to each application server in the application server list in a polling mode.
120. If the zookeeper temporary node does not exist and the response message sent by the polled application server is received, the zookeeper temporary node is created so that the polled application server obtains a distributed lock, and only the polled application server can execute the task.
Based on the distributed scheduling method provided by the embodiment, the detection message is sent to each application server in the application server list through polling, when the application server needs to acquire the distributed lock, the response message is sent, after the server receives the response message, the zookeeper temporary node is created, the application server acquires the distributed lock, only the application server can execute the task, and the application servers can work cooperatively, so that efficient and convenient scheduling management of the distributed system is realized.
Further, if a zookeeper temporary node exists and receives a response message sent by the polled application server, adding the polled application server information into a waiting queue;
detecting whether a zookeeper temporary node exists according to a preset time period, if not, extracting application server information from a waiting queue, sending a detection message to an application server, and if a response message of the application server is received, creating the zookeeper temporary node.
Based on the above embodiment, if the zookeeper temporary node exists and the polled response message sent by the application server is received, the polled application server is added into the waiting queue, whether the zookeeper temporary node exists is detected according to the preset time period, when the zookeeper temporary node does not exist, the application server information is extracted from the waiting queue, and the detection message is sent to the application server, so that the application server can sequentially seize the distributed lock according to the waiting queue, and efficient and convenient scheduling management of the distributed system is realized.
Further, the waiting queues comprise a high priority waiting queue and a low priority waiting queue;
when the high-priority waiting queue is not empty, extracting an application server in the high-priority waiting queue;
otherwise, the application server in the low priority wait queue is fetched.
Further, the application servers comprise a high priority application server and a low priority application server;
adding the high-priority application server into a high-priority waiting queue;
and adding the application server with low priority into the low-priority waiting queue.
Further, before sending the probe packet to each application server in the application server list in a polling manner, the method further includes:
and creating a public storage area, and storing the application server list into the public storage area.
It should be understood that the public storage area may support a variety of databases, including Oracle, Mysql, or Redis, among others.
For example, the application server list includes an application server 1, an application server 2, an application server 3, an application server 4, an application server 5 and an application server 6, the application servers in the application server list are sequentially polled, a probe message is sent to each application server, the application server 2 needing to seize the distributed lock sends a response message, the zookeeper server receives the response message, whether a zookeeper temporary node exists is checked, if the zookeeper temporary node does not exist, the zookeeper temporary node is created, the zookeeper temporary node includes information of the application server 2, the application server 2 can execute a task, if the zookeeper temporary node exists, the application server 2 is added into a waiting queue, the zookeeper server regularly checks whether the zookeeper temporary node still exists, if the zookeeper temporary node does not exist, the information of the application server is extracted from the waiting queue, if the application server 3 and the application server 2 exist in the waiting queue, the information of the application server 3 is extracted first, a detection message is sent to the application server 3, the application server 3 receives the detection message and replies a response message, and a zookeeper temporary node is created, wherein the information in the zookeeper temporary node comprises the information of the application server 3.
As shown in fig. 2, which is a schematic structural diagram of a distributed scheduling system according to an embodiment of the present invention, the distributed scheduling system includes a zookeeper server and a plurality of application servers;
the zookeeper server polls and sends a detection message to each application server in the application server list;
if the polled application server sends a response message and the zookeeper server does not have a zookeeper temporary node, creating the zookeeper temporary node on the zookeeper server, acquiring a distributed lock by the polled application server, and only the polled application server can execute a task.
Based on the distributed scheduling system provided by the embodiment, the distributed scheduling system comprises the zookeeper server and a plurality of application servers, the detection message is sent to each application server in the application server list through polling, when the application servers need to acquire the distributed locks, the response message is sent, after the servers receive the response message, the zookeeper temporary nodes are created, the application servers acquire the distributed locks, only the application servers can execute tasks, and the application servers can work cooperatively, so that efficient and convenient scheduling management of the distributed system is realized.
Further, if a zookeeper temporary node exists on the zookeeper server and a response message sent by the polled application server is received, adding the polled application server into a waiting queue;
the zookeeper server detects whether a zookeeper temporary node exists according to a preset time period, if not, the application server is extracted from the waiting queue, a detection message is sent to the application server, and if a response message of the application server is received, the zookeeper temporary node is created.
Further, the waiting queues comprise a high priority waiting queue and a low priority waiting queue;
when the high-priority queue is not empty, the zookeeper server extracts the application server in the high-priority waiting queue;
otherwise, the zookeeper server fetches the application server in the low priority wait queue.
Further, the application servers comprise a high priority application server and a low priority application server;
adding the high-priority application server into a high-priority waiting queue;
and adding the application server with low priority into the low-priority waiting queue.
Further, a public storage area is created, and the application server list is stored in the public storage area.
Furthermore, the present invention also provides a computer-readable storage medium, which includes instructions that, when executed on a computer, cause the computer to perform the steps of the distributed scheduling method described in any of the above embodiments.
The invention also provides a computer device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, the processor executing the program to implement the steps of the distributed scheduling method as described in any of the above embodiments.
While the invention has been described with reference to specific embodiments, it will be understood by those skilled in the art that various changes in form and details may be made therein without departing from the spirit and scope of the invention as defined by the appended claims. Therefore, the protection scope of the present invention shall be subject to the protection scope of the claims.
Claims (10)
1. A distributed scheduling method, comprising the steps of:
sending a detection message to each application server in the application server list in a polling mode;
if no zookeeper temporary node exists and a polled response message sent by the application server is received, creating the zookeeper temporary node so that the polled application server obtains a distributed lock, and enabling only the polled application server to execute tasks.
2. The distributed scheduling method of claim 1, wherein the method further comprises:
if the zookeeper temporary node exists and receives a polled response message sent by the application server, adding the polled application server into a waiting queue;
and detecting whether the zookeeper temporary node exists according to a preset time period, if not, extracting the application server from the waiting queue, sending the detection message to the application server, and if a response message of the application server is received, creating the zookeeper temporary node.
3. The distributed scheduling method according to claim 2, wherein the waiting queues include a high-priority waiting queue and a low-priority waiting queue, and the extracting the application server from the waiting queue specifically includes:
when the high-priority waiting queue is not empty, extracting the application server in the high-priority waiting queue;
otherwise, extracting the application server in the low-priority waiting queue.
4. The distributed scheduling method according to claim 3, wherein the application servers include a high-priority application server and a low-priority application server, and the adding the polled application server into a waiting queue specifically includes:
adding the high-priority application server to the high-priority waiting queue;
and adding the low-priority application server into the low-priority waiting queue.
5. The distributed scheduling method according to any of claims 1-4, wherein before sending the probe message to each application server in the application server list in a polling manner, further comprising:
and creating a public storage area, and storing the application server list into the public storage area.
6. A distributed scheduling system, comprising a zookeeper server and a plurality of application servers;
the zookeeper server polls and sends a detection message to each application server in the application server list;
if the zookeeper server does not have a zookeeper temporary node and the polled application server sends a response message, the zookeeper temporary node is created on the zookeeper server, the polled application server obtains a distributed lock, and only the polled application server can execute a task.
7. The distributed scheduling system of claim 6,
if the zookeeper temporary node exists on the zookeeper server and a polled response message sent by the application server is received, adding the polled application server into a waiting queue;
the zookeeper server detects whether the zookeeper temporary node exists according to a preset time period, if not, the application server is extracted from the waiting queue and the detection message is sent to the application server, and if a response message of the application server is received, the zookeeper temporary node is created.
8. The distributed scheduling system of claim 7,
the waiting queues comprise a high-priority waiting queue and a low-priority waiting queue;
when the high-priority waiting queue is not empty, the zookeeper server extracts an application server in the high-priority waiting queue;
otherwise, the zookeeper server extracts the application server in the low-priority waiting queue.
9. A computer readable storage medium comprising instructions, which when run on a computer, cause the computer to perform the steps of the distributed scheduling method according to any of claims 1-5.
10. A computer arrangement comprising a memory, a processor and a computer program stored on the memory and executable on the processor, characterized in that the processor implements the steps of the distributed scheduling method according to any of claims 1-5 when executing the program.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010418887.1A CN111597056B (en) | 2020-05-18 | 2020-05-18 | Distributed scheduling method, system, storage medium and equipment |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010418887.1A CN111597056B (en) | 2020-05-18 | 2020-05-18 | Distributed scheduling method, system, storage medium and equipment |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111597056A true CN111597056A (en) | 2020-08-28 |
| CN111597056B CN111597056B (en) | 2023-06-30 |
Family
ID=72191342
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010418887.1A Active CN111597056B (en) | 2020-05-18 | 2020-05-18 | Distributed scheduling method, system, storage medium and equipment |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111597056B (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112527489A (en) * | 2020-12-22 | 2021-03-19 | 税友软件集团股份有限公司 | Task scheduling method, device and equipment and computer readable storage medium |
| CN112817712A (en) * | 2021-01-26 | 2021-05-18 | 广州欢网科技有限责任公司 | Distributed scheduling method and device and advertisement system |
Citations (15)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20040010551A1 (en) * | 2002-07-11 | 2004-01-15 | Chia-Chu Dorland | Method and apparatus for automated network polling |
| US20080086480A1 (en) * | 2006-10-06 | 2008-04-10 | Sybase, Inc. | System and Methods For Temporary Data Management in Shared Disk Cluster |
| US20120151272A1 (en) * | 2010-12-09 | 2012-06-14 | International Business Machines Corporation | Adding scalability and fault tolerance to generic finite state machine frameworks for use in automated incident management of cloud computing infrastructures |
| CN102841822A (en) * | 2011-06-23 | 2012-12-26 | 腾讯科技（深圳）有限公司 | Method and system for performing crash protection on jobTracker hosts |
| US20130024496A1 (en) * | 2011-07-21 | 2013-01-24 | Yahoo! Inc | Method and system for building an elastic cloud web server farm |
| CN104683445A (en) * | 2015-01-26 | 2015-06-03 | 北京邮电大学 | Distributed real-time data fusion system |
| CN108037983A (en) * | 2017-11-22 | 2018-05-15 | 链家网（北京）科技有限公司 | Method for scheduling task and distributed scheduling system in distributed scheduling system |
| CN108304255A (en) * | 2017-12-29 | 2018-07-20 | 北京城市网邻信息技术有限公司 | Distributed task dispatching method and device, electronic equipment and readable storage medium storing program for executing |
| CN108920272A (en) * | 2018-06-08 | 2018-11-30 | 中国平安人寿保险股份有限公司 | A kind of data processing method, device, computer equipment and storage medium |
| CN109462507A (en) * | 2018-11-15 | 2019-03-12 | 北京金山云网络技术有限公司 | Configure update method, device, system and electronic equipment |
| CN109614210A (en) * | 2018-11-28 | 2019-04-12 | 重庆邮电大学 | Storm big data energy-saving scheduling method based on energy consumption perception |
| CN109756543A (en) * | 2017-11-08 | 2019-05-14 | 北京京东尚科信息技术有限公司 | The decoupled system and method for program incidence relation |
| CN110046041A (en) * | 2019-04-15 | 2019-07-23 | 北京中安智达科技有限公司 | A kind of collecting method based on celery Scheduling Framework |
| CN110134372A (en) * | 2019-07-10 | 2019-08-16 | 启迪云计算有限公司 | A kind of rule-based zookeeper session external management system |
| CN110225074A (en) * | 2019-01-04 | 2019-09-10 | 国网浙江省电力有限公司 | A kind of communication packet dissemination system and distribution method based on device address domain |
-
2020
- 2020-05-18 CN CN202010418887.1A patent/CN111597056B/en active Active
Patent Citations (15)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20040010551A1 (en) * | 2002-07-11 | 2004-01-15 | Chia-Chu Dorland | Method and apparatus for automated network polling |
| US20080086480A1 (en) * | 2006-10-06 | 2008-04-10 | Sybase, Inc. | System and Methods For Temporary Data Management in Shared Disk Cluster |
| US20120151272A1 (en) * | 2010-12-09 | 2012-06-14 | International Business Machines Corporation | Adding scalability and fault tolerance to generic finite state machine frameworks for use in automated incident management of cloud computing infrastructures |
| CN102841822A (en) * | 2011-06-23 | 2012-12-26 | 腾讯科技（深圳）有限公司 | Method and system for performing crash protection on jobTracker hosts |
| US20130024496A1 (en) * | 2011-07-21 | 2013-01-24 | Yahoo! Inc | Method and system for building an elastic cloud web server farm |
| CN104683445A (en) * | 2015-01-26 | 2015-06-03 | 北京邮电大学 | Distributed real-time data fusion system |
| CN109756543A (en) * | 2017-11-08 | 2019-05-14 | 北京京东尚科信息技术有限公司 | The decoupled system and method for program incidence relation |
| CN108037983A (en) * | 2017-11-22 | 2018-05-15 | 链家网（北京）科技有限公司 | Method for scheduling task and distributed scheduling system in distributed scheduling system |
| CN108304255A (en) * | 2017-12-29 | 2018-07-20 | 北京城市网邻信息技术有限公司 | Distributed task dispatching method and device, electronic equipment and readable storage medium storing program for executing |
| CN108920272A (en) * | 2018-06-08 | 2018-11-30 | 中国平安人寿保险股份有限公司 | A kind of data processing method, device, computer equipment and storage medium |
| CN109462507A (en) * | 2018-11-15 | 2019-03-12 | 北京金山云网络技术有限公司 | Configure update method, device, system and electronic equipment |
| CN109614210A (en) * | 2018-11-28 | 2019-04-12 | 重庆邮电大学 | Storm big data energy-saving scheduling method based on energy consumption perception |
| CN110225074A (en) * | 2019-01-04 | 2019-09-10 | 国网浙江省电力有限公司 | A kind of communication packet dissemination system and distribution method based on device address domain |
| CN110046041A (en) * | 2019-04-15 | 2019-07-23 | 北京中安智达科技有限公司 | A kind of collecting method based on celery Scheduling Framework |
| CN110134372A (en) * | 2019-07-10 | 2019-08-16 | 启迪云计算有限公司 | A kind of rule-based zookeeper session external management system |
Non-Patent Citations (1)
| Title |
|---|
| 陆平;钱煜明;朱科支;: "一种分布式复杂消息处理引擎的设计与实现", 中兴通讯技术, no. 04, pages 62 - 66 * |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112527489A (en) * | 2020-12-22 | 2021-03-19 | 税友软件集团股份有限公司 | Task scheduling method, device and equipment and computer readable storage medium |
| CN112817712A (en) * | 2021-01-26 | 2021-05-18 | 广州欢网科技有限责任公司 | Distributed scheduling method and device and advertisement system |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111597056B (en) | 2023-06-30 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US10348809B2 (en) | Naming of distributed business transactions | |
| CN108536532B (en) | Batch task processing method and system | |
| CN109343941B (en) | Task processing method and device, electronic equipment and computer readable storage medium | |
| US9467460B1 (en) | Modularized database architecture using vertical partitioning for a state machine | |
| CN108595282A (en) | A kind of implementation method of high concurrent message queue | |
| WO2021190087A1 (en) | Task execution method, device and system, and server | |
| CN110636124B (en) | VPP cluster management method and device, electronic equipment and storage medium | |
| CN109710416B (en) | Resource scheduling method and device | |
| CN107589990B (en) | Data communication method and system based on thread pool | |
| CN111597056A (en) | Distributed scheduling method, system, storage medium and device | |
| CN111078422A (en) | Message processing method, message processing device, readable storage medium and electronic equipment | |
| CN109842621A (en) | A kind of method and terminal reducing token storage quantity | |
| CN110740145A (en) | Message consumption method, device, storage medium and electronic equipment | |
| US20170078049A1 (en) | Freshness-sensitive message delivery | |
| CN112052133A (en) | Service system monitoring method and device based on Kubernetes | |
| CN116149821A (en) | Cluster multi-task sliding window scheduling processing method, system, equipment and medium | |
| CN112860387A (en) | Distributed task scheduling method and device, computer equipment and storage medium | |
| CN113391911B (en) | Dynamic scheduling method, device and equipment for big data resources | |
| CN112948096A (en) | Batch scheduling method, device and equipment | |
| CN111143053A (en) | Scheduling method of timing task, server and storage device | |
| EP3687133A1 (en) | System and method for synchronization of media objects between devices operating in a multiroom system | |
| CN110825505A (en) | Task scheduling method and device, computer equipment and storage medium | |
| CN108121580B (en) | Method and device for realizing application program notification service | |
| CN111061474B (en) | Lamda programming device and data processing method thereof | |
| CN110825342A (en) | Memory scheduling device and system, method and apparatus for processing information |
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 |