CN102681881B - Across machine dispatching method and system thereof - Google Patents
Across machine dispatching method and system thereof Download PDFInfo
- Publication number
- CN102681881B CN102681881B CN201110053551.0A CN201110053551A CN102681881B CN 102681881 B CN102681881 B CN 102681881B CN 201110053551 A CN201110053551 A CN 201110053551A CN 102681881 B CN102681881 B CN 102681881B
- Authority
- CN
- China
- Prior art keywords
- computer node
- subordinate computer
- node
- subordinate
- call
- 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.)
- Active
Links
Abstract
The invention provides a kind of across machine dispatching system, it is characterized in that, comprise host node and subordinate computer node, wherein, host node is configured to send call request according to subordinate computer node information, predefine flow control information and subordinate computer node state to subordinate computer node; Subordinate computer node is configured to perform call request and will call result return host node.
Description
Technical field
The program that the present invention relates to computer system performs, and particularly relates to across machine dispatching method and system thereof.
Background technology
UNIX is the operating system of a multi-user, multitask, at one time, multiple process can be had to be performed simultaneously.Process is system program or the once operation of application program in internal memory, is the executive routine of the current operation of operating system.Process and program not one_to_one corresponding, a program can perform as multiple process.In unix system, process scheduling is realized by system call.The process scheduling of operating system, mainly realizes the scheduling according to priority, each process being carried out to time-slotting, to share resource (mainly CPU).The flow scheduling of process refers to that multiple process is performed according to predefine flow process.
UNIX operating system does not directly provide the controlling functions called according to predefine flow process process.Directly realize the mode of predefine flow scheduling under an operating system, generally write command script (shell), but there is following shortcoming in the mode of this command script: because command script writes for the flow scheduling of process, the corresponding a kind of scheduling flow of each shell, therefore once flow process changes, then need to revise invoke script.And for the execution step with certain logical relation, this logical relation between step is uncontrollable.
Application number is the process dispatch method that application discloses a kind of application process of 200610028504.X, and the process dispatch method adopting command script mode to realize under which solving Unix (Linux) environment is single, cannot meet the problem of multiple application process scheduling according to predefine flow process.This method setting procedure dispatch service program, comprising: reading prearranged service course information; Create output message queue and the input message queue corresponding with described service course configuration; Read single step predefine flow control information one by one, when performing call request, write the input message queue of corresponding with service, perform to call when returning and read output message queue.
But the feature that networking and isomerization along with computer system computing are disposed is more and more obvious, and said method or the middleware system towards OLTP are difficult to adapt to complicated Distributed Application.Such as, more complicated in the situation dispatching mode of multimachine deployment.Some application program and machine have nothing to do; Some application, to place main frame and position sensing, requires to enforce or need to run in specified machine on all addressable machines.Further, batch processing system requires high-performance, namely the abundant as far as possible utilization of hardware resources of whole process is until all flow tasks terminate, and calculated amount is large, the process flow operation time is long, need stronger high availability, even will possess certain disaster tolerance function, do not affect the execution of flow process when process lost efficacy even part physical machine failure as far as possible.
For achieving the above object, need a kind of be applicable to Unix/Linux type systematic towards batch application across machine dispatching system.
Summary of the invention
One or more target of the present invention is achieved through the following technical solutions,
A kind of across machine dispatching method, it is characterized in that, comprise the following steps:
A () receives predefine flow execution request at host node place,
B () reads predefine flow process configuration information at host node place,
C () reads subordinate computer node information at host node place, and load subordinate computer node list,
D () reads predefine flow control information at host node place, and send call request according to predefine flow control information to subordinate computer node,
E () performs call request at subordinate computer node place,
F () will call result at subordinate computer node place and return host node.
Preferably, subordinate computer node information comprises the information of the processing power about subordinate computer node, and predefine flow control information comprises the method for calling of predefine flow process.
Preferably, before sending call request to subordinate computer node, query manipulation is comprised further, wherein, this query manipulation comprises: the step being sent query argument by host node to subordinate computer node, and, returned the step of subordinate computer node state to host node by subordinate computer node.
Preferably, when the method for calling of the indicating predetermined adopted flow process of predefine flow control information be per-unit synchronous call time, the first subordinate computer node in the list of inquiry subordinate computer node, and, when the first available free process of subordinate computer node, call request is sent to the first subordinate computer node, when the first subordinate computer node does not have idle process, flow process failure.
Preferably, when the method for calling of the indicating predetermined adopted flow process of predefine flow control information be Multi-Machine Synchronous call time, the first subordinate computer node in the list of inquiry subordinate computer node, and, when the first available free process of subordinate computer node, send call request to the first subordinate computer node, when the first subordinate computer node does not have idle process, the second subordinate computer node in inquiry subordinate computer node list, when the second available free process of subordinate computer node, sends call request to the second subordinate computer node.
Preferably, when the method for calling of the indicating predetermined adopted flow process of predefine flow control information be multimachine forced synchronism call time, the subordinate computer node of specifying in the list of inquiry subordinate computer node, when the subordinate computer node of specifying all has idle process, call request is sent to the subordinate computer node of specifying, otherwise, flow process failure.Call successfully, result will be called at the subordinate computer node place specified and synchronously return host node.
Preferably, when the method for calling of the indicating predetermined adopted flow process of predefine flow control information is unit asynchronous call, the first subordinate computer node in the list of inquiry subordinate computer node, the idle process quantity according to the first subordinate computer node sends call request.Call successfully, will call at the first subordinate computer node place that result is asynchronous returns host node.
Preferably, after host node one of receiving from the first subordinate computer node calls result, just a new call request is sent to the first subordinate computer node.
Preferably, when the method for calling of the indicating predetermined adopted flow process of predefine flow control information is multimachine asynchronous call, the subordinate computer node of specifying in the list of inquiry subordinate computer node, the idle process quantity according to the subordinate computer node of specifying sends call request.Call successfully, will call at the subordinate computer node place specified that result is asynchronous returns host node.
Preferably, host node receive from the subordinate computer node of specifying call result after the subordinate computer node of just specifying to this send new call request.
A kind of across machine dispatching system, it is characterized in that, comprise host node and subordinate computer node, wherein, host node is configured to send call request according to subordinate computer node information, predefine flow control information and subordinate computer node state to subordinate computer node; Subordinate computer node is configured to perform call request and will call result return host node.
Preferably, also store respective subordinate computer node information in subordinate computer node, described respective subordinate computer node information is consistent with the subordinate computer node information stored in host node.
Preferably, host node connects acquisition conversation subordinate computer node state by initiating inquiry to subordinate computer node, wherein, connects session send call request directly to subordinate computer node by this inquiry.
Preferably, host node and one or more subordinate computer node are deployed on Same Physical machine jointly.
The present invention is by arranging hypotactic logical server being distributed in the computing machine on network, coordinate message queue mechanism, under achieving distributed environment, multiple process carries out disposing across machine according to predefine flow process, across host schedules, support synchronization call (forbidding multimachine/permission multimachine/pressure multimachine), asynchronous call (forbidding multimachine/permission multimachine), thus meet multiple call flow.In the scheduling of multiple process, the present invention additionally uses message queue controlling mechanism, for the execution step with logical relation, and the logic control between the combination method of calling performing step that can pass through one process/multi-process, synchronous/asynchronous.
In the present invention, host node can Real-time Obtaining progress information, as far as possible maximum resource utilization factor when dispatching.When process or subordinate computer node lost efficacy, can the transfer of subordinate computer node be realized by simple modification configuration file or enable.Between scheduling function by main frame and the management function from machine separately, make the degree of coupling between system component lower, the position of process scheduling is transparent to subordinate computer node, can arbitrarily specify, and considerably increases the dirigibility of system.
Accompanying drawing explanation
After having read the specific embodiment of the present invention with reference to accompanying drawing, those skilled in the art will become apparent various aspects of the present invention.One skilled in the art will appreciate that these accompanying drawings only for coordinating embodiment that technical scheme of the present invention is described, and and be not intended to be construed as limiting protection scope of the present invention.Wherein,
Fig. 1 is the schematic diagram across machine dispatching system according to the embodiment of the present invention.
Fig. 2 is the process flow diagram across machine dispatching method according to the embodiment of the present invention.
Embodiment
For enabling above-mentioned purpose of the present invention, feature and advantage become apparent more, and below in conjunction with the drawings and specific embodiments, the present invention is further detailed explanation.
Fig. 1 is the schematic diagram across machine dispatching system according to the embodiment of the present invention.As shown in the figure, the logic module of realization flow dispatch service divides 2 grades of logics to dispose.The first order is host node (the first logical server), as the executor of flow scheduling; The second level is subordinate computer node (the second logical server), for managing the process of each application program, and distributes the call request from host node.Host node and subordinate computer node can be deployed on different physical machines as logical services module, and host node also can be deployed on a physical machine with one or more subordinate computer node jointly.Host node can be communicated by socket with subordinate computer node, host node also can by socket externally system provide predefine flow performing to serve.
Predefine flow process configuration information, subordinate computer node information and predefine flow control information has also been shown by the dashed box in Fig. 1.Wherein, the instruction of predefine flow process configuration information performs the resource distribution required for predefine flow process, such as, and the application name that perform or specific instruction sequence title, and the configuration of the process of these application programs or specific instruction sequence.Subordinate computer node information comprises the information of the processing power about subordinate computer node.Here, the information of processing power can indicate corresponding subordinate computer node can be suitable for performing which application program or specific instruction sequence, and the maximum configured number of processes of subordinate computer node.Be understandable that, the information of above-mentioned processing power can also comprise the resource distribution of corresponding subordinate computer node, such as cpu resource, memory source etc.In addition, subordinate computer node information can also comprise the information that can be performed by which subordinate computer node about various application program or specific instruction sequence, such as, and can by the identifier linkage of application program or specific instruction sequence and corresponding subordinate computer node.Predefine flow control information is made up of one or more orderly Row control order, and it can comprise the method for calling of predefine flow process, call parameters, application program identification or specific instruction sequence mark.Here, the method for calling of predefine flow process can comprise that per-unit synchronous calls, Multi-Machine Synchronous calls, multimachine forced synchronism is called, unit asynchronous call and multimachine asynchronous call.Here, synchronization call refers to that the same time can only initiate once to call, and after this calls and returns, just can call next time; After asynchronous call refers to and sends and once call, not etc. to be returned can again sending is not called, and is namely equivalent to the same time can send multiple calling.Hereafter in detail the realization of these method of calling will be described.Predefine flow process configuration information, subordinate computer node information and predefine flow control information in host node can be pre-arranged and be stored in one or more configuration file.
In one embodiment of the invention, respective subordinate computer node information can also be stored at each subordinate computer node, make described respective subordinate computer node information consistent from the nodal information of machine with each storage in host node by the storage file of internet or LAN (Local Area Network) synchronous subordinate computer node information.Like this, by the subordinate computer node information making host node and corresponding subordinate computer node keep identical, the system overall situation can share consistent configuration information.When a certain subordinate computer node lost efficacy, the transfer of node can be realized easily by changing subordinate computer node information.
Fig. 2 is the process flow diagram across machine dispatching method according to the embodiment of the present invention.As shown in the figure, in step 201, predefine flow execution request is received at host node place.In step 202., predefine flow process configuration information is read at host node place to obtain the demand about pending predefine flow process.In step 203, read subordinate computer node information at host node place, analyze the processing power of subordinate computer node, and relevant subordinate computer node is loaded into subordinate computer node list.In step 204, read predefine flow control information at host node place, often perform a Row control order, the information according to this Row control order sends call request to subordinate computer node.Now, in a step 208, perform call request at subordinate computer node place, and return in step 209 and call result.Host node receives in step 210 to call and returns, and completes calling of a Row control order thus.After this, host node carries out calling of next Row control order according to the sequence of Row control order.Here, for completing above-mentioned steps, exemplarily, control module can be set at host node, return queue, cooperative module.Wherein, control module can as the execution module of flow scheduling; Returning queue for what deposit call request completes message, and control module reads this and completes from returning queue the performance that message (process transfer returns) obtains application program; Cooperative module is used for calling to return and put into from each subordinate computer node receiving process returning queue.Exemplarily, administration module, cooperative module, one or more input queue and an output queue can be set at subordinate computer node.Wherein, administration module uses and preserves and manage individual queue and state of a process; Cooperative module is used for the return messages of each process to pass to host node from output queue.Multiple input queue can be the process queue of different application separately respectively, also can be the concurrent processing that the multiple input queue of a certain application deployment is used for process, improve single step handling property.
As shown in Figure 2, before sending call request to subordinate computer node, the step 205 of inquiry subordinate computer node state can also be comprised and return the step 206 of subordinate computer node state.Wherein, send query argument by host node to subordinate computer node, subordinate computer node returns subordinate computer node state according to query argument to host node.Here, query argument can be the identifier that application name or specific instruction sequence etc. can indicate the task that should complete from machine.Subordinate computer node state can be the information corresponding to the reflection process statuss such as the quantity of the idle process of query argument of the subordinate computer node be queried, and subordinate computer node state can also be any information of the Current resource using state at reflection subordinate computer node place.
As previously mentioned, predefine flow control information comprises the method for calling of predefine flow process.When the method for calling of the indicating predetermined adopted flow process of predefine flow control information be per-unit synchronous call time, a subordinate computer node in the list of inquiry subordinate computer node, when the available free process of this subordinate computer node, sends call request to this subordinate computer node, otherwise, flow process failure.
When the method for calling of the indicating predetermined adopted flow process of predefine flow control information be Multi-Machine Synchronous call time, a subordinate computer node in the list of inquiry subordinate computer node, when the available free process of this subordinate computer node, sends call request to this subordinate computer node; When this subordinate computer node does not have idle process, another subordinate computer node in the list of inquiry subordinate computer node, until inquiry to the first node having idle process calls.If all subordinate computer nodes in subordinate computer node list all do not have idle process, then flow process failure.
When the method for calling of the indicating predetermined adopted flow process of predefine flow control information be multimachine forced synchronism call time, the subordinate computer node of specifying in the list of inquiry subordinate computer node, when the subordinate computer node of specifying all has idle process, sends call request to the subordinate computer node of specifying, otherwise, flow process failure.Call successfully, result will be called at the subordinate computer node place specified and synchronously return host node.Host node calls unified reception after end until all subordinate computer nodes and returns.
When the method for calling of the indicating predetermined adopted flow process of predefine flow control information is unit asynchronous call, a subordinate computer node in the list of inquiry subordinate computer node, the idle process quantity according to this subordinate computer node sends call request.Call successfully, will call at this subordinate computer node place that result is asynchronous returns host node.Here, host node often receives one and calls and return the node just returned to transmission and send new call request.
When the method for calling of the indicating predetermined adopted flow process of predefine flow control information is multimachine asynchronous call, the subordinate computer node of specifying in the list of inquiry subordinate computer node, the idle process quantity according to the subordinate computer node of specifying sends call request.Call successfully, will call at the subordinate computer node place specified that result is asynchronous returns host node.Here, host node often receives and returns the node just returned to transmission send new call request from calling of the subordinate computer node of specifying.
In addition, host node can send call request to subordinate computer node in the connection session of query manipulation, can ensure the accurate of subordinate computer node status information further like this.
One of ordinary skill in the art will appreciate that the hardware that all or part of step in above-described embodiment can carry out instruction relevant by program completes, this program can be stored in computer-readable recording medium, and storage medium can comprise ROM, RAM, disk or CD etc.Those skilled in the art can carry out various change and modification to the present invention and not depart from the spirit and scope of the present invention.Like this, if belong within the scope of the claims in the present invention and equivalent technologies thereof to these amendments of the present invention and modification, then the present invention is also intended to comprise these change and modification.
Above, the specific embodiment of the present invention is described with reference to the accompanying drawings.But those skilled in the art can understand, when without departing from the spirit and scope of the present invention, various change and replacement can also be done to the specific embodiment of the present invention.These change and replace and all drop in claims of the present invention limited range.
Claims (16)
1. across a machine dispatching method, it is characterized in that, comprise the following steps:
A () receives predefine flow execution request at host node place,
B () reads predefine flow process configuration information at host node place,
C () reads subordinate computer node information at host node place, and load subordinate computer node list,
D () reads predefine flow control information at host node place, and send call request according to predefine flow control information and subordinate computer node information to subordinate computer node,
E () performs call request at subordinate computer node place,
F () will call result at subordinate computer node place and return host node,
Wherein, subordinate computer node information comprises the information of the processing power about subordinate computer node, the information of processing power indicates corresponding subordinate computer node can be suitable for performing which application program or specific instruction sequence, predefine flow control information is made up of one or more orderly Row control order, and it comprises the method for calling of predefine flow process, call parameters, application program identification or specific instruction sequence mark.
2. method according to claim 1, is characterized in that,
In step (d),
Before sending call request to subordinate computer node, comprise query manipulation further, wherein,
This query manipulation comprises:
Sent the step of query argument to subordinate computer node by host node, and,
Returned the step of subordinate computer node state to host node by subordinate computer node.
3. method according to claim 2, is characterized in that,
In step (d),
Call request is sent to subordinate computer node in the connection session of query manipulation.
4. method according to claim 2, is characterized in that,
In step (d),
Call request is sent to subordinate computer node in newly-built connection session.
5. method according to claim 2, is characterized in that,
Subordinate computer node state is the quantity of idle process.
6. method according to claim 2, is characterized in that,
In step (d),
When the method for calling of the indicating predetermined adopted flow process of predefine flow control information be per-unit synchronous call time, the first subordinate computer node in the list of inquiry subordinate computer node, and,
When the first available free process of subordinate computer node, send call request to the first subordinate computer node,
When the first subordinate computer node does not have idle process, flow process failure.
7. method according to claim 2, is characterized in that,
In step (d),
When the method for calling of the indicating predetermined adopted flow process of predefine flow control information be Multi-Machine Synchronous call time, the first subordinate computer node in the list of inquiry subordinate computer node, and,
When the first available free process of subordinate computer node, send call request to the first subordinate computer node,
When the first subordinate computer node does not have idle process, the second subordinate computer node in the list of inquiry subordinate computer node,
When the second available free process of subordinate computer node, send call request to the second subordinate computer node.
8. method according to claim 2, is characterized in that,
In step (d),
When the method for calling of the indicating predetermined adopted flow process of predefine flow control information be multimachine forced synchronism call time, the subordinate computer node of specifying in the list of inquiry subordinate computer node,
When the subordinate computer node of specifying all has idle process, send call request to the subordinate computer node of specifying, otherwise, flow process failure;
In step (f),
Result will be called at the subordinate computer node place specified and synchronously return host node.
9. method according to claim 2, is characterized in that,
In step (d),
When the method for calling of the indicating predetermined adopted flow process of predefine flow control information is unit asynchronous call, the first subordinate computer node in the list of inquiry subordinate computer node, the idle process quantity according to the first subordinate computer node sends call request;
In step (f),
To call at the first subordinate computer node place that result is asynchronous returns host node.
10. method according to claim 9, is characterized in that,
A new call request is sent at host node first subordinate computer node just returned to transmission after calling result received from the first subordinate computer node.
11. methods according to claim 2, is characterized in that,
In step (d),
When the method for calling of the indicating predetermined adopted flow process of predefine flow control information is multimachine asynchronous call, the subordinate computer node of specifying in the list of inquiry subordinate computer node, the idle process quantity according to the subordinate computer node of specifying sends call request;
In step (f),
To call at the subordinate computer node place specified that result is asynchronous returns host node.
12. methods according to claim 11, is characterized in that,
Host node receive from the subordinate computer node of specifying call result after this subordinate computer node of specifying of just returning to transmission send new call request.
13. 1 kinds, across machine dispatching system, is characterized in that, comprise host node and subordinate computer node, wherein,
Host node is configured to send call request according to subordinate computer node information, predefine flow control information and subordinate computer node state to subordinate computer node;
Subordinate computer node is configured to perform call request and will call result return host node,
Wherein, subordinate computer node information comprises the information of the processing power about subordinate computer node, the information of processing power indicates corresponding subordinate computer node can be suitable for performing which application program or specific instruction sequence, predefine flow control information is made up of one or more orderly Row control order, and it comprises the method for calling of predefine flow process, call parameters, application program identification or specific instruction sequence mark.
14. according to claim 13ly is characterized in that across machine dispatching system,
Also store respective subordinate computer node information in subordinate computer node, described respective subordinate computer node information is consistent with the subordinate computer node information stored in host node.
15. according to claim 13ly is characterized in that across machine dispatching system,
Host node connects acquisition conversation subordinate computer node state by initiating inquiry to subordinate computer node, wherein, connects session send call request directly to subordinate computer node by this inquiry.
16. according to claim 13ly is characterized in that across machine dispatching system, and host node and one or more subordinate computer node are deployed on Same Physical machine jointly.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201110053551.0A CN102681881B (en) | 2011-03-07 | 2011-03-07 | Across machine dispatching method and system thereof |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201110053551.0A CN102681881B (en) | 2011-03-07 | 2011-03-07 | Across machine dispatching method and system thereof |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102681881A CN102681881A (en) | 2012-09-19 |
| CN102681881B true CN102681881B (en) | 2015-09-16 |
Family
ID=46813852
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201110053551.0A Active CN102681881B (en) | 2011-03-07 | 2011-03-07 | Across machine dispatching method and system thereof |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102681881B (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103347053A (en) * | 2013-06-19 | 2013-10-09 | 成都市欧冠信息技术有限责任公司 | Remote coprocessing procedure call method based on pipeline technology |
| CN104407923A (en) * | 2014-10-31 | 2015-03-11 | 百度在线网络技术（北京）有限公司 | Cluster task balancing method and device based on single node triggering |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1750486A (en) * | 2005-08-16 | 2006-03-22 | 西安电子科技大学 | Network measuring system structure and its realizing method |
| CN101727389A (en) * | 2009-11-23 | 2010-06-09 | 中兴通讯股份有限公司 | Automatic test system and method of distributed integrated service |
| CN101751288A (en) * | 2008-12-12 | 2010-06-23 | 中国移动通信集团山东有限公司 | Method, device and system applying process scheduler |
-
2011
- 2011-03-07 CN CN201110053551.0A patent/CN102681881B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1750486A (en) * | 2005-08-16 | 2006-03-22 | 西安电子科技大学 | Network measuring system structure and its realizing method |
| CN101751288A (en) * | 2008-12-12 | 2010-06-23 | 中国移动通信集团山东有限公司 | Method, device and system applying process scheduler |
| CN101727389A (en) * | 2009-11-23 | 2010-06-09 | 中兴通讯股份有限公司 | Automatic test system and method of distributed integrated service |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102681881A (en) | 2012-09-19 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107145380B (en) | Virtual resource arranging method and device | |
| CN105472042B (en) | The message-oriented middleware system and its data transferring method of WEB terminal control | |
| CN105045658A (en) | Method for realizing dynamic dispatching distribution of task by multi-core embedded DSP (Data Structure Processor) | |
| CN111682973B (en) | Method and system for arranging edge cloud | |
| CN108804238B (en) | Soft bus communication method based on remote procedure call | |
| CN105450618A (en) | Operation method and operation system of big data process through API (Application Programming Interface) server | |
| CN105683939A (en) | A computing platform, a reconfigurable hardware device and a method for simultaneously executing processes on dynamically reconfigurable hardware device, such as an FPGA, as well as instruction set processors, such as a CPU, and a related computer readable medium. | |
| US10498817B1 (en) | Performance tuning in distributed computing systems | |
| CN107479984B (en) | Distributed spatial data processing system based on message | |
| WO2021103646A1 (en) | Pod deployment method and device | |
| CN102592198A (en) | Workflow engine supporting combined service | |
| CN110955506A (en) | Distributed job scheduling processing method | |
| CN102968303A (en) | Program design system and program design method | |
| CN104753706A (en) | Distributed cluster configuration management method and distributed cluster configuration management device | |
| CN110704465A (en) | Method, device and storage medium for processing service work order table | |
| CN103677983A (en) | Scheduling method and device of application | |
| CN113742033A (en) | Kubernetes cluster federal system and implementation method thereof | |
| CN110134533B (en) | System and method capable of scheduling data in batches | |
| CN109376020B (en) | Data processing method, device and storage medium under multi-block chain interaction concurrence | |
| CN102681881B (en) | Across machine dispatching method and system thereof | |
| CN109889406A (en) | For managing method, apparatus, equipment and the storage medium of network connection | |
| CN112395056A (en) | Embedded asymmetric real-time system and electric power secondary equipment | |
| CN110399206B (en) | IDC virtualization scheduling energy-saving system based on cloud computing environment | |
| CN116643854A (en) | Service arrangement method and device, flow controller and task processor | |
| CN107660281B (en) | System and method for synchronizing distributed computing runtime |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant |