CN111190736A - Low-intrusion distributed timing task scheduling system and method based on microservice - Google Patents
Low-intrusion distributed timing task scheduling system and method based on microservice Download PDFInfo
- Publication number
- CN111190736A CN111190736A CN201911400934.3A CN201911400934A CN111190736A CN 111190736 A CN111190736 A CN 111190736A CN 201911400934 A CN201911400934 A CN 201911400934A CN 111190736 A CN111190736 A CN 111190736A
- Authority
- CN
- China
- Prior art keywords
- service
- micro
- scheduling
- registration
- registry
- 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
- 238000000034 method Methods 0.000 title claims abstract description 16
- 230000001960 triggered effect Effects 0.000 claims abstract description 14
- 238000004364 calculation method Methods 0.000 claims description 16
- 238000004590 computer program Methods 0.000 claims description 10
- 230000001360 synchronised effect Effects 0.000 claims description 5
- 230000006870 function Effects 0.000 claims description 4
- 230000007246 mechanism Effects 0.000 claims description 4
- 230000003993 interaction Effects 0.000 claims description 2
- 238000012163 sequencing technique Methods 0.000 description 5
- 238000010586 diagram Methods 0.000 description 4
- 230000008569 process Effects 0.000 description 3
- 230000009545 invasion Effects 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000006855 networking Effects 0.000 description 1
- 230000002688 persistence Effects 0.000 description 1
- 239000010453 quartz Substances 0.000 description 1
- VYPSYNLAJGMNEJ-UHFFFAOYSA-N silicon dioxide Inorganic materials O=[Si]=O VYPSYNLAJGMNEJ-UHFFFAOYSA-N 0.000 description 1
- 230000003068 static effect Effects 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/46—Multiprogramming arrangements
- G06F9/50—Allocation of resources, e.g. of the central processing unit [CPU]
- G06F9/5005—Allocation of resources, e.g. of the central processing unit [CPU] to service a request
- G06F9/5027—Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resource being a machine, e.g. CPUs, Servers, Terminals
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F15/00—Digital computers in general; Data processing equipment in general
- G06F15/16—Combinations of two or more digital computers each having at least an arithmetic unit, a program unit and a register, e.g. for a simultaneous processing of several programs
- G06F15/163—Interprocessor communication
- G06F15/173—Interprocessor communication using an interconnection network, e.g. matrix, shuffle, pyramid, star, snowflake
-
- 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/48—Program initiating; Program switching, e.g. by interrupt
- G06F9/4806—Task transfer initiation or dispatching
- G06F9/4843—Task transfer initiation or dispatching by program, e.g. task dispatcher, supervisor, operating system
- G06F9/4881—Scheduling strategies for dispatcher, e.g. round robin, multi-level priority queues
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Software Systems (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Computer Hardware Design (AREA)
- Mathematical Physics (AREA)
- Multi Processors (AREA)
Abstract
The invention discloses a micro-service-based low-intrusion distributed timing task scheduling system and a method, wherein when each micro-service application instance in a service system cluster is started, registration is carried out on line on each registration center of the registration center cluster through a registration client; each registration center automatically divides application service groups according to the application names of the micro-service instances, and registers the micro-service instances providing the same service into the same application service group; when the timing task is triggered, the scheduling unit calculates the scheduling result of each micro-service application instance in the same group according to the scheduling mode, and determines whether the current service is a task execution node. The invention has the advantages of decentralized and independent scheduling management, equalized relation of the registered service nodes, realization of distributed task scheduling of low intrusion and guarantee of uninterrupted service when the service nodes of the registration center are in failure.
Description
Technical Field
The invention belongs to the field of distributed task scheduling, and particularly relates to a micro-service-based low-intrusion distributed timing task scheduling system.
Background
In many application systems, there is often timing within the system to perform some task. For example, the sales system determines the order timeout status, updates the cache data at regular time, sends a meeting mail to the specified user at regular time, and even makes some report data statistics at regular time. Common processing modes include a combination of while (true) and sleep of a thread, using a java.util.timer to trigger a task, or using a framework such as quartz, spring task and the like. It seems that the perfect solution task scheduling of these methods is to set a certain time point to be a task triggered automatically, and the task is executed according to the set time law. There is actually no problem in a stand-alone application system, but today, in order to ensure high availability of services, service deployment is clustered, and when these methods are applied to a cluster environment, repeated execution is inevitably caused. There are of course solutions to persist the task execution state, such as relying on a database. A distributed timing task scheduling system which is mature in application in the industry at present can be adopted, for example: xxl-joba, Elastic-joba, Saturn, etc. Whether a mature task scheduling system scheme is adopted or the database persistence is relied on, problems can occur, such as severe invasion to the service system, that is, the service system needs to be developed in a large quantity and merged into a scheduling framework, or a service node failure of a registration center can not guarantee that the service is not interrupted.
Disclosure of Invention
The invention aims to provide a micro-service-based low-intrusion distributed timing task scheduling system and a micro-service-based low-intrusion distributed timing task scheduling method.
The technical solution for realizing the purpose of the invention is as follows: a low-intrusion distributed timing task scheduling system based on micro-service comprises a service system cluster and a registration center cluster, wherein:
the business system cluster comprises a plurality of micro-service application instances, each micro-service application instance is provided with a registration client and a scheduling unit, and the registration client is used for acquiring information of the micro-service application instances and sending the information to a registration center for registration; the scheduling unit is used for performing scheduling operation on each micro-service application instance of the micro-service application group corresponding to the task according to the scheduling mode and determining a task execution node;
the registry cluster comprises a plurality of registries, and the registries are used for storing the microservice application instances in groups according to the application instance information and synchronizing the registry information among the registries.
Each registration center of the registration center cluster is not divided into a primary registration center and a secondary registration center, and when a registration client sends registration information to a certain registration center, if connection failure is found, the registration client can be automatically switched to other nodes.
In the interaction process of the registration center and the registration client, if the heartbeat is disconnected, the registration center can be actively reconnected, and after the reconnection exceeds a threshold value, the application example is judged to be unavailable and removed from the registration list, so that the subsequent scheduling operation cannot be participated.
The method for setting a self-protection mechanism in the registration center cluster, which is triggered when network faults occur in part of the registration centers and the clients, comprises the following steps:
(1) the registration center does not remove services which should be expired because the heartbeat is not received for a long time from the registration list, but can mark that the service state is unknown, and the instance information of the unknown state does not participate in scheduling calculation;
(2) the registration center can still receive registration and query requests of new services, and the current registration center is ensured to be still available;
(3) when the network is stable, the new registration information will be synchronized to other registries.
The scheduling unit supports three scheduling calculation modes, namely an earliest registration mode, a polling mode and a resource priority mode.
The registry cluster is provided with a fixed ordered linked list, the task finds the current earliest registry according to the routing sequence of the ordered linked list to acquire application instance information, scheduling calculation is carried out, other registries are backups, and when the current registry fails, information is acquired from the next registry of the ordered linked list.
The service system cluster is named according to the functions of the micro-service application groups, and when the micro-service application instances are registered, the micro-service application instances are divided into the corresponding application service groups according to the application names of the micro-service application instances.
A low-intrusion distributed timing task scheduling method based on micro-service comprises the following steps:
when a micro-service application instance of a service system cluster is started, registering on a registration center of the registration center through a registration client;
the registry of the registry cluster performs packet storage and registration information synchronization on the microservice application instances according to the application instance information;
and when the timing task is triggered, the scheduling unit of the micro-service application example calculates the scheduling result of each micro-service application example in the micro-service application group corresponding to the task according to the scheduling mode, and determines a task execution node.
A computer device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, the processor implementing the following steps when executing the computer program:
when a micro-service application instance of a service system cluster is started, registering on a registration center of the registration center through a registration client;
the registry of the registry cluster performs packet storage and registration information synchronization on the microservice application instances according to the application instance information;
and when the timing task is triggered, the scheduling unit of the micro-service application example calculates the scheduling result of each micro-service application example in the micro-service application group corresponding to the task according to the scheduling mode, and determines a task execution node.
A computer-readable storage medium, on which a computer program is stored which, when executed by a processor, carries out the steps of:
when a micro-service application instance of a service system cluster is started, registering on a registration center of the registration center through a registration client;
the registry of the registry cluster performs packet storage and registration information synchronization on the microservice application instances according to the application instance information;
and when the timing task is triggered, the scheduling unit of the micro-service application example calculates the scheduling result of each micro-service application example in the micro-service application group corresponding to the task according to the scheduling mode, and determines a task execution node.
Compared with the prior art, the invention has the following remarkable advantages: 1) a database is not needed, and the invasion degree of the existing service system is low; 2) task scheduling calculation is carried out in each independent service micro-server, fault transfer is automatically completed, meanwhile, an independent scheduling calculation service node is not needed, and the hardware requirement on a deployment environment is reduced; 3) the registration centers are all parallel nodes, and the problem of registration service interruption caused by re-election after the master node of the master/slave architecture on the market fails is solved.
Drawings
FIG. 1 is a data flow diagram of a microservice-based low-intrusion distributed timed task scheduling system of the present invention.
FIG. 2 is a flow chart of distributed scheduling in accordance with the present invention.
Fig. 3 is a networking diagram of the service system cluster distributed scheduling system of the present invention.
FIG. 4 is a logic diagram of a scheduling mode of the present invention.
FIG. 5 is a diagram of a business system application example registration relationship in accordance with the present invention.
Detailed Description
The invention is further illustrated by the following examples in conjunction with the accompanying drawings.
The invention discloses a micro-service-based low-intrusion distributed timed task scheduling system, which relates to two main bodies, namely a service system and a registration center cluster, wherein the service system cluster comprises a registration client and a scheduling unit; the registration client is used for acquiring micro-service application instance information and sending the information to a registration center for registration; the scheduling unit is used for performing scheduling operation on each micro-service application instance of the micro-service application group corresponding to the task according to the scheduling mode and determining a task execution node; the registry cluster comprises a plurality of registries, and is used for grouping and storing the microservice application instances according to the application instance information and synchronizing the registry information among the registries.
The registration center cluster is developed based on an Eureka service registration and discovery framework, and is mainly used for grouping registration of micro-service application instances of the service system and online information storage and management of registration application services in distributed scheduling, so that a scheduling unit embedded in the service system can conveniently acquire application group information for scheduling calculation. Each registration center node of the registration center cluster has the same function and is not divided into primary and secondary, when a registration client sends registration information to a certain registration center node, if connection failure is found, the registration client can be automatically switched to other nodes, and the registration service can be ensured to be available as long as one registration center service is still available.
The registered client is realized by a registered client tool class added into a business system project. After the cluster address of the registry is configured in the client tool class, the client runs along with the application service, automatically acquires the instance information of the application service, and sends the instance information to the registry for service registration, as shown in fig. 1.
If the registration center and the registered client are disconnected in heartbeat, the registration center can be actively reconnected, after the reconnection exceeds a threshold value (the threshold value is configurable), the application example is considered to be unavailable and removed from the registration list, and subsequent scheduling operation cannot be participated.
The self-protection mechanism of the registry, if more than 85% of nodes of the registry do not have normal heartbeat within five minutes, the registry considers that the network failure occurs with the client, and immediately triggers the following mechanisms:
a. the registry no longer removes services from the registry list that should expire because no heartbeats were received for a long time, but marks the service state as unknown (instance information of unknown state does not participate in scheduling calculations).
b. The registry can still receive registration and query requests for new services, ensuring that the current node is still available.
c. When the network is stable, the new registration information of the current instance is synchronized to other nodes of the registry.
The scheduling unit introduces a distributed task scheduling tool class into the project of the service system, and completes scheduling configuration of the timing task by adding scheduling annotation aiming at all the timing tasks needing distributed scheduling. Taking java as an example, the annotation format is:
@DistributedCondition("MODE")
when the project runs, the scheduling unit in the service micro-service application instance performs scheduling calculation on the execution of the timing task in the service system according to the configured scheduling information, and determines whether to execute the task on the current application service instance after a calculation result is obtained. There is no unified scheduling calculation service, and each embedded scheduling unit performs scheduling calculation independently, see fig. 2 and fig. 3. Three scheduling calculation MODEs (MODE) are supported:
a. earliest registration, keyword: EARLIEST _ REGISTERED
The method comprises the steps of taking an earliest registered online application service as a task execution target machine, obtaining a registration time set RT (T | T ∈ T) of all instances of an application service group where a current running instance is located from a registration center, obtaining registration time of one instance, T computer time, sequencing time, obtaining minimum registration time min (T), obtaining corresponding instance information and comparing the corresponding instance information with the current running instance information, if the registration time is the same as the registration time, the current instance is the earliest registered instance, meeting a task execution condition, and executing a task on the instance.
b. Polling, keyword: polling
Obtaining a registration time set RT of all instances of an application service group where a current operation instance is located from a registration center, performing registration time descending numbering on the online application service, obtaining an ordinal pair, wherein x represents a sequencing serial number
f(t)＝x,t∈RT,x∈N*
And the target machine is scheduled according to the minimum sequence number x from the sequencing, and then is scheduled according to the sequence number polling in sequence.
c. Resource priority, keyword: optimal _ RESOURCE
And sequencing the online application services according to the idle resources, and selecting the machine with the most idle resources as a target machine for task execution. And setting the idle reference value as W, and sequencing the application services according to the machine reference value.
In the formula, YcIndicating CPU idle, YmIndicating memory occupancy, YlRepresenting the machine load value, the scheduling pattern is shown in figure 4.
The fixed ordered linked list information is arranged in the registry cluster, the task of each application group can find the current earliest registry node according to the routing sequence to acquire application instance information for scheduling calculation, other registry service nodes are backups, and when the current registry node fails, the information is uniformly acquired from the next other registry node of the ordered linked list.
The service cluster of the service system is constructed based on Spring Cloud, a scheduling framework is not required to be merged by making a large amount of modification, and only a registration center client and a scheduling unit tool class are required to be introduced, and the registration center cluster and a task scheduling mode are configured to complete application deployment of the distributed scheduling system. The service system cluster configures application names of micro-services according to different service functions, each micro-service instance in the service system cluster can be registered and online in the registration center when being started, the registration center can automatically divide application service groups according to the application names, the instances with the same service are provided and registered in the same application service group, and the registration relationship of the application instances of the service system is shown in figure 5. When the timing task is triggered, the application services in the same group can independently calculate a scheduling result and determine whether the current service is a task execution node.
The low-intrusion distributed timing task scheduling method based on the system comprises the following steps:
when each micro-service application instance in the business system cluster is started, registering on-line on a registration center of the registration center through a registration client;
the registration centers store the micro-service application instances in groups according to the application instance information, store the micro-service instances providing the same service into the same application service group, and then synchronize the registration information among the registration centers;
and when the timing task is triggered, the scheduling unit calculates the scheduling result of each micro-service application instance in the micro-service application group corresponding to the task according to the scheduling mode and determines a task execution node.
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, wherein the processor implements the following steps when executing the computer program:
when a micro-service application instance of a service system cluster is started, registering on a registration center of the registration center through a registration client;
the registry of the registry cluster performs packet storage and registration information synchronization on the microservice application instances according to the application instance information;
and when the timing task is triggered, the scheduling unit of the micro-service application example calculates the scheduling result of each micro-service application example in the micro-service application group corresponding to the task according to the scheduling mode, and determines a task execution node.
A computer-readable storage medium, on which a computer program is stored which, when executed by a processor, carries out the steps of:
when a micro-service application instance of a service system cluster is started, registering on a registration center of the registration center through a registration client;
the registry of the registry cluster performs packet storage and registration information synchronization on the microservice application instances according to the application instance information;
and when the timing task is triggered, the scheduling unit of the micro-service application example calculates the scheduling result of each micro-service application example in the micro-service application group corresponding to the task according to the scheduling mode, and determines a task execution node.
It will be understood by those skilled in the art that all or part of the processes of the methods of the embodiments described above can be implemented by hardware instructions of a computer program, which can be stored in a non-volatile computer-readable storage medium, and when executed, can include the processes of the embodiments of the methods described above. Any reference to memory, storage, database, or other medium used in the embodiments provided herein may include non-volatile and/or volatile memory, among others. Non-volatile memory can include read-only memory (ROM), Programmable ROM (PROM), Electrically Programmable ROM (EPROM), Electrically Erasable Programmable ROM (EEPROM), or flash memory. Volatile memory can include Random Access Memory (RAM) or external cache memory. By way of illustration and not limitation, RAM is available in a variety of forms such as Static RAM (SRAM), Dynamic RAM (DRAM), Synchronous DRAM (SDRAM), Double Data Rate SDRAM (DDRSDRAM), Enhanced SDRAM (ESDRAM), Synchronous Link DRAM (SLDRAM), Rambus (Rambus) direct RAM (RDRAM), direct memory bus dynamic RAM (DRDRAM), and memory bus dynamic RAM (RDRAM).
The technical features of the above embodiments can be arbitrarily combined, and for the sake of brevity, all possible combinations of the technical features in the above embodiments are not described, but should be considered as the scope of the present specification as long as there is no contradiction between the combinations of the technical features.
The above-mentioned embodiments only express several embodiments of the present application, and the description thereof is more specific and detailed, but not construed as limiting the scope of the invention. It should be noted that, for a person skilled in the art, several variations and modifications can be made without departing from the concept of the present application, which falls within the scope of protection of the present application. Therefore, the protection scope of the present patent shall be subject to the appended claims.
Claims (10)
1. The low-intrusion distributed timing task scheduling system based on the microservice is characterized by comprising a service system cluster and a registration center cluster, wherein:
the business system cluster comprises a plurality of micro-service application instances, each micro-service application instance is provided with a registration client and a scheduling unit, and the registration client is used for acquiring information of the micro-service application instances and sending the information to a registration center for registration; the scheduling unit is used for performing scheduling operation on each micro-service application instance of the micro-service application group corresponding to the task according to the scheduling mode and determining a task execution node;
the registry cluster comprises a plurality of registries, and the registries are used for storing the microservice application instances in groups according to the application instance information and synchronizing the registry information among the registries.
2. The microservice-based low-intrusion distributed timed task scheduling system according to claim 1, wherein each registry of the registry cluster is not primary or secondary, and when a registered client sends registration information to a certain registry, if a connection failure is found, it will automatically switch to other nodes.
3. The microservice-based low-intrusion distributed timed task scheduling system according to claim 1, wherein during the interaction between the registry and the registered client, if a heartbeat is broken and linked, the registry will reconnect actively, and after the reconnection exceeds a threshold, it is determined that the application instance is unavailable, removed from the registry list, and will not participate in subsequent scheduling operations.
4. The microservice-based low-intrusion distributed timed task scheduling system according to claim 1, wherein the registry cluster sets a self-protection mechanism, which is triggered when a network failure occurs between part of the registries and the clients, and comprises:
(1) the registration center does not remove services which should be expired because the heartbeat is not received for a long time from the registration list, but can mark that the service state is unknown, and the instance information of the unknown state does not participate in scheduling calculation;
(2) the registration center can still receive registration and query requests of new services, and the current registration center is ensured to be still available;
(3) when the network is stable, the new registration information will be synchronized to other registries.
5. The microservice-based low-intrusion distributed timed task scheduling system according to claim 1, wherein said scheduling unit supports three scheduling calculation modes, an earliest registration mode, a polling mode and a resource priority mode.
6. The microservice-based low-intrusion distributed timed task scheduling system according to claim 1, wherein the registry cluster sets a fixed ordered linked list, the task finds the current earliest registry according to the routing order of the ordered linked list to acquire application instance information for scheduling calculation, the other registries are backups, and when the current registry fails, the information is acquired from the next registry of the ordered linked list.
7. The micro-service based low-intrusion distributed timed task scheduling system according to claim 1, wherein the service system cluster is named according to the function of the micro-service application group, and when the micro-service application instance is registered, the micro-service application instance is divided into the corresponding application service groups according to the application name of the micro-service application instance.
8. The low-intrusion distributed timing task scheduling method based on the microservice is characterized by comprising the following steps of:
when a micro-service application instance of a service system cluster is started, registering on a registration center of the registration center through a registration client;
the registry of the registry cluster performs packet storage and registration information synchronization on the microservice application instances according to the application instance information;
and when the timing task is triggered, the scheduling unit of the micro-service application example calculates the scheduling result of each micro-service application example in the micro-service application group corresponding to the task according to the scheduling mode, and determines a task execution node.
9. A computer device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, the processor implementing the following steps when executing the computer program:
when a micro-service application instance of a service system cluster is started, registering on a registration center of the registration center through a registration client;
the registry of the registry cluster performs packet storage and registration information synchronization on the microservice application instances according to the application instance information;
and when the timing task is triggered, the scheduling unit of the micro-service application example calculates the scheduling result of each micro-service application example in the micro-service application group corresponding to the task according to the scheduling mode, and determines a task execution node.
10. A computer-readable storage medium, on which a computer program is stored which, when executed by a processor, carries out the steps of:
when a micro-service application instance of a service system cluster is started, registering on a registration center of the registration center through a registration client;
the registry of the registry cluster performs packet storage and registration information synchronization on the microservice application instances according to the application instance information;
and when the timing task is triggered, the scheduling unit of the micro-service application example calculates the scheduling result of each micro-service application example in the micro-service application group corresponding to the task according to the scheduling mode, and determines a task execution node.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911400934.3A CN111190736A (en) | 2019-12-31 | 2019-12-31 | Low-intrusion distributed timing task scheduling system and method based on microservice |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911400934.3A CN111190736A (en) | 2019-12-31 | 2019-12-31 | Low-intrusion distributed timing task scheduling system and method based on microservice |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN111190736A true CN111190736A (en) | 2020-05-22 |
Family
ID=70705950
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201911400934.3A Pending CN111190736A (en) | 2019-12-31 | 2019-12-31 | Low-intrusion distributed timing task scheduling system and method based on microservice |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111190736A (en) |
Cited By (16)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111736977A (en) * | 2020-07-21 | 2020-10-02 | 成都新希望金融信息有限公司 | Central dispatching method and system for multiple middle stations |
| CN112084765A (en) * | 2020-08-26 | 2020-12-15 | 武汉普利商用机器有限公司 | Automatic classification method and device, electronic equipment and storage medium |
| CN112181438A (en) * | 2020-09-18 | 2021-01-05 | 杭州卓健信息科技有限公司 | Micro-service independent deployment system and method in 2B SAAS platform |
| CN112231089A (en) * | 2020-11-02 | 2021-01-15 | 广州市网星信息技术有限公司 | Task scheduling method, device, equipment, system and storage medium |
| CN112637335A (en) * | 2020-12-22 | 2021-04-09 | 新华三大数据技术有限公司 | Main/standby mode service deployment method, device, equipment and storage medium |
| CN112738339A (en) * | 2020-12-29 | 2021-04-30 | 杭州东信北邮信息技术有限公司 | Service instance lossless capacity expansion and reduction method under telecommunication domain micro-service architecture |
| CN112817717A (en) * | 2021-01-28 | 2021-05-18 | 新华三大数据技术有限公司 | Scheduling method and device for timing task |
| CN113010284A (en) * | 2021-03-04 | 2021-06-22 | 万翼科技有限公司 | Scheduling method and device of micro-service module, storage medium and electronic device |
| CN113364706A (en) * | 2021-06-03 | 2021-09-07 | 上海中通吉网络技术有限公司 | Method for centralizing service flow |
| CN113672367A (en) * | 2021-08-16 | 2021-11-19 | 深圳壹账通智能科技有限公司 | Distributed timing task scheduling method and system |
| CN113742063A (en) * | 2021-08-06 | 2021-12-03 | 天津中新智冠信息技术有限公司 | Distributed timing scheduling system and method |
| CN113873005A (en) * | 2021-08-20 | 2021-12-31 | 浙江中控技术股份有限公司 | Node master selection method, system, equipment and medium for micro-service cluster |
| CN114020435A (en) * | 2021-11-09 | 2022-02-08 | 中国建设银行股份有限公司 | Task scheduling method, device, equipment and medium |
| CN114327817A (en) * | 2021-12-22 | 2022-04-12 | 马上消费金融股份有限公司 | Task fragmentation method and device and electronic equipment |
| CN117097621A (en) * | 2023-10-18 | 2023-11-21 | 易方信息科技股份有限公司 | Method, system, device and storage medium for discovering dynamic weights based on services |
| CN118714191A (en) * | 2024-08-28 | 2024-09-27 | 西安奇点能源股份有限公司 | Method for unified registration, discovery and calling of multi-type service |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20050188021A1 (en) * | 2003-12-30 | 2005-08-25 | Hans-Christoph Rohland | Cluster architecture having a star topology with centralized services |
| CN106533929A (en) * | 2016-12-30 | 2017-03-22 | 北京中电普华信息技术有限公司 | Micro-service development platform, generation method, deployment method and device |
| CN108418862A (en) * | 2018-01-31 | 2018-08-17 | 金蝶软件（中国）有限公司 | Micro services management method and system based on artificial intelligence service cloud platform |
| CN109981716A (en) * | 2017-12-28 | 2019-07-05 | 北京奇虎科技有限公司 | A kind of micro services call method and device |
-
2019
- 2019-12-31 CN CN201911400934.3A patent/CN111190736A/en active Pending
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20050188021A1 (en) * | 2003-12-30 | 2005-08-25 | Hans-Christoph Rohland | Cluster architecture having a star topology with centralized services |
| CN106533929A (en) * | 2016-12-30 | 2017-03-22 | 北京中电普华信息技术有限公司 | Micro-service development platform, generation method, deployment method and device |
| CN109981716A (en) * | 2017-12-28 | 2019-07-05 | 北京奇虎科技有限公司 | A kind of micro services call method and device |
| CN108418862A (en) * | 2018-01-31 | 2018-08-17 | 金蝶软件（中国）有限公司 | Micro services management method and system based on artificial intelligence service cloud platform |
Cited By (22)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111736977A (en) * | 2020-07-21 | 2020-10-02 | 成都新希望金融信息有限公司 | Central dispatching method and system for multiple middle stations |
| CN112084765A (en) * | 2020-08-26 | 2020-12-15 | 武汉普利商用机器有限公司 | Automatic classification method and device, electronic equipment and storage medium |
| CN112181438A (en) * | 2020-09-18 | 2021-01-05 | 杭州卓健信息科技有限公司 | Micro-service independent deployment system and method in 2B SAAS platform |
| CN112231089A (en) * | 2020-11-02 | 2021-01-15 | 广州市网星信息技术有限公司 | Task scheduling method, device, equipment, system and storage medium |
| CN112637335B (en) * | 2020-12-22 | 2022-02-22 | 新华三大数据技术有限公司 | Main/standby mode service deployment method, device, equipment and storage medium |
| CN112637335A (en) * | 2020-12-22 | 2021-04-09 | 新华三大数据技术有限公司 | Main/standby mode service deployment method, device, equipment and storage medium |
| CN112738339A (en) * | 2020-12-29 | 2021-04-30 | 杭州东信北邮信息技术有限公司 | Service instance lossless capacity expansion and reduction method under telecommunication domain micro-service architecture |
| CN112817717A (en) * | 2021-01-28 | 2021-05-18 | 新华三大数据技术有限公司 | Scheduling method and device for timing task |
| CN112817717B (en) * | 2021-01-28 | 2024-02-09 | 新华三大数据技术有限公司 | Scheduling method and device for timing tasks |
| CN113010284A (en) * | 2021-03-04 | 2021-06-22 | 万翼科技有限公司 | Scheduling method and device of micro-service module, storage medium and electronic device |
| CN113010284B (en) * | 2021-03-04 | 2024-06-28 | 万翼科技有限公司 | Micro-service module scheduling method and device, storage medium and electronic device |
| CN113364706B (en) * | 2021-06-03 | 2023-01-31 | 上海中通吉网络技术有限公司 | Method for centralizing service flow |
| CN113364706A (en) * | 2021-06-03 | 2021-09-07 | 上海中通吉网络技术有限公司 | Method for centralizing service flow |
| CN113742063A (en) * | 2021-08-06 | 2021-12-03 | 天津中新智冠信息技术有限公司 | Distributed timing scheduling system and method |
| CN113672367A (en) * | 2021-08-16 | 2021-11-19 | 深圳壹账通智能科技有限公司 | Distributed timing task scheduling method and system |
| CN113873005A (en) * | 2021-08-20 | 2021-12-31 | 浙江中控技术股份有限公司 | Node master selection method, system, equipment and medium for micro-service cluster |
| CN113873005B (en) * | 2021-08-20 | 2023-12-19 | 浙江中控技术股份有限公司 | Node selection method, system, equipment and medium for micro-service cluster |
| CN114020435A (en) * | 2021-11-09 | 2022-02-08 | 中国建设银行股份有限公司 | Task scheduling method, device, equipment and medium |
| CN114327817A (en) * | 2021-12-22 | 2022-04-12 | 马上消费金融股份有限公司 | Task fragmentation method and device and electronic equipment |
| CN117097621A (en) * | 2023-10-18 | 2023-11-21 | 易方信息科技股份有限公司 | Method, system, device and storage medium for discovering dynamic weights based on services |
| CN117097621B (en) * | 2023-10-18 | 2024-03-19 | 易方信息科技股份有限公司 | Method, system, device and storage medium for discovering dynamic weights based on services |
| CN118714191A (en) * | 2024-08-28 | 2024-09-27 | 西安奇点能源股份有限公司 | Method for unified registration, discovery and calling of multi-type service |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111190736A (en) | Low-intrusion distributed timing task scheduling system and method based on microservice | |
| CN107332876B (en) | Method and device for synchronizing block chain state | |
| US8375001B2 (en) | Master monitoring mechanism for a geographical distributed database | |
| CN109344014B (en) | Main/standby switching method and device and communication equipment | |
| CN106936618B (en) | Data acquisition method and system | |
| US7984094B2 (en) | Using distributed queues in an overlay network | |
| US9367261B2 (en) | Computer system, data management method and data management program | |
| US9071612B2 (en) | Service providing system | |
| CN104679796A (en) | Selecting method, selecting device and database mirror image cluster node | |
| CN111404730B (en) | State synchronization method and device of virtual router, electronic equipment and storage medium | |
| US11271714B2 (en) | Time synchronization system, time master, management master, and time synchronization method | |
| CN110557416B (en) | Multi-node collaborative blocking method and system | |
| CN110213359B (en) | Internet of vehicles networking data pushing system and method based on D2D | |
| CN114285795A (en) | State control method, device, equipment and storage medium of virtual equipment | |
| CN112865995B (en) | Distributed master-slave system | |
| CN113055461A (en) | ZooKeeper-based unmanned cluster distributed cooperative command control method | |
| CN107046474B (en) | service cluster | |
| Bezerra et al. | Ridge: high-throughput, low-latency atomic multicast | |
| CN113765690A (en) | Cluster switching method, system, device, terminal, server and storage medium | |
| CN110909048A (en) | Data query method, device, server, client and storage medium | |
| CN114116178B (en) | Cluster frame task management method and related device | |
| CN113064950B (en) | Data synchronization method, device, equipment and storage medium | |
| CN112954133B (en) | Method, device, electronic device and storage medium for synchronizing node time | |
| CN113760519B (en) | Distributed transaction processing method, device, system and electronic equipment | |
| CN117120993A (en) | Geographically dispersed hybrid cloud clusters |
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 | ||
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20200522 |