CN110865876A - Scheduling method and device for service dependent resources - Google Patents
Scheduling method and device for service dependent resources Download PDFInfo
- Publication number
- CN110865876A CN110865876A CN201910901043.XA CN201910901043A CN110865876A CN 110865876 A CN110865876 A CN 110865876A CN 201910901043 A CN201910901043 A CN 201910901043A CN 110865876 A CN110865876 A CN 110865876A
- Authority
- CN
- China
- Prior art keywords
- service
- dependence
- dependency
- priority
- sequence
- 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
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/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
-
- 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
Landscapes
- Engineering & Computer Science (AREA)
- Software Systems (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention relates to a scheduling method and a device of service dependent resources, wherein the method comprises the following steps: acquiring all service dependencies of a preset project; calculating the priority of all the service dependencies to obtain a service dependency sequence with the priority from high to low; and when a scheduling request of the service dependence is detected, selecting the service dependence meeting the preset condition in the service dependence sequence as the service dependence of the preset item. The technical scheme provided by the invention firstly divides all the service dependencies into a priority level, then selects the service dependencies meeting the requirements, and can call the service dependencies with the priority level lower than the service dependency priority level when a certain service dependency fails, thereby ensuring the normal operation of the project and improving the stability of the service.
Description
Technical Field
The invention relates to the technical field of computers, in particular to a scheduling method and device for service dependent resources.
Background
When a project is done, a plurality of external resources are usually called, and these external resources are called service dependencies of the project, and more service dependencies bring more functions but also bring more risks. For the service itself, once a certain service dependency in a plurality of service dependencies fails, the whole project is greatly influenced.
Therefore, it is desirable to provide a method and an apparatus for scheduling service-dependent resources to solve the deficiencies of the prior art.
Disclosure of Invention
In order to solve the problems in the prior art, the invention provides a scheduling method and a scheduling device for service dependent resources.
The application provides a scheduling method of service dependent resources, which comprises the following steps:
acquiring all service dependencies of a preset project;
calculating the priority of all the service dependencies to obtain a service dependency sequence with the priority from high to low;
and when a scheduling request of the service dependence is detected, selecting the service dependence meeting the preset condition in the service dependence sequence as the service dependence of the preset item.
Further, the calculating the priority of all the service dependencies to obtain a sequence of service dependencies with high to low priorities includes:
acquiring historical calling times and calling information of each service dependence;
calculating the priority of each service dependence according to the historical calling times and the calling interface information;
and determining the priority of each service dependence according to the priority of each service dependence to obtain a service dependence sequence with the priority from high to low.
Further, the calling information includes: query rate per second, average response time, and error rate.
Further, when a scheduling request of a service dependency is detected, selecting the service dependency meeting a preset condition in the service dependency sequence as the service dependency of the preset item includes:
when a scheduling request of service dependence is detected, acquiring the first service dependence in the service dependence sequence;
judging whether the first service dependence fails or not;
if the first service dependence does not have a fault, judging that the first service dependence meets a preset condition;
and selecting the first service dependence as the service dependence of the preset item.
Further, the method further comprises:
if the first service dependency fails, acquiring a second service dependency until acquiring a service dependency which does not fail;
and selecting the service dependence which does not have the fault as the service dependence of the preset item.
The present application further provides a scheduling apparatus for a service dependent resource, including:
the acquisition module is used for acquiring all service dependencies of the preset project;
the calculation module is used for calculating the priority of all the service dependencies to obtain a service dependency sequence with the priority from high to low;
and the selection module is used for selecting the service dependence meeting the preset condition in the service dependence sequence when the scheduling request of the service dependence is detected.
Further, the calculation module includes:
the first obtaining submodule is used for obtaining the historical calling times and calling information of each service dependence;
the calculation submodule is used for calculating the priority of each service dependence according to the historical calling times and the calling interface information;
and the determining submodule is used for determining the priority of each service dependence according to the priority of each service dependence to obtain a service dependence sequence with the priority from high to low.
Further, the calling information includes: query rate per second, average response time, and error rate.
Further, the selection module comprises:
the second obtaining submodule is used for obtaining a first service dependency in the service dependency sequence when the scheduling request of the service dependency is detected;
the judging submodule is used for judging whether the first service dependence fails or not;
the judgment submodule is used for judging that the first service dependence meets the preset condition if the first service dependence does not have a fault;
and the first selection submodule is used for selecting the first service dependency as the service dependency of the preset item.
Further, the selection module further comprises:
a third obtaining submodule, configured to obtain a second service dependency if the first service dependency fails until a service dependency that does not fail is obtained;
and the second selection submodule is used for selecting the service dependence which does not have the fault as the service dependence of the preset item.
Compared with the closest prior art, the technical scheme of the invention has the following advantages:
the technical scheme provided by the invention comprises the steps of firstly obtaining all service dependencies of a preset project, then calculating the priorities of all the service dependencies to obtain a service dependency sequence with the priorities from high to low, and finally selecting the service dependencies meeting preset conditions in the service dependency sequence as the service dependencies of the preset project when a call request of the service dependencies is detected. The technical scheme provided by the invention firstly divides all the service dependencies into a priority level, then selects the service dependencies meeting the requirements, and can call the service dependencies with the priority level lower than the service dependency priority level when a certain service dependency fails, thereby ensuring the normal operation of the project and improving the stability of the service.
Drawings
Fig. 1 is a flowchart of a scheduling method for service dependent resources according to an embodiment of the present invention;
FIG. 2 is a flow chart of a method for calculating service dependency priorities provided by an embodiment of the present invention;
fig. 3 is a block diagram of a scheduling apparatus for service-dependent resources according to an embodiment of the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the embodiments of the present invention clearer, 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, but 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, are within the scope of the present invention.
As shown in fig. 1, the present invention provides a method for scheduling service-dependent resources, which may include the following steps:
in step S101, all service dependencies of preset items are acquired.
In the embodiment of the application, all service dependencies of the project are acquired based on the working data of the external resources of the project.
In step S102, the priorities of all the service dependencies are calculated, and a sequence of service dependencies with priorities from high to low is obtained.
In the embodiment of the application, the priorities of all the service dependencies acquired in the last step are calculated, and the priorities of the service dependencies are determined according to the priority values, so that a service dependency sequence with the priorities from high to low is obtained.
The method for calculating the service-dependent priority is described in detail in the following embodiments, and is not described again.
In step S103, when a scheduling request of a service dependency is detected, the service dependency meeting a preset condition in the service dependency sequence is selected as the service dependency of the preset item.
In this embodiment, when the preset item sends a scheduling request of service dependency, one service dependency meeting a preset condition is selected from the obtained service dependency sequence as the service dependency of the preset item.
The preset condition means that no fault occurs, and the selected service dependence can meet the requirements of the project.
According to the method and the device for processing the service dependency, all the service dependencies of the preset project are obtained, then the priorities of all the service dependencies are calculated, a service dependency sequence with the priorities from high to low is obtained, and finally when a call request of the service dependency is detected, the service dependency meeting the preset conditions in the service dependency sequence is selected to serve as the service dependency of the preset project. The technical scheme provided by the invention divides all the service dependencies into a priority level, then selects the service dependencies meeting the requirements, and can call the service dependencies with the priority level lower than the service dependency priority level when a certain service dependency fails, thereby ensuring the normal operation of the project and improving the stability of the service.
In a possible embodiment of the present application, the priority of all the service dependencies is calculated, and a sequence of service dependencies with high to low priorities is obtained, as shown in fig. 2, which specifically includes:
in step S201, the history number of calls and call information of each service dependency are acquired.
In the embodiment of the application, the historical calling times of each service dependency in all the service dependencies of the preset items and the calling information of the application program interface used for calling the service dependencies are obtained. The calling information specifically includes data such as query rate per second, average response time, and error rate.
In step S202, a priority of each service dependency is calculated according to the historical call times and the call interface information.
In the embodiment of the present application, the priority of each service dependency is calculated according to the obtained historical calling times of the service dependency and the data such as the query rate per second, the average response time, and the error rate of the application program interface used for calling the service dependency.
Specifically, each time a service-dependent call task is completed, the current call data including response time, error rate, query rate per second and other factors is obtained, and the priority of the service dependence is generated together with historical data.
In step S203, the priority of each service dependency is determined according to the priority of each service dependency, and a sequence of service dependencies with high to low priorities is obtained.
In the embodiment of the present application, the priority of each service dependency is obtained according to the above calculation, and then all the priorities are compared to obtain a priority ranking from large to small, where the ranking is a sequence of service dependencies with priorities from high to low.
In a possible embodiment of the present application, when a scheduling request of a service dependency is detected, selecting the service dependency meeting a preset condition in the service dependency sequence as the service dependency of the preset item specifically includes:
when a scheduling request of service dependence is detected, acquiring the first service dependence in the service dependence sequence;
judging whether the first service dependence fails or not;
if the first service dependence does not have a fault, judging that the first service dependence meets a preset condition;
and selecting the first service dependence as the service dependence of the preset item.
That is, when a scheduling request of a service dependency sent by a preset item is detected, a first service dependency in the obtained service dependency sequence is obtained, and then whether the service dependency has a fault is determined, if the fault does not occur, it is indicated that the service dependency meets a preset condition, and the service dependency can be used as the service dependency of the preset item. If the fault occurs, the service dependency does not meet the preset condition, at this time, a second service dependency needs to be selected, whether the service dependency meets the preset condition is judged, until the service dependency without the fault is selected, and the service dependency without the fault is used as the service dependency of the preset item.
In one possible implementation manner of the application, when a certain project needs to call an external service dependency, a current optimal scheme is selected first, if the call fails, a failure condition and error feedback are recorded, and meanwhile, schemes with secondary priorities are called in sequence until a call target is met, so that the conventional operation of the project or the external call target is completed. And obtaining the calling data including response time, error rate, query rate per second and other factors every time the calling task of the service dependence is completed, generating the priority of the service dependence by combining the calling data with historical data, and comparing the priority of the background resource to debug the priority level of the background resource, so that the priority of the service is higher and higher.
In a specific embodiment of the application, for a voice synthesis service, access dependent on services such as news flight, Tencent and Rokid can be selected, a resource priority level is calculated according to a query rate per second, an average response time and an error rate, whenever the scheduling service receives a scheduling request dependent on the services, a resource with the highest current priority is selected for access to perform voice synthesis, once access fails, the error is recorded, a secondary resource is selected to complete a voice synthesis service and a synthesis result is returned, each voice synthesis request can be successfully completed, and huge faults such as no return and service collapse cannot occur.
Based on the same inventive concept, the present invention further provides a scheduling apparatus for service dependent resources, as shown in fig. 3, the apparatus specifically includes: an acquisition module 101, a calculation module 102 and a selection module 103.
The acquisition module 101 is configured to acquire all service dependencies of preset items.
The calculation module 102 is configured to calculate the priority of all the service dependencies, resulting in a sequence of service dependencies with high to low priority.
The selection module 103 is configured to select a service dependency in the service dependency sequence that meets a preset condition when a scheduling request of the service dependency is detected.
In one possible implementation manner of the present application, the calculation module 102 specifically includes: the device comprises a first obtaining submodule, a calculating submodule and a determining submodule.
The first obtaining submodule is configured to obtain the historical call times and call information of each service dependency.
The calculation submodule is configured to calculate a priority of each service dependency according to the historical call times and the call interface information.
The determining submodule is configured to determine the priority of each service dependency according to the priority of each service dependency, and obtain a sequence of service dependencies with high to low priorities.
In one possible embodiment of the present application, the call information includes: query rate per second, average response time, and error rate.
In a possible embodiment of the present application, the selecting module 103 specifically includes: the device comprises a second obtaining submodule, a judging submodule and a first selecting submodule.
The second obtaining submodule is configured to obtain a first service dependency in the service dependency sequence when the scheduling request of the service dependency is detected;
the determining submodule is configured to determine whether the first service dependency fails;
the determining submodule is configured to determine that the first service dependency meets a preset condition if the first service dependency does not fail;
the first selection submodule is configured to select the first service dependency as a service dependency of the preset item.
In a possible embodiment of the present application, the selecting module 103 further includes: a third acquisition submodule and a second selection submodule.
The third obtaining submodule is configured to obtain a second service dependency if the first service dependency fails until a service dependency which does not fail is obtained;
the second selection submodule is configured to select the non-failed service dependency as a service dependency of a preset item.
It is noted that, in this document, relational terms such as "first" and "second," and the like, may be used solely to distinguish one entity or action from another entity or action without necessarily requiring or implying any actual such relationship or order between such entities or actions.
It is to be understood that the embodiments described herein may be implemented in hardware, software, firmware, middleware, microcode, or any combination thereof. For a hardware implementation, the Processing units may be implemented within one or more Application Specific Integrated Circuits (ASICs), Digital Signal Processors (DSPs), Digital Signal Processing Devices (DSPDs), Programmable Logic Devices (PLDs), Field Programmable Gate Arrays (FPGAs), general purpose processors, controllers, micro-controllers, microprocessors, other electronic units configured to perform the functions described herein, or a combination thereof.
For a software implementation, the techniques described herein may be implemented by means of units performing the functions described herein. The software codes may be stored in a memory and executed by a processor. The memory may be implemented within the processor or external to the processor.
Those of ordinary skill in the art will appreciate that the various illustrative elements and algorithm steps described in connection with the embodiments disclosed herein may be implemented as electronic hardware or combinations of computer software and electronic hardware. Whether such functionality is implemented as hardware or software depends upon the particular application and design constraints imposed on the implementation. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present invention.
In the embodiments provided in the present application, it should be understood that the disclosed apparatus and method may be implemented in other ways. For example, the above-described apparatus embodiments are merely illustrative, and for example, the division of the units is only one logical division, and other divisions may be realized in practice, for example, a plurality of units or components may be combined or integrated into another system, or some features may be omitted, or not executed. In addition, the shown or discussed mutual coupling or direct coupling or communication connection may be an indirect coupling or communication connection through some interfaces, devices or units, and may be in an electrical, mechanical or other form.
In addition, functional units in the embodiments of the present invention may be integrated into one processing unit, or each unit may exist alone physically, or two or more units are integrated into one unit.
The functions, if implemented in the form of software functional units and sold or used as a stand-alone product, may be stored in a computer readable storage medium. Based on such understanding, the technical solutions of the embodiments of the present invention may be essentially implemented or make a contribution to the prior art, or may be implemented in the form of a software product stored in a storage medium and including instructions for causing a computer device (which may be a personal computer, a server, or a network device) to execute all or part of the steps of the methods described in the embodiments of the present invention. And the aforementioned storage medium includes: various media capable of storing program codes, such as a U disk, a removable hard disk, a ROM, a RAM, a magnetic disk, or an optical disk.
It is to be noted that the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising an … …" does not exclude the presence of other identical elements in a process, method, article, or apparatus that comprises the element.
Finally, it should be noted that: the above examples are only intended to illustrate the technical solution of the present invention, but not to limit it; although the present invention has been described in detail with reference to the foregoing embodiments, it will be understood by those of ordinary skill in the art that: the technical solutions described in the foregoing embodiments may still be modified, or some technical features may be equivalently replaced; and such modifications or substitutions do not depart from the spirit and scope of the corresponding technical solutions of the embodiments of the present invention.
Claims (10)
1. A method for scheduling service dependent resources, comprising:
acquiring all service dependencies of a preset project;
calculating the priority of all the service dependencies to obtain a service dependency sequence with the priority from high to low;
and when a scheduling request of the service dependence is detected, selecting the service dependence meeting the preset condition in the service dependence sequence as the service dependence of the preset item.
2. The method according to claim 1, wherein the calculating the priorities of all the service dependencies to obtain a sequence of service dependencies with high priorities to low priorities comprises:
acquiring historical calling times and calling information of each service dependence;
calculating the priority of each service dependence according to the historical calling times and the calling interface information;
and determining the priority of each service dependence according to the priority of each service dependence to obtain a service dependence sequence with the priority from high to low.
3. The method according to claim 2, wherein the call information comprises: query rate per second, average response time, and error rate.
4. The method according to claim 1, wherein the selecting, when a scheduling request of a service dependency is detected, a service dependency meeting a preset condition in the service dependency sequence as the service dependency of the preset item includes:
when a scheduling request of service dependence is detected, acquiring the first service dependence in the service dependence sequence;
judging whether the first service dependence fails or not;
if the first service dependence does not have a fault, judging that the first service dependence meets a preset condition;
and selecting the first service dependence as the service dependence of the preset item.
5. The method for scheduling service dependent resources according to claim 4, wherein the method further comprises:
if the first service dependency fails, acquiring a second service dependency until acquiring a service dependency which does not fail;
and selecting the service dependence which does not have the fault as the service dependence of the preset item.
6. An apparatus for service-dependent resource scheduling, comprising:
the acquisition module is used for acquiring all service dependencies of the preset project;
the calculation module is used for calculating the priority of all the service dependencies to obtain a service dependency sequence with the priority from high to low;
and the selection module is used for selecting the service dependence meeting the preset condition in the service dependence sequence when the scheduling request of the service dependence is detected.
7. The apparatus for scheduling service-dependent resources according to claim 6, wherein the computing module comprises:
the first obtaining submodule is used for obtaining the historical calling times and calling information of each service dependence;
the calculation submodule is used for calculating the priority of each service dependence according to the historical calling times and the calling interface information;
and the determining submodule is used for determining the priority of each service dependence according to the priority of each service dependence to obtain a service dependence sequence with the priority from high to low.
8. The apparatus as claimed in claim 7, wherein the invocation information includes: query rate per second, average response time, and error rate.
9. The apparatus of claim 6, wherein the selection module comprises:
the second obtaining submodule is used for obtaining a first service dependency in the service dependency sequence when the scheduling request of the service dependency is detected;
the judging submodule is used for judging whether the first service dependence fails or not;
the judgment submodule is used for judging that the first service dependence meets the preset condition if the first service dependence does not have a fault;
and the first selection submodule is used for selecting the first service dependency as the service dependency of the preset item.
10. The apparatus of claim 9, wherein the selecting module further comprises:
a third obtaining submodule, configured to obtain a second service dependency if the first service dependency fails until a service dependency that does not fail is obtained;
and the second selection submodule is used for selecting the service dependence which does not have the fault as the service dependence of the preset item.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910901043.XA CN110865876A (en) | 2019-09-23 | 2019-09-23 | Scheduling method and device for service dependent resources |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910901043.XA CN110865876A (en) | 2019-09-23 | 2019-09-23 | Scheduling method and device for service dependent resources |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN110865876A true CN110865876A (en) | 2020-03-06 |
Family
ID=69652243
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910901043.XA Pending CN110865876A (en) | 2019-09-23 | 2019-09-23 | Scheduling method and device for service dependent resources |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110865876A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113114639A (en) * | 2021-03-29 | 2021-07-13 | 北京达佳互联信息技术有限公司 | Method and device for configuring service registration center, electronic equipment and storage medium |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101674320A (en) * | 2008-09-12 | 2010-03-17 | 阿里巴巴集团控股有限公司 | Service addressing method and device in cluster environment |
| US20140372630A1 (en) * | 2013-06-12 | 2014-12-18 | International Business Machines Corporation | Service oriented architecture service dependency determination |
| CN107957915A (en) * | 2017-11-21 | 2018-04-24 | 上海壹账通金融科技有限公司 | A kind of heartbeat detecting method, storage medium and the server of called method, system |
| CN108282405A (en) * | 2017-12-27 | 2018-07-13 | 努比亚技术有限公司 | Application programming interfaces buffer memory management method, application server and storage medium |
| CN108681492A (en) * | 2018-05-22 | 2018-10-19 | 阿里巴巴集团控股有限公司 | Data processing method and device |
| CN109542645A (en) * | 2018-11-20 | 2019-03-29 | 北京锐安科技有限公司 | A kind of method, apparatus, electronic equipment and storage medium calling service |
-
2019
- 2019-09-23 CN CN201910901043.XA patent/CN110865876A/en active Pending
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101674320A (en) * | 2008-09-12 | 2010-03-17 | 阿里巴巴集团控股有限公司 | Service addressing method and device in cluster environment |
| US20140372630A1 (en) * | 2013-06-12 | 2014-12-18 | International Business Machines Corporation | Service oriented architecture service dependency determination |
| CN107957915A (en) * | 2017-11-21 | 2018-04-24 | 上海壹账通金融科技有限公司 | A kind of heartbeat detecting method, storage medium and the server of called method, system |
| CN108282405A (en) * | 2017-12-27 | 2018-07-13 | 努比亚技术有限公司 | Application programming interfaces buffer memory management method, application server and storage medium |
| CN108681492A (en) * | 2018-05-22 | 2018-10-19 | 阿里巴巴集团控股有限公司 | Data processing method and device |
| CN109542645A (en) * | 2018-11-20 | 2019-03-29 | 北京锐安科技有限公司 | A kind of method, apparatus, electronic equipment and storage medium calling service |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113114639A (en) * | 2021-03-29 | 2021-07-13 | 北京达佳互联信息技术有限公司 | Method and device for configuring service registration center, electronic equipment and storage medium |
| CN113114639B (en) * | 2021-03-29 | 2023-01-20 | 北京达佳互联信息技术有限公司 | Method and device for configuring service registration center, electronic equipment and storage medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US10379838B1 (en) | Update and rollback of code and API versions | |
| US9553781B2 (en) | Service level agreement based storage access | |
| US8839049B2 (en) | Dynamically allocating multitier applications based upon application requirements and performance reliability of resources | |
| US9836363B2 (en) | Semi-automatic failover | |
| US20120290348A1 (en) | Routing service requests based on lowest actual cost within a federated virtual service cloud | |
| US20160162551A1 (en) | Application Recommending Method and System, and Server | |
| US10725763B1 (en) | Update and rollback of configurations in a cloud-based architecture | |
| US20160269257A1 (en) | Deploying applications in a networked computing environment | |
| US20170140315A1 (en) | Managing incident tickets in a cloud managed service environment | |
| CN109669631B (en) | Storage pool planning method, device, equipment and computer readable storage medium | |
| CN106920024B (en) | Business process management method, device and equipment | |
| US10884885B2 (en) | Proactively predicting failure in data collection devices and failing over to alternate data collection devices | |
| US20200236169A1 (en) | Cloud platform or cloud provider selection | |
| US20170031764A1 (en) | Restoration of consistent regions within a streaming environment | |
| EP2776941B1 (en) | Managing capacity in a data center by suspending tenants | |
| CN110865876A (en) | Scheduling method and device for service dependent resources | |
| CN107784043B (en) | Monitoring method, device and system for data table of data warehouse | |
| CN113765966A (en) | Load balancing method and device | |
| CN111866129A (en) | Method, device and medium for determining service availability index based on cloud platform | |
| CN115190010B (en) | Distributed recommendation method and device based on software service dependency relationship | |
| US20200065233A1 (en) | Automatically establishing significance of static analysis results | |
| CN110930253A (en) | Intelligent contract internal main key generation method and device, computer equipment and storage medium | |
| US20200034174A1 (en) | System and method for guided system restoration | |
| KR102464688B1 (en) | Method and apparatus for detrmining event level of monitoring result | |
| CN112583732B (en) | Flow control method and related equipment based on control granularity pool interface call |
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: 20200306 |