Nothing Special   »   [go: up one dir, main page]

CN111078379B - Task scheduling method, system, mobile terminal and storage medium - Google Patents

Task scheduling method, system, mobile terminal and storage medium Download PDF

Info

Publication number
CN111078379B
CN111078379B CN201911243505.XA CN201911243505A CN111078379B CN 111078379 B CN111078379 B CN 111078379B CN 201911243505 A CN201911243505 A CN 201911243505A CN 111078379 B CN111078379 B CN 111078379B
Authority
CN
China
Prior art keywords
task
scheduling
broadcast
request
server
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
Application number
CN201911243505.XA
Other languages
Chinese (zh)
Other versions
CN111078379A (en
Inventor
李一华
李一平
蔡家昌
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Zonst Data Group Co ltd
Original Assignee
Zonst Data Group Co ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Zonst Data Group Co ltd filed Critical Zonst Data Group Co ltd
Priority to CN201911243505.XA priority Critical patent/CN111078379B/en
Publication of CN111078379A publication Critical patent/CN111078379A/en
Application granted granted Critical
Publication of CN111078379B publication Critical patent/CN111078379B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00Arrangements for program control, e.g. control units
    • G06F9/06Arrangements 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/46Multiprogramming arrangements
    • G06F9/48Program initiating; Program switching, e.g. by interrupt
    • G06F9/4806Task transfer initiation or dispatching
    • G06F9/4843Task transfer initiation or dispatching by program, e.g. task dispatcher, supervisor, operating system
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00Network arrangements or protocols for supporting network services or applications
    • H04L67/01Protocols
    • H04L67/10Protocols in which an application is distributed across nodes in the network

Landscapes

  • Engineering & Computer Science (AREA)
  • Software Systems (AREA)
  • Theoretical Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Hardware Redundancy (AREA)

Abstract

The invention is applicable to the technical field of computers, and provides a task scheduling method, a system, a mobile terminal and a storage medium, wherein the method comprises the following steps: receiving a task request sent by any client, and inquiring a target node according to the task request; a server cluster under a target node is obtained, task broadcasting is sent in the server cluster according to a task request, a scheduling result aiming at the task broadcasting is received, and the server cluster comprises at least one execution server; when the dispatching result is that the dispatching is successful, stopping the sending of the task broadcast, and obtaining the server number of the dispatching result sending end; and storing the server number and the task request corresponding to each other. According to the invention, by means of the design of sending task broadcasting in the server cluster, task scheduling of task requests by a plurality of task servers is triggered, the phenomenon of scheduling failure caused by idle operation when a designated server performs task scheduling is prevented, and the task scheduling efficiency is improved.

Description

Task scheduling method, system, mobile terminal and storage medium
Technical Field
The invention belongs to the technical field of computers, and particularly relates to a task scheduling method, a task scheduling system, a mobile terminal and a storage medium.
Background
The distributed computing system is an inexpensive, efficient and convenient-to-maintain computing system, and has important value in practical application. Task scheduling and resource management are important functions of a distributed computing system, and a platform capable of efficiently performing task scheduling for resource management has an important influence on the performance of the whole distributed computing system.
When the existing distributed computing system performs task scheduling, the corresponding servers are assigned in sequence to implement task scheduling, and when the servers are out of order, the tasks are caused to terminate scheduling, so that the task scheduling is performed manually, and the task scheduling efficiency is reduced.
Disclosure of Invention
The embodiment of the invention aims to provide a task scheduling method, a system, a mobile terminal and a storage medium, which aim to solve the problem of low task scheduling efficiency caused by implementing task scheduling by adopting a server assignment mode in the existing task scheduling.
The embodiment of the invention is realized in such a way that a task scheduling method comprises the following steps:
receiving a task request sent by any client, and inquiring a target node according to the task request;
a server cluster under the target node is obtained, task broadcasting is sent in the server cluster according to the task request, and a scheduling result aiming at the task broadcasting is received, wherein the server cluster comprises at least one execution server;
when the dispatching result is that dispatching is successful, stopping sending the task broadcast, and acquiring a server number of a dispatching result sending end;
and storing the server number and the task request in a corresponding mode.
Still further, the step of sending a task broadcast within the server cluster according to the task request includes:
acquiring a request address of the task request transmitting end, and acquiring a target address stored in the task request;
forming the task broadcast according to the request address and the target address;
and respectively acquiring broadcast addresses of the task servers in the server cluster, and sequentially sending the task broadcast according to the broadcast addresses.
Still further, after the step of receiving the scheduling result for the task broadcast, the method further includes:
and when the scheduling result for the task broadcast is not received within a preset time, switching the target node, and sending the task broadcast in the server cluster under the switched target node.
Further, the step of querying the target node according to the task request includes:
and acquiring a task identifier in the task request, and matching the task identifier with a local pre-stored node database to acquire the target node.
Further, the step of querying the target node according to the task request includes:
acquiring a node set, wherein a plurality of default nodes are arranged in the node set;
sequentially judging whether the default node is in an idle state or not;
and when judging that the current default node is in the idle state, setting the current default node as the target node.
It is another object of an embodiment of the present invention to provide a task scheduling system, including:
the node query module is used for receiving a task request sent by any client and querying a target node according to the task request;
the broadcast sending module is used for obtaining a server cluster under the target node, sending task broadcast in the server cluster according to the task request, and receiving a scheduling result aiming at the task broadcast, wherein the server cluster comprises at least one execution server;
and the information storage module is used for stopping the transmission of the task broadcast when the dispatching result is that the dispatching is successful, acquiring the server number of the dispatching result transmitting end, and storing the server number corresponding to the task request.
Still further, the broadcast transmitting module is further configured to:
acquiring a request address of the task request transmitting end, and acquiring a target address stored in the task request;
forming the task broadcast according to the request address and the target address;
and respectively acquiring broadcast addresses of the task servers in the server cluster, and sequentially sending the task broadcast according to the broadcast addresses.
Still further, the task scheduling system further includes:
and the node switching module is used for switching the target node when the scheduling result for the task broadcast is not received within preset time, and transmitting the task broadcast in the server cluster under the switched target node.
Another object of an embodiment of the present invention is to provide a mobile terminal, which includes a storage device and a processor, where the storage device is configured to store a computer program, and the processor runs the computer program to enable the mobile terminal to execute the task scheduling method described above.
Another object of an embodiment of the present invention is to provide a storage medium storing a computer program used in the above-mentioned mobile terminal, which when executed by a processor, implements the steps of the task scheduling method described above.
According to the embodiment of the invention, the task scheduling of the task requests is triggered by the design of sending the task broadcast in the server cluster, so that the phenomenon of scheduling failure caused by idle operation when a designated server performs task scheduling is prevented, the task scheduling efficiency is improved, and the subsequent information tracking for task scheduling is effectively facilitated by the design of storing the server numbers and the task requests correspondingly.
Drawings
FIG. 1 is a flow chart of a task scheduling method provided by a first embodiment of the present invention;
FIG. 2 is a flow chart of a task scheduling method provided by a second embodiment of the present invention;
fig. 3 is a schematic structural diagram of a task scheduling system according to a third embodiment of the present invention.
Detailed Description
The present invention will be described in further detail with reference to the drawings and examples, in order to make the objects, technical solutions and advantages of the present invention more apparent. It should be understood that the specific embodiments described herein are for purposes of illustration only and are not intended to limit the scope of the invention.
In order to illustrate the technical scheme of the invention, the following description is made by specific examples.
Example 1
Referring to fig. 1, a flowchart of a task scheduling method according to a first embodiment of the present invention includes the steps of:
step S10, receiving a task request sent by any client, and inquiring a target node according to the task request;
the task request comprises a task to be scheduled and a target scheduling address, and in the step, a mode based on a task identification or an idle state can be adopted to inquire the target node;
specifically, because different nodes implement scheduling tasks of a specified type, in the step, when the query of the target node is performed in a mode based on task identification, the task identification carried in the task request is acquired to correspondingly perform the query of the target node;
when the query of the target node is performed in an idle state-based mode, the idle node is acquired, and the acquired idle node is set as the target node, so that the working efficiency of each node is effectively ensured;
step S20, a server cluster under the target node is obtained, task broadcasting is sent in the server cluster according to the task request, and a scheduling result aiming at the task broadcasting is received;
the server cluster comprises at least one execution server, and the task scheduling of the task requests is triggered by sending a task broadcast design in the server cluster, so that the phenomenon of scheduling failure caused by idle operation when a designated server performs task scheduling is prevented;
preferably, in the step, whether the corresponding task server completes the scheduling task is judged by receiving the scheduling result;
step S30, stopping the transmission of the task broadcast and obtaining the server number of the transmission end of the dispatching result when the dispatching result is that the dispatching is successful;
the task broadcasting is stopped, so that the occurrence of broadcasting storm is effectively prevented, the stability of broadcasting transmission is improved, and the follow-up task is effectively facilitated by acquiring the serial number of the server;
step S40, storing the server number and the task request in a corresponding manner;
according to the method, the device and the system, the task broadcasting is sent in the server cluster, so that task scheduling of the task requests is triggered by a plurality of task servers, the phenomenon of scheduling failure caused by idle operation when a designated server performs task scheduling is prevented, the task scheduling efficiency is improved, and the subsequent information tracking for task scheduling is effectively facilitated through the design that the server numbers are stored corresponding to the task requests.
Example two
Referring to fig. 2, a flowchart of a task scheduling method according to a second embodiment of the present invention includes the steps of:
step S11, receiving a task request sent by any client, and acquiring a task identifier in the task request;
the task identifier can be stored in a mode of numbers, letters, characters or any two of the combination modes, and is used for mapping the scheduling type of the task request;
step S21, matching the task identifier with a local pre-stored node database to obtain the target node;
in the step, the task identification is matched with a node database, so that the accuracy of acquiring the target node is effectively improved, and the normal operation of subsequent task scheduling is ensured;
preferably, the step of acquiring the target node in the step S21 may further be:
acquiring a node set, wherein a plurality of default nodes are arranged in the node set;
sequentially judging whether the default node is in an idle state or not;
and when judging that the current default node is in the idle state, setting the current default node as the target node.
Step S31, obtaining a server cluster under the target node, obtaining a request address of the task request transmitting end, and obtaining a target address stored in the task request;
the server cluster comprises at least one execution server, and in the step, the accuracy of subsequent task scheduling is effectively ensured through the acquisition of the request address and the target storage address;
step S41, forming the task broadcast according to the request address and the target address;
step S51, respectively obtaining broadcast addresses of the task servers in the server cluster, sequentially sending the task broadcast according to the broadcast addresses, and receiving a scheduling result aiming at the task broadcast;
the task scheduling method comprises the steps of sending a task broadcast in a server cluster to trigger task scheduling of a plurality of task servers to task requests, so that scheduling failure caused by idle operation when a designated server performs task scheduling is prevented;
step S61, when the scheduling result for the task broadcast is not received within a preset time, switching the target node, and sending the task broadcast in the server cluster under the switched target node;
the preset time may be set with parameters according to user requirements, for example, 10 minutes, 15 minutes, or 20 minutes, and in this step, when it is determined that the scheduling result for the task broadcast is not received within the preset time, it is determined that the execution servers in the current server cluster do not complete task scheduling for the task request, so that it is necessary to re-send task broadcasts in other nodes to ensure scheduling operation of the task to be scheduled;
step S71, stopping the transmission of the task broadcast and obtaining the server number of the transmission end of the dispatching result when the dispatching result is that the dispatching is successful;
the task broadcasting is stopped, so that the occurrence of broadcasting storm is effectively prevented, the stability of broadcasting transmission is improved, and the follow-up task is effectively facilitated by acquiring the serial number of the server;
step S81, storing the server number and the task request;
according to the method, the device and the system, the task broadcasting is sent in the server cluster, so that task scheduling of the task requests is triggered by a plurality of task servers, the phenomenon of scheduling failure caused by idle operation when a designated server performs task scheduling is prevented, the task scheduling efficiency is improved, and the subsequent information tracking for task scheduling is effectively facilitated through the design that the server numbers are stored corresponding to the task requests.
Example III
Referring to fig. three, a schematic structural diagram of a task scheduling system 100 according to a third embodiment of the present invention includes a node query module 10, a broadcast transmission module 11, and an information storage module 12, where:
and the node query module 10 is used for receiving a task request sent by any client and querying a target node according to the task request.
Preferably, in this embodiment, the node query module 10 is further configured to: and acquiring a task identifier in the task request, and matching the task identifier with a local pre-stored node database to acquire the target node.
Further, the node query module 10 is further configured to: acquiring a node set, wherein a plurality of default nodes are arranged in the node set; sequentially judging whether the default node is in an idle state or not; and when judging that the current default node is in the idle state, setting the current default node as the target node.
The broadcast sending module 11 is configured to obtain a server cluster under the target node, send a task broadcast in the server cluster according to the task request, and receive a scheduling result for the task broadcast, where the server cluster includes at least one execution server.
Wherein, the broadcast transmitting module 11 is further configured to: acquiring a request address of the task request transmitting end, and acquiring a target address stored in the task request; forming the task broadcast according to the request address and the target address; and respectively acquiring broadcast addresses of the task servers in the server cluster, and sequentially sending the task broadcast according to the broadcast addresses.
And the information storage module 12 is configured to stop sending the task broadcast when the scheduling result is that the scheduling is successful, obtain a server number of the scheduling result sending end, and store the server number in correspondence with the task request.
Still further, the task scheduling system 100 further includes:
and the node switching module 13 is configured to switch the target node when the scheduling result for the task broadcast is not received within a preset time, and send the task broadcast in the server cluster under the target node after switching.
According to the method, the device and the system, the task broadcasting is sent in the server cluster, so that task scheduling of the task requests is triggered by a plurality of task servers, the phenomenon of scheduling failure caused by idle operation when a designated server performs task scheduling is prevented, the task scheduling efficiency is improved, and the subsequent information tracking for task scheduling is effectively facilitated through the design that the server numbers are stored corresponding to the task requests.
The embodiment also provides a mobile terminal, which comprises a storage device and a processor, wherein the storage device is used for storing a computer program, and the processor runs the computer program to enable the mobile terminal to execute the task scheduling method.
The present embodiment also provides a storage medium having stored thereon a computer program for use in the above-described mobile terminal, the program when executed comprising the steps of:
receiving a task request sent by any client, and inquiring a target node according to the task request;
a server cluster under the target node is obtained, task broadcasting is sent in the server cluster according to the task request, and a scheduling result aiming at the task broadcasting is received, wherein the server cluster comprises at least one execution server;
when the dispatching result is that dispatching is successful, stopping sending the task broadcast, and acquiring a server number of a dispatching result sending end;
and storing the server number and the task request in a corresponding mode. The storage medium includes: ROM/RAM, magnetic disks, optical disks, etc.
It will be apparent to those skilled in the art that, for convenience and brevity of description, only the above-described division of the functional units and modules is illustrated, and in practical application, the above-described functional allocation may be performed by different functional units or modules according to needs, i.e. the internal structure of the storage device is divided into different functional units or modules, so as to perform all or part of the above-described functions. The functional units and modules in the embodiment may be integrated in one processing unit, or each unit may exist alone physically, or two or more units may be integrated in one unit, where the integrated units may be implemented in a form of hardware or a form of a software functional unit. In addition, specific names of the functional units and modules are only for convenience of distinguishing from each other, and are not used for limiting the protection scope of the present application.
It will be appreciated by those skilled in the art that the constituent structures shown in fig. 3 do not constitute a limitation of the task scheduling system of the present invention, and may include more or less components than those illustrated, or may be combined with some components, or may be arranged differently, while the task scheduling method in fig. 1-2 is also implemented using more or less components, or may be combined with some components, or may be arranged differently, as shown in fig. 3. The units, modules, etc. referred to in the present invention refer to a series of computer programs capable of being executed by a processor (not shown) in the target task scheduling system and performing specific functions, which may be stored in a storage device (not shown) of the target task scheduling system.
The foregoing description of the preferred embodiments of the invention is not intended to be limiting, but rather is intended to cover all modifications, equivalents, and alternatives falling within the spirit and principles of the invention.

Claims (4)

1. A method of task scheduling, the method comprising:
receiving a task request sent by any client, and inquiring a target node according to the task request;
a server cluster under the target node is obtained, task broadcasting is sent in the server cluster according to the task request, and a scheduling result aiming at the task broadcasting is received, wherein the server cluster comprises at least one execution server;
when the dispatching result is that dispatching is successful, stopping sending the task broadcast, and acquiring a server number of a dispatching result sending end;
storing the server number and the task request correspondingly;
the step of sending a task broadcast in the server cluster according to the task request comprises the following steps:
acquiring a request address of the task request transmitting end, and acquiring a target address stored in the task request;
forming the task broadcast according to the request address and the target address;
respectively acquiring broadcast addresses of task servers in the server cluster, and sequentially transmitting the task broadcast according to the broadcast addresses;
after the step of receiving the scheduling result broadcast for the task, the method further includes:
when the scheduling result for the task broadcast is not received within a preset time, switching the target node, and sending the task broadcast in the server cluster under the switched target node, wherein the preset time is 10 minutes or 15 minutes or 20 minutes;
the step of querying the target node according to the task request comprises the following steps:
acquiring a task identifier in the task request, and matching the task identifier with a local pre-stored node database to acquire the target node, wherein the task representation is stored in a numerical mode, a letter mode, a text mode or a combination mode of any two modes, and the task identifier is used for mapping a scheduling type of the task request;
the step of querying the target node according to the task request comprises the following steps:
acquiring a node set, wherein a plurality of default nodes are arranged in the node set;
sequentially judging whether the default node is in an idle state or not;
and when judging that the current default node is in the idle state, setting the current default node as the target node.
2. A task scheduling system for implementing the task scheduling method of claim 1, the system comprising:
the node query module is used for receiving a task request sent by any client and querying a target node according to the task request;
the broadcast sending module is used for obtaining a server cluster under the target node, sending task broadcast in the server cluster according to the task request, and receiving a scheduling result aiming at the task broadcast, wherein the server cluster comprises at least one execution server;
and the information storage module is used for stopping the transmission of the task broadcast when the dispatching result is that the dispatching is successful, acquiring the server number of the dispatching result transmitting end, and storing the server number corresponding to the task request.
3. A mobile terminal comprising a storage device for storing a computer program and a processor that runs the computer program to cause the mobile terminal to perform the task scheduling method of claim 1.
4. A storage medium storing a computer program for use in the mobile terminal of claim 3, which when executed by a processor, implements the steps of the task scheduling method of claim 1.
CN201911243505.XA 2019-12-06 2019-12-06 Task scheduling method, system, mobile terminal and storage medium Active CN111078379B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201911243505.XA CN111078379B (en) 2019-12-06 2019-12-06 Task scheduling method, system, mobile terminal and storage medium

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201911243505.XA CN111078379B (en) 2019-12-06 2019-12-06 Task scheduling method, system, mobile terminal and storage medium

Publications (2)

Publication Number Publication Date
CN111078379A CN111078379A (en) 2020-04-28
CN111078379B true CN111078379B (en) 2024-01-09

Family

ID=70313104

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201911243505.XA Active CN111078379B (en) 2019-12-06 2019-12-06 Task scheduling method, system, mobile terminal and storage medium

Country Status (1)

Country Link
CN (1) CN111078379B (en)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112948085A (en) * 2021-03-03 2021-06-11 杉数科技(北京)有限公司 Task scheduling processing method and device

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7685281B1 (en) * 2004-02-13 2010-03-23 Habanero Holdings, Inc. Programmatic instantiation, provisioning and management of fabric-backplane enterprise servers
CN103220354A (en) * 2013-04-18 2013-07-24 广东宜通世纪科技股份有限公司 Method for achieving load balancing of server cluster
CN107688496A (en) * 2017-07-24 2018-02-13 上海壹账通金融科技有限公司 Task distribution formula processing method, device, storage medium and server
CN109743390A (en) * 2019-01-04 2019-05-10 深圳壹账通智能科技有限公司 Method for scheduling task, device, computer equipment and storage medium
CN110290180A (en) * 2019-05-31 2019-09-27 北京大米科技有限公司 Distributed task dispatching method, apparatus, computer equipment and storage medium

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US11436544B2 (en) * 2014-09-03 2022-09-06 CloudLeaf, Inc. System for managing an industrial workflow

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7685281B1 (en) * 2004-02-13 2010-03-23 Habanero Holdings, Inc. Programmatic instantiation, provisioning and management of fabric-backplane enterprise servers
CN103220354A (en) * 2013-04-18 2013-07-24 广东宜通世纪科技股份有限公司 Method for achieving load balancing of server cluster
CN107688496A (en) * 2017-07-24 2018-02-13 上海壹账通金融科技有限公司 Task distribution formula processing method, device, storage medium and server
CN109743390A (en) * 2019-01-04 2019-05-10 深圳壹账通智能科技有限公司 Method for scheduling task, device, computer equipment and storage medium
CN110290180A (en) * 2019-05-31 2019-09-27 北京大米科技有限公司 Distributed task dispatching method, apparatus, computer equipment and storage medium

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
"Interference and locality-aware task scheduling for MapReduce applications in virtual clusters";Xiangping Bu 等;《Proceedings of the 22nd international symposium on High-performance parallel and distributed computing》;第227-238页 *
"农业农村信息化云服务平台集成关键技术研究";杨国才;《中国优秀博士学位论文全文数据库(农业科技辑)》;第D043-2页 *

Also Published As

Publication number Publication date
CN111078379A (en) 2020-04-28

Similar Documents

Publication Publication Date Title
CN108052675B (en) Log management method, system and computer readable storage medium
CN106550003B (en) Load balancing control method, device and system
CN107277029B (en) Remote procedure call method and device and computer equipment
CN108121511B (en) Data processing method, device and equipment in distributed edge storage system
CN109756417B (en) Offline message distribution method, server and storage medium
CN110336848B (en) Scheduling method, scheduling system and scheduling equipment for access request
CN111885216B (en) DNS query method, device, equipment and storage medium
US20160269479A1 (en) Cloud virtual server scheduling method and apparatus
CN110413845B (en) Resource storage method and device based on Internet of things operating system
CN111818117A (en) Data updating method and device, storage medium and electronic equipment
CN107370808B (en) Method for performing distributed processing on big data task
CN112506670A (en) Multi-node automatic operation and maintenance task processing method, system and storage medium
CN112685175B (en) Construction method and device of service topological graph and computer readable storage medium
CN111078379B (en) Task scheduling method, system, mobile terminal and storage medium
CN115329005A (en) Multi-cluster cooperation method, system, device and computer readable storage medium
CN111159131A (en) Performance optimization method, device, equipment and computer readable storage medium
CN106550021B (en) Push method and device for push message
CN111143241B (en) Memory data migration method and device and storage medium
CN107425994B (en) Method, terminal and server for realizing remote parameter management
CN107193654B (en) Resource operation method and device of distributed system and distributed system
CN101753561B (en) Business cluster processing method and cluster system
CN104639379A (en) Proxy testing method and device
CN105610593B (en) Method and device for distributing resource identification in network management system
CN112131263B (en) Software package acquisition method, system, device, electronic equipment and storage medium
CN106487916B (en) Statistical method and device for connection number

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant